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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.7K Apr 12 09:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 09:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 09:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 09:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 10:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 10:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 10:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 10:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K 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 PolyORBNT-COL-S05J40-CTLFireability-2024-00
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-2024-01
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-2024-02
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-2024-03
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-2024-04
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-2024-05
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-2024-06
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-2024-07
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-2024-08
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-2024-09
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-2024-10
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-2024-11
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-2024-12
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-2024-13
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-2024-14
FORMULA_NAME PolyORBNT-COL-S05J40-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717257653418

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J40
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:00:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:00:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:00:54] [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 16:00:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 16:00:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 588 ms
[2024-06-01 16:00:55] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
[2024-06-01 16:00:55] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2024-06-01 16:00:55] [INFO ] Skeletonized 15 HLPN properties in 3 ms. Removed 1 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 35 to 32
RANDOM walk for 40000 steps (3200 resets) in 995 ms. (40 steps per ms) remains 16/32 properties
BEST_FIRST walk for 4003 steps (101 resets) in 85 ms. (46 steps per ms) remains 6/16 properties
BEST_FIRST walk for 4003 steps (165 resets) in 36 ms. (108 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4004 steps (155 resets) in 28 ms. (138 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4002 steps (55 resets) in 26 ms. (148 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4001 steps (97 resets) in 13 ms. (285 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4003 steps (154 resets) in 15 ms. (250 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4003 steps (166 resets) in 22 ms. (174 steps per ms) remains 6/6 properties
// Phase 1: matrix 38 rows 48 cols
[2024-06-01 16:00:55] [INFO ] Computed 13 invariants in 4 ms
[2024-06-01 16:00:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 13/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 3 (OVERLAPS) 14/42 variables, 3/8 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-06-01 16:00:56] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/9 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/44 variables, 1/10 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/48 variables, 4/14 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 38/86 variables, 48/62 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/86 variables, 1/63 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/86 variables, 0/63 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 5 solved, 1 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/12 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/34 variables, 2/3 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/41 variables, 4/7 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/42 variables, 1/8 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/47 variables, 5/13 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 1/14 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-06-01 16:00:56] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 2 ms to minimize.
[2024-06-01 16:00:56] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/47 variables, 2/16 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/47 variables, 0/16 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 38/85 variables, 47/63 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/85 variables, 1/64 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/85 variables, 0/64 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/86 variables, 1/65 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/86 variables, 1/66 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/86 variables, 0/66 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/86 variables, 0/66 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 66 constraints, problems are : Problem set: 5 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 475ms problems are : Problem set: 5 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 38/38 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 43 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 40 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 38 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 38 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 38 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 37 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 35 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 34 transition count 28
Applied a total of 27 rules in 42 ms. Remains 34 /48 variables (removed 14) and now considering 28/38 (removed 10) transitions.
Running 25 sub problems to find dead transitions.
// Phase 1: matrix 28 rows 34 cols
[2024-06-01 16:00:56] [INFO ] Computed 12 invariants in 4 ms
[2024-06-01 16:00:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 1/34 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 28/62 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/62 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 47 constraints, problems are : Problem set: 0 solved, 25 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 16:00:56] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 1/34 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 28/62 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 25/73 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 16:00:56] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/62 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 0/62 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 74 constraints, problems are : Problem set: 0 solved, 25 unsolved in 469 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 2/2 constraints]
After SMT, in 723ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 727ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 789 ms. Remains : 34/48 places, 28/38 transitions.
RANDOM walk for 40006 steps (4681 resets) in 244 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1337 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Probably explored full state space saw : 335 states, properties seen :0
Probabilistic random walk after 889 steps, saw 335 distinct states, run finished after 15 ms. (steps per millisecond=59 ) properties seen :0
Explored full state space saw : 335 states, properties seen :0
Exhaustive walk after 889 steps, saw 335 distinct states, run finished after 3 ms. (steps per millisecond=296 ) properties seen :0
Successfully simplified 6 atomic propositions for a total of 13 simplifications.
[2024-06-01 16:00:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 16:00:57] [INFO ] Flatten gal took : 24 ms
FORMULA PolyORBNT-COL-S05J40-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:00:57] [INFO ] Flatten gal took : 7 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-06-01 16:00:57] [INFO ] Unfolded HLPN to a Petri net with 669 places and 1630 transitions 10784 arcs in 49 ms.
[2024-06-01 16:00:57] [INFO ] Unfolded 15 HLPN properties in 1 ms.
[2024-06-01 16:00:57] [INFO ] Reduced 90 identical enabling conditions.
[2024-06-01 16:00:57] [INFO ] Reduced 90 identical enabling conditions.
[2024-06-01 16:00:57] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 16:00:57] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 16:00:57] [INFO ] Reduced 90 identical enabling conditions.
[2024-06-01 16:00:57] [INFO ] Reduced 555 identical enabling conditions.
[2024-06-01 16:00:57] [INFO ] Reduced 555 identical enabling conditions.
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 546 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 935/935 transitions.
Applied a total of 0 rules in 15 ms. Remains 629 /629 variables (removed 0) and now considering 935/935 (removed 0) transitions.
Running 929 sub problems to find dead transitions.
[2024-06-01 16:00:57] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2024-06-01 16:00:57] [INFO ] Computed 102 invariants in 58 ms
[2024-06-01 16:00:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 929 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 929 unsolved
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD416 is UNSAT
At refinement iteration 3 (OVERLAPS) 9/627 variables, 9/100 constraints. Problems are: Problem set: 78 solved, 851 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 627/1560 variables, and 100 constraints, problems are : Problem set: 78 solved, 851 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/629 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 78 solved, 851 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 78 solved, 851 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 78 solved, 851 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 78 solved, 851 unsolved
At refinement iteration 3 (OVERLAPS) 9/627 variables, 9/100 constraints. Problems are: Problem set: 78 solved, 851 unsolved
[2024-06-01 16:01:32] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 4 ms to minimize.
[2024-06-01 16:01:37] [INFO ] Deduced a trap composed of 212 places in 295 ms of which 5 ms to minimize.
[2024-06-01 16:01:38] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:01:38] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 3 ms to minimize.
[2024-06-01 16:01:38] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:01:38] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 2 ms to minimize.
[2024-06-01 16:01:38] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 2 ms to minimize.
[2024-06-01 16:01:38] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 2 ms to minimize.
[2024-06-01 16:01:39] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 9/109 constraints. Problems are: Problem set: 78 solved, 851 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 627/1560 variables, and 109 constraints, problems are : Problem set: 78 solved, 851 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/629 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/929 constraints, Known Traps: 9/9 constraints]
After SMT, in 41852ms problems are : Problem set: 78 solved, 851 unsolved
Search for dead transitions found 78 dead transitions in 41865ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 78 transitions.
[2024-06-01 16:01:39] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
// Phase 1: matrix 853 rows 629 cols
[2024-06-01 16:01:39] [INFO ] Computed 102 invariants in 37 ms
[2024-06-01 16:01:39] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-06-01 16:01:39] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
[2024-06-01 16:01:39] [INFO ] Invariant cache hit.
[2024-06-01 16:01:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:01:40] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 629/629 places, 857/935 transitions.
Applied a total of 0 rules in 20 ms. Remains 629 /629 variables (removed 0) and now considering 857/857 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42739 ms. Remains : 629/629 places, 857/935 transitions.
Support contains 546 out of 629 places after structural reductions.
[2024-06-01 16:01:40] [INFO ] Flatten gal took : 122 ms
[2024-06-01 16:01:40] [INFO ] Flatten gal took : 104 ms
[2024-06-01 16:01:41] [INFO ] Input system was already deterministic with 857 transitions.
Reduction of identical properties reduced properties to check from 52 to 50
RANDOM walk for 40000 steps (2751 resets) in 1106 ms. (36 steps per ms) remains 14/50 properties
BEST_FIRST walk for 40003 steps (380 resets) in 715 ms. (55 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1024 resets) in 153 ms. (259 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (133 resets) in 256 ms. (155 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (212 resets) in 88 ms. (449 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40001 steps (578 resets) in 79 ms. (500 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (622 resets) in 361 ms. (110 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1212 resets) in 133 ms. (298 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (941 resets) in 198 ms. (201 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1023 resets) in 198 ms. (201 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (571 resets) in 424 ms. (94 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (581 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1024 resets) in 109 ms. (363 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (76 resets) in 348 ms. (114 steps per ms) remains 12/12 properties
[2024-06-01 16:01:42] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
[2024-06-01 16:01:42] [INFO ] Invariant cache hit.
[2024-06-01 16:01:42] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp47 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp51 is UNSAT
At refinement iteration 2 (OVERLAPS) 265/622 variables, 94/95 constraints. Problems are: Problem set: 5 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/622 variables, 0/95 constraints. Problems are: Problem set: 5 solved, 7 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp46 is UNSAT
At refinement iteration 4 (OVERLAPS) 7/629 variables, 7/102 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/629 variables, 0/102 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 853/1482 variables, 629/731 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1482 variables, 1/732 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1482 variables, 0/732 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1482 variables, 0/732 constraints. Problems are: Problem set: 11 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1482/1482 variables, and 732 constraints, problems are : Problem set: 11 solved, 1 unsolved in 1170 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 629/629 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 309/310 variables, 2/2 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/2 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 84/394 variables, 43/45 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/45 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 205/599 variables, 41/86 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 0/86 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/615 variables, 8/94 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 0/94 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/627 variables, 7/101 constraints. Problems are: Problem set: 11 solved, 1 unsolved
[2024-06-01 16:01:45] [INFO ] Deduced a trap composed of 96 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:01:45] [INFO ] Deduced a trap composed of 291 places in 230 ms of which 4 ms to minimize.
[2024-06-01 16:01:45] [INFO ] Deduced a trap composed of 254 places in 233 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/627 variables, 3/104 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/627 variables, 0/104 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/628 variables, 1/105 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/628 variables, 0/105 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 853/1481 variables, 628/733 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1481 variables, 1/734 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1481 variables, 0/734 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1482 variables, 1/735 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1482 variables, 1/736 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1482 variables, 0/736 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1482 variables, 0/736 constraints. Problems are: Problem set: 11 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1482/1482 variables, and 736 constraints, problems are : Problem set: 11 solved, 1 unsolved in 1722 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 629/629 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/12 constraints, Known Traps: 3/3 constraints]
After SMT, in 3593ms problems are : Problem set: 11 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 1 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 624 transition count 811
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 97 place count 578 transition count 811
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 97 place count 578 transition count 766
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 187 place count 533 transition count 766
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 188 place count 532 transition count 765
Iterating global reduction 2 with 1 rules applied. Total rules applied 189 place count 532 transition count 765
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 193 place count 530 transition count 763
Applied a total of 193 rules in 214 ms. Remains 530 /629 variables (removed 99) and now considering 763/857 (removed 94) transitions.
Running 757 sub problems to find dead transitions.
[2024-06-01 16:01:46] [INFO ] Flow matrix only has 759 transitions (discarded 4 similar events)
// Phase 1: matrix 759 rows 530 cols
[2024-06-01 16:01:46] [INFO ] Computed 97 invariants in 28 ms
[2024-06-01 16:01:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-06-01 16:01:52] [INFO ] Deduced a trap composed of 136 places in 163 ms of which 4 ms to minimize.
[2024-06-01 16:01:53] [INFO ] Deduced a trap composed of 136 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:01:53] [INFO ] Deduced a trap composed of 136 places in 225 ms of which 4 ms to minimize.
[2024-06-01 16:01:53] [INFO ] Deduced a trap composed of 136 places in 206 ms of which 3 ms to minimize.
[2024-06-01 16:01:54] [INFO ] Deduced a trap composed of 136 places in 181 ms of which 3 ms to minimize.
[2024-06-01 16:01:54] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:01:54] [INFO ] Deduced a trap composed of 136 places in 195 ms of which 4 ms to minimize.
[2024-06-01 16:01:54] [INFO ] Deduced a trap composed of 136 places in 154 ms of which 5 ms to minimize.
[2024-06-01 16:01:54] [INFO ] Deduced a trap composed of 136 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:01:55] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:01:55] [INFO ] Deduced a trap composed of 136 places in 127 ms of which 3 ms to minimize.
[2024-06-01 16:01:55] [INFO ] Deduced a trap composed of 136 places in 132 ms of which 3 ms to minimize.
[2024-06-01 16:01:55] [INFO ] Deduced a trap composed of 136 places in 131 ms of which 3 ms to minimize.
[2024-06-01 16:01:55] [INFO ] Deduced a trap composed of 136 places in 133 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 14/106 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-06-01 16:02:01] [INFO ] Deduced a trap composed of 149 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:02:01] [INFO ] Deduced a trap composed of 136 places in 151 ms of which 3 ms to minimize.
[2024-06-01 16:02:01] [INFO ] Deduced a trap composed of 167 places in 230 ms of which 5 ms to minimize.
[2024-06-01 16:02:01] [INFO ] Deduced a trap composed of 136 places in 207 ms of which 4 ms to minimize.
[2024-06-01 16:02:02] [INFO ] Deduced a trap composed of 136 places in 186 ms of which 4 ms to minimize.
[2024-06-01 16:02:02] [INFO ] Deduced a trap composed of 136 places in 215 ms of which 4 ms to minimize.
[2024-06-01 16:02:02] [INFO ] Deduced a trap composed of 136 places in 208 ms of which 3 ms to minimize.
[2024-06-01 16:02:02] [INFO ] Deduced a trap composed of 136 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:02:03] [INFO ] Deduced a trap composed of 136 places in 187 ms of which 4 ms to minimize.
[2024-06-01 16:02:03] [INFO ] Deduced a trap composed of 136 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:02:03] [INFO ] Deduced a trap composed of 136 places in 189 ms of which 4 ms to minimize.
[2024-06-01 16:02:03] [INFO ] Deduced a trap composed of 136 places in 172 ms of which 4 ms to minimize.
[2024-06-01 16:02:07] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/1289 variables, and 119 constraints, problems are : Problem set: 0 solved, 757 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 757/757 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 757 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 27/119 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-06-01 16:02:09] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 2 ms to minimize.
[2024-06-01 16:02:10] [INFO ] Deduced a trap composed of 140 places in 221 ms of which 4 ms to minimize.
[2024-06-01 16:02:10] [INFO ] Deduced a trap composed of 170 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:02:10] [INFO ] Deduced a trap composed of 140 places in 193 ms of which 4 ms to minimize.
[2024-06-01 16:02:10] [INFO ] Deduced a trap composed of 136 places in 184 ms of which 2 ms to minimize.
[2024-06-01 16:02:11] [INFO ] Deduced a trap composed of 136 places in 212 ms of which 4 ms to minimize.
[2024-06-01 16:02:11] [INFO ] Deduced a trap composed of 136 places in 201 ms of which 4 ms to minimize.
[2024-06-01 16:02:11] [INFO ] Deduced a trap composed of 140 places in 191 ms of which 3 ms to minimize.
[2024-06-01 16:02:11] [INFO ] Deduced a trap composed of 136 places in 219 ms of which 3 ms to minimize.
[2024-06-01 16:02:12] [INFO ] Deduced a trap composed of 140 places in 214 ms of which 4 ms to minimize.
[2024-06-01 16:02:12] [INFO ] Deduced a trap composed of 136 places in 192 ms of which 3 ms to minimize.
[2024-06-01 16:02:12] [INFO ] Deduced a trap composed of 136 places in 174 ms of which 3 ms to minimize.
[2024-06-01 16:02:12] [INFO ] Deduced a trap composed of 170 places in 247 ms of which 7 ms to minimize.
[2024-06-01 16:02:12] [INFO ] Deduced a trap composed of 136 places in 219 ms of which 3 ms to minimize.
[2024-06-01 16:02:13] [INFO ] Deduced a trap composed of 136 places in 201 ms of which 4 ms to minimize.
[2024-06-01 16:02:13] [INFO ] Deduced a trap composed of 136 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:02:13] [INFO ] Deduced a trap composed of 136 places in 220 ms of which 3 ms to minimize.
[2024-06-01 16:02:13] [INFO ] Deduced a trap composed of 179 places in 181 ms of which 3 ms to minimize.
[2024-06-01 16:02:13] [INFO ] Deduced a trap composed of 136 places in 200 ms of which 4 ms to minimize.
[2024-06-01 16:02:14] [INFO ] Deduced a trap composed of 173 places in 203 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-06-01 16:02:16] [INFO ] Deduced a trap composed of 140 places in 216 ms of which 7 ms to minimize.
[2024-06-01 16:02:16] [INFO ] Deduced a trap composed of 136 places in 209 ms of which 4 ms to minimize.
[2024-06-01 16:02:16] [INFO ] Deduced a trap composed of 140 places in 184 ms of which 4 ms to minimize.
[2024-06-01 16:02:17] [INFO ] Deduced a trap composed of 136 places in 179 ms of which 3 ms to minimize.
[2024-06-01 16:02:17] [INFO ] Deduced a trap composed of 136 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:02:17] [INFO ] Deduced a trap composed of 140 places in 228 ms of which 5 ms to minimize.
[2024-06-01 16:02:17] [INFO ] Deduced a trap composed of 136 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:02:18] [INFO ] Deduced a trap composed of 136 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:02:18] [INFO ] Deduced a trap composed of 140 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:02:18] [INFO ] Deduced a trap composed of 136 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:02:18] [INFO ] Deduced a trap composed of 136 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:02:18] [INFO ] Deduced a trap composed of 140 places in 200 ms of which 3 ms to minimize.
[2024-06-01 16:02:19] [INFO ] Deduced a trap composed of 136 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:02:19] [INFO ] Deduced a trap composed of 136 places in 172 ms of which 3 ms to minimize.
[2024-06-01 16:02:19] [INFO ] Deduced a trap composed of 136 places in 158 ms of which 2 ms to minimize.
[2024-06-01 16:02:19] [INFO ] Deduced a trap composed of 136 places in 164 ms of which 4 ms to minimize.
[2024-06-01 16:02:19] [INFO ] Deduced a trap composed of 136 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:02:20] [INFO ] Deduced a trap composed of 136 places in 191 ms of which 3 ms to minimize.
[2024-06-01 16:02:20] [INFO ] Deduced a trap composed of 136 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:02:20] [INFO ] Deduced a trap composed of 140 places in 233 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(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 1)
(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)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/1289 variables, and 159 constraints, problems are : Problem set: 0 solved, 757 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/757 constraints, Known Traps: 67/67 constraints]
After SMT, in 41219ms problems are : Problem set: 0 solved, 757 unsolved
Search for dead transitions found 0 dead transitions in 41230ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41446 ms. Remains : 530/629 places, 763/857 transitions.
RANDOM walk for 40000 steps (2121 resets) in 239 ms. (166 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (195 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 543604 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :0 out of 1
Probabilistic random walk after 543604 steps, saw 163236 distinct states, run finished after 3004 ms. (steps per millisecond=180 ) properties seen :0
[2024-06-01 16:02:30] [INFO ] Flow matrix only has 759 transitions (discarded 4 similar events)
[2024-06-01 16:02:30] [INFO ] Invariant cache hit.
[2024-06-01 16:02:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/141 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 378/519 variables, 87/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/520 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/528 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:02:31] [INFO ] Deduced a trap composed of 161 places in 195 ms of which 4 ms to minimize.
[2024-06-01 16:02:31] [INFO ] Deduced a trap composed of 170 places in 214 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/528 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/528 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/529 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/529 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 759/1288 variables, 529/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1288 variables, 1/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1288 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1289 variables, 1/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1289 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1289 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1289/1289 variables, and 630 constraints, problems are : Problem set: 0 solved, 1 unsolved in 986 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 530/530 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/141 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 378/519 variables, 87/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/520 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/528 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/528 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:02:32] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:02:32] [INFO ] Deduced a trap composed of 185 places in 176 ms of which 2 ms to minimize.
[2024-06-01 16:02:32] [INFO ] Deduced a trap composed of 176 places in 179 ms of which 3 ms to minimize.
[2024-06-01 16:02:32] [INFO ] Deduced a trap composed of 176 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:02:33] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:02:33] [INFO ] Deduced a trap composed of 161 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:02:33] [INFO ] Deduced a trap composed of 173 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:02:33] [INFO ] Deduced a trap composed of 161 places in 152 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/528 variables, 8/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/528 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/529 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/529 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 759/1288 variables, 529/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1288 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1288 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/1289 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1289 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1289 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1289 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1289/1289 variables, and 639 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2013 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 530/530 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 3007ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 763/763 transitions.
Applied a total of 0 rules in 54 ms. Remains 530 /530 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 530/530 places, 763/763 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 763/763 transitions.
Applied a total of 0 rules in 48 ms. Remains 530 /530 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2024-06-01 16:02:34] [INFO ] Flow matrix only has 759 transitions (discarded 4 similar events)
[2024-06-01 16:02:34] [INFO ] Invariant cache hit.
[2024-06-01 16:02:34] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-06-01 16:02:34] [INFO ] Flow matrix only has 759 transitions (discarded 4 similar events)
[2024-06-01 16:02:34] [INFO ] Invariant cache hit.
[2024-06-01 16:02:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:02:36] [INFO ] Implicit Places using invariants and state equation in 2006 ms returned []
Implicit Place search using SMT with State Equation took 2540 ms to find 0 implicit places.
[2024-06-01 16:02:36] [INFO ] Redundant transitions in 73 ms returned []
Running 757 sub problems to find dead transitions.
[2024-06-01 16:02:36] [INFO ] Flow matrix only has 759 transitions (discarded 4 similar events)
[2024-06-01 16:02:36] [INFO ] Invariant cache hit.
[2024-06-01 16:02:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 757 unsolved
[2024-06-01 16:02:43] [INFO ] Deduced a trap composed of 136 places in 211 ms of which 4 ms to minimize.
[2024-06-01 16:02:43] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 4 ms to minimize.
[2024-06-01 16:02:43] [INFO ] Deduced a trap composed of 136 places in 221 ms of which 4 ms to minimize.
[2024-06-01 16:02:43] [INFO ] Deduced a trap composed of 136 places in 159 ms of which 2 ms to minimize.
[2024-06-01 16:02:44] [INFO ] Deduced a trap composed of 136 places in 152 ms of which 2 ms to minimize.
[2024-06-01 16:02:44] [INFO ] Deduced a trap composed of 136 places in 163 ms of which 3 ms to minimize.
[2024-06-01 16:02:44] [INFO ] Deduced a trap composed of 136 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:02:44] [INFO ] Deduced a trap composed of 136 places in 237 ms of which 3 ms to minimize.
[2024-06-01 16:02:45] [INFO ] Deduced a trap composed of 136 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:02:45] [INFO ] Deduced a trap composed of 136 places in 209 ms of which 4 ms to minimize.
[2024-06-01 16:02:45] [INFO ] Deduced a trap composed of 136 places in 233 ms of which 4 ms to minimize.
[2024-06-01 16:02:45] [INFO ] Deduced a trap composed of 136 places in 205 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 12/104 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 4 (OVERLAPS) 4/529 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 757 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 757 unsolved
Problem TDEAD504 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD544 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/530 variables, 1/109 constraints. Problems are: Problem set: 17 solved, 740 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1289 variables, and 109 constraints, problems are : Problem set: 17 solved, 740 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 757/757 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 17 solved, 740 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 86/86 constraints. Problems are: Problem set: 17 solved, 740 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 6/92 constraints. Problems are: Problem set: 17 solved, 740 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 12/104 constraints. Problems are: Problem set: 17 solved, 740 unsolved
[2024-06-01 16:03:09] [INFO ] Deduced a trap composed of 136 places in 155 ms of which 2 ms to minimize.
[2024-06-01 16:03:09] [INFO ] Deduced a trap composed of 136 places in 169 ms of which 2 ms to minimize.
[2024-06-01 16:03:09] [INFO ] Deduced a trap composed of 136 places in 212 ms of which 4 ms to minimize.
[2024-06-01 16:03:09] [INFO ] Deduced a trap composed of 136 places in 192 ms of which 3 ms to minimize.
[2024-06-01 16:03:10] [INFO ] Deduced a trap composed of 136 places in 196 ms of which 4 ms to minimize.
[2024-06-01 16:03:10] [INFO ] Deduced a trap composed of 136 places in 195 ms of which 3 ms to minimize.
[2024-06-01 16:03:10] [INFO ] Deduced a trap composed of 136 places in 206 ms of which 4 ms to minimize.
[2024-06-01 16:03:10] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 4 ms to minimize.
[2024-06-01 16:03:10] [INFO ] Deduced a trap composed of 136 places in 179 ms of which 3 ms to minimize.
[2024-06-01 16:03:11] [INFO ] Deduced a trap composed of 136 places in 177 ms of which 4 ms to minimize.
[2024-06-01 16:03:11] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 4 ms to minimize.
[2024-06-01 16:03:11] [INFO ] Deduced a trap composed of 136 places in 189 ms of which 3 ms to minimize.
[2024-06-01 16:03:11] [INFO ] Deduced a trap composed of 136 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:03:11] [INFO ] Deduced a trap composed of 173 places in 188 ms of which 2 ms to minimize.
[2024-06-01 16:03:12] [INFO ] Deduced a trap composed of 136 places in 154 ms of which 3 ms to minimize.
[2024-06-01 16:03:12] [INFO ] Deduced a trap composed of 136 places in 145 ms of which 2 ms to minimize.
[2024-06-01 16:03:12] [INFO ] Deduced a trap composed of 136 places in 140 ms of which 3 ms to minimize.
[2024-06-01 16:03:12] [INFO ] Deduced a trap composed of 136 places in 169 ms of which 3 ms to minimize.
[2024-06-01 16:03:12] [INFO ] Deduced a trap composed of 136 places in 192 ms of which 3 ms to minimize.
[2024-06-01 16:03:12] [INFO ] Deduced a trap composed of 136 places in 183 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 20/124 constraints. Problems are: Problem set: 17 solved, 740 unsolved
[2024-06-01 16:03:13] [INFO ] Deduced a trap composed of 167 places in 215 ms of which 3 ms to minimize.
[2024-06-01 16:03:13] [INFO ] Deduced a trap composed of 179 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:03:13] [INFO ] Deduced a trap composed of 182 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:03:14] [INFO ] Deduced a trap composed of 167 places in 154 ms of which 3 ms to minimize.
[2024-06-01 16:03:14] [INFO ] Deduced a trap composed of 176 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:03:14] [INFO ] Deduced a trap composed of 170 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:03:14] [INFO ] Deduced a trap composed of 173 places in 195 ms of which 4 ms to minimize.
[2024-06-01 16:03:15] [INFO ] Deduced a trap composed of 136 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:03:15] [INFO ] Deduced a trap composed of 136 places in 191 ms of which 3 ms to minimize.
[2024-06-01 16:03:15] [INFO ] Deduced a trap composed of 136 places in 204 ms of which 3 ms to minimize.
[2024-06-01 16:03:15] [INFO ] Deduced a trap composed of 136 places in 214 ms of which 3 ms to minimize.
[2024-06-01 16:03:16] [INFO ] Deduced a trap composed of 136 places in 209 ms of which 4 ms to minimize.
[2024-06-01 16:03:16] [INFO ] Deduced a trap composed of 136 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:03:16] [INFO ] Deduced a trap composed of 136 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:03:16] [INFO ] Deduced a trap composed of 136 places in 181 ms of which 4 ms to minimize.
[2024-06-01 16:03:16] [INFO ] Deduced a trap composed of 136 places in 204 ms of which 3 ms to minimize.
[2024-06-01 16:03:17] [INFO ] Deduced a trap composed of 136 places in 194 ms of which 5 ms to minimize.
[2024-06-01 16:03:17] [INFO ] Deduced a trap composed of 136 places in 189 ms of which 3 ms to minimize.
[2024-06-01 16:03:17] [INFO ] Deduced a trap composed of 136 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:03:17] [INFO ] Deduced a trap composed of 136 places in 176 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 20/144 constraints. Problems are: Problem set: 17 solved, 740 unsolved
[2024-06-01 16:03:19] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 2 ms to minimize.
[2024-06-01 16:03:24] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 2/146 constraints. Problems are: Problem set: 17 solved, 740 unsolved
[2024-06-01 16:03:33] [INFO ] Deduced a trap composed of 228 places in 227 ms of which 4 ms to minimize.
[2024-06-01 16:03:33] [INFO ] Deduced a trap composed of 239 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:03:34] [INFO ] Deduced a trap composed of 234 places in 212 ms of which 4 ms to minimize.
[2024-06-01 16:03:34] [INFO ] Deduced a trap composed of 231 places in 201 ms of which 4 ms to minimize.
[2024-06-01 16:03:34] [INFO ] Deduced a trap composed of 231 places in 221 ms of which 3 ms to minimize.
[2024-06-01 16:03:34] [INFO ] Deduced a trap composed of 237 places in 200 ms of which 4 ms to minimize.
[2024-06-01 16:03:35] [INFO ] Deduced a trap composed of 233 places in 198 ms of which 4 ms to minimize.
[2024-06-01 16:03:35] [INFO ] Deduced a trap composed of 233 places in 200 ms of which 4 ms to minimize.
[2024-06-01 16:03:35] [INFO ] Deduced a trap composed of 233 places in 220 ms of which 4 ms to minimize.
[2024-06-01 16:03:35] [INFO ] Deduced a trap composed of 241 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:03:35] [INFO ] Deduced a trap composed of 231 places in 225 ms of which 4 ms to minimize.
[2024-06-01 16:03:36] [INFO ] Deduced a trap composed of 238 places in 219 ms of which 4 ms to minimize.
[2024-06-01 16:03:36] [INFO ] Deduced a trap composed of 234 places in 237 ms of which 6 ms to minimize.
[2024-06-01 16:03:36] [INFO ] Deduced a trap composed of 235 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:03:36] [INFO ] Deduced a trap composed of 234 places in 174 ms of which 3 ms to minimize.
[2024-06-01 16:03:37] [INFO ] Deduced a trap composed of 235 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:03:37] [INFO ] Deduced a trap composed of 236 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:03:37] [INFO ] Deduced a trap composed of 231 places in 212 ms of which 4 ms to minimize.
[2024-06-01 16:03:37] [INFO ] Deduced a trap composed of 204 places in 227 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/1289 variables, and 165 constraints, problems are : Problem set: 17 solved, 740 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/757 constraints, Known Traps: 73/73 constraints]
After SMT, in 61363ms problems are : Problem set: 17 solved, 740 unsolved
Search for dead transitions found 17 dead transitions in 61375ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 530/530 places, 746/763 transitions.
Applied a total of 0 rules in 47 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2024-06-01 16:03:38] [INFO ] Redundant transitions in 10 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64118 ms. Remains : 530/530 places, 746/763 transitions.
Successfully simplified 11 atomic propositions for a total of 15 simplifications.
[2024-06-01 16:03:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 16:03:38] [INFO ] Flatten gal took : 73 ms
FORMULA PolyORBNT-COL-S05J40-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:03:38] [INFO ] Flatten gal took : 67 ms
[2024-06-01 16:03:38] [INFO ] Input system was already deterministic with 857 transitions.
Support contains 491 out of 629 places (down from 534) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 857
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 856
Applied a total of 7 rules in 21 ms. Remains 623 /629 variables (removed 6) and now considering 856/857 (removed 1) transitions.
Running 850 sub problems to find dead transitions.
[2024-06-01 16:03:38] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
// Phase 1: matrix 852 rows 623 cols
[2024-06-01 16:03:38] [INFO ] Computed 97 invariants in 14 ms
[2024-06-01 16:03:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-06-01 16:04:11] [INFO ] Deduced a trap composed of 204 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:04:11] [INFO ] Deduced a trap composed of 14 places in 245 ms of which 5 ms to minimize.
[2024-06-01 16:04:12] [INFO ] Deduced a trap composed of 15 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:04:16] [INFO ] Deduced a trap composed of 24 places in 257 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 850 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 622/1475 variables, and 100 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 4/4 constraints]
After SMT, in 41170ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 41181ms
Finished structural reductions in LTL mode , in 1 iterations and 41205 ms. Remains : 623/629 places, 856/857 transitions.
[2024-06-01 16:04:19] [INFO ] Flatten gal took : 39 ms
[2024-06-01 16:04:19] [INFO ] Flatten gal took : 35 ms
[2024-06-01 16:04:19] [INFO ] Input system was already deterministic with 856 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 857
Applied a total of 5 rules in 9 ms. Remains 624 /629 variables (removed 5) and now considering 857/857 (removed 0) transitions.
Running 851 sub problems to find dead transitions.
[2024-06-01 16:04:20] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
// Phase 1: matrix 853 rows 624 cols
[2024-06-01 16:04:20] [INFO ] Computed 97 invariants in 21 ms
[2024-06-01 16:04:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 3 (OVERLAPS) 5/623 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 851 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 3.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.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 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 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.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 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.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 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 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 4.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 9.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 1.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 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1477 variables, and 96 constraints, problems are : Problem set: 0 solved, 851 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 851/851 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 851 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 851 unsolved
[2024-06-01 16:04:44] [INFO ] Deduced a trap composed of 99 places in 165 ms of which 3 ms to minimize.
[2024-06-01 16:04:44] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/618 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 4 (OVERLAPS) 5/623 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 851 unsolved
[2024-06-01 16:04:59] [INFO ] Deduced a trap composed of 266 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:04:59] [INFO ] Deduced a trap composed of 303 places in 201 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/1477 variables, and 100 constraints, problems are : Problem set: 0 solved, 851 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/851 constraints, Known Traps: 4/4 constraints]
After SMT, in 41173ms problems are : Problem set: 0 solved, 851 unsolved
Search for dead transitions found 0 dead transitions in 41180ms
Finished structural reductions in LTL mode , in 1 iterations and 41192 ms. Remains : 624/629 places, 857/857 transitions.
[2024-06-01 16:05:01] [INFO ] Flatten gal took : 29 ms
[2024-06-01 16:05:01] [INFO ] Flatten gal took : 30 ms
[2024-06-01 16:05:01] [INFO ] Input system was already deterministic with 857 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 857
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 856
Applied a total of 7 rules in 27 ms. Remains 623 /629 variables (removed 6) and now considering 856/857 (removed 1) transitions.
Running 850 sub problems to find dead transitions.
[2024-06-01 16:05:01] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
// Phase 1: matrix 852 rows 623 cols
[2024-06-01 16:05:01] [INFO ] Computed 97 invariants in 27 ms
[2024-06-01 16:05:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-06-01 16:05:34] [INFO ] Deduced a trap composed of 204 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:05:34] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 2 ms to minimize.
[2024-06-01 16:05:34] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 3 ms to minimize.
[2024-06-01 16:05:38] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 850 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 622/1475 variables, and 100 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 4/4 constraints]
After SMT, in 41411ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 41424ms
Finished structural reductions in LTL mode , in 1 iterations and 41454 ms. Remains : 623/629 places, 856/857 transitions.
[2024-06-01 16:05:42] [INFO ] Flatten gal took : 27 ms
[2024-06-01 16:05:42] [INFO ] Flatten gal took : 27 ms
[2024-06-01 16:05:42] [INFO ] Input system was already deterministic with 856 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 857
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 856
Applied a total of 7 rules in 16 ms. Remains 623 /629 variables (removed 6) and now considering 856/857 (removed 1) transitions.
Running 850 sub problems to find dead transitions.
[2024-06-01 16:05:42] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-06-01 16:05:42] [INFO ] Invariant cache hit.
[2024-06-01 16:05:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
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 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-06-01 16:06:07] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 3 ms to minimize.
[2024-06-01 16:06:08] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 4 (OVERLAPS) 5/622 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-06-01 16:06:24] [INFO ] Deduced a trap composed of 204 places in 251 ms of which 4 ms to minimize.
SMT process timed out in 41477ms, After SMT, problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 41485ms
Finished structural reductions in LTL mode , in 1 iterations and 41503 ms. Remains : 623/629 places, 856/857 transitions.
[2024-06-01 16:06:24] [INFO ] Flatten gal took : 37 ms
[2024-06-01 16:06:24] [INFO ] Flatten gal took : 38 ms
[2024-06-01 16:06:24] [INFO ] Input system was already deterministic with 856 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 812
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 579 transition count 812
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 90 place count 579 transition count 769
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 176 place count 536 transition count 769
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 535 transition count 768
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 535 transition count 768
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 182 place count 533 transition count 766
Applied a total of 182 rules in 80 ms. Remains 533 /629 variables (removed 96) and now considering 766/857 (removed 91) transitions.
Running 760 sub problems to find dead transitions.
[2024-06-01 16:06:24] [INFO ] Flow matrix only has 762 transitions (discarded 4 similar events)
// Phase 1: matrix 762 rows 533 cols
[2024-06-01 16:06:24] [INFO ] Computed 97 invariants in 12 ms
[2024-06-01 16:06:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 16:06:31] [INFO ] Deduced a trap composed of 139 places in 132 ms of which 3 ms to minimize.
[2024-06-01 16:06:31] [INFO ] Deduced a trap composed of 139 places in 180 ms of which 4 ms to minimize.
[2024-06-01 16:06:31] [INFO ] Deduced a trap composed of 184 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:06:31] [INFO ] Deduced a trap composed of 139 places in 129 ms of which 3 ms to minimize.
[2024-06-01 16:06:32] [INFO ] Deduced a trap composed of 139 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:06:32] [INFO ] Deduced a trap composed of 139 places in 156 ms of which 2 ms to minimize.
[2024-06-01 16:06:32] [INFO ] Deduced a trap composed of 139 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:06:32] [INFO ] Deduced a trap composed of 172 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:06:32] [INFO ] Deduced a trap composed of 157 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:06:33] [INFO ] Deduced a trap composed of 157 places in 150 ms of which 2 ms to minimize.
[2024-06-01 16:06:33] [INFO ] Deduced a trap composed of 139 places in 129 ms of which 2 ms to minimize.
[2024-06-01 16:06:33] [INFO ] Deduced a trap composed of 139 places in 189 ms of which 3 ms to minimize.
[2024-06-01 16:06:33] [INFO ] Deduced a trap composed of 139 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:06:33] [INFO ] Deduced a trap composed of 166 places in 189 ms of which 4 ms to minimize.
[2024-06-01 16:06:34] [INFO ] Deduced a trap composed of 139 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:06:34] [INFO ] Deduced a trap composed of 139 places in 162 ms of which 4 ms to minimize.
[2024-06-01 16:06:34] [INFO ] Deduced a trap composed of 163 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:06:34] [INFO ] Deduced a trap composed of 151 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:06:34] [INFO ] Deduced a trap composed of 139 places in 132 ms of which 3 ms to minimize.
[2024-06-01 16:06:38] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 16:06:39] [INFO ] Deduced a trap composed of 140 places in 193 ms of which 4 ms to minimize.
[2024-06-01 16:06:39] [INFO ] Deduced a trap composed of 139 places in 154 ms of which 3 ms to minimize.
[2024-06-01 16:06:39] [INFO ] Deduced a trap composed of 140 places in 180 ms of which 4 ms to minimize.
[2024-06-01 16:06:39] [INFO ] Deduced a trap composed of 140 places in 163 ms of which 3 ms to minimize.
[2024-06-01 16:06:40] [INFO ] Deduced a trap composed of 139 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:06:40] [INFO ] Deduced a trap composed of 140 places in 130 ms of which 2 ms to minimize.
[2024-06-01 16:06:40] [INFO ] Deduced a trap composed of 140 places in 132 ms of which 3 ms to minimize.
[2024-06-01 16:06:40] [INFO ] Deduced a trap composed of 140 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:06:40] [INFO ] Deduced a trap composed of 140 places in 138 ms of which 2 ms to minimize.
[2024-06-01 16:06:41] [INFO ] Deduced a trap composed of 139 places in 129 ms of which 2 ms to minimize.
[2024-06-01 16:06:41] [INFO ] Deduced a trap composed of 139 places in 130 ms of which 2 ms to minimize.
[2024-06-01 16:06:41] [INFO ] Deduced a trap composed of 139 places in 148 ms of which 3 ms to minimize.
[2024-06-01 16:06:41] [INFO ] Deduced a trap composed of 140 places in 180 ms of which 4 ms to minimize.
[2024-06-01 16:06:41] [INFO ] Deduced a trap composed of 140 places in 176 ms of which 3 ms to minimize.
[2024-06-01 16:06:41] [INFO ] Deduced a trap composed of 140 places in 157 ms of which 3 ms to minimize.
[2024-06-01 16:06:42] [INFO ] Deduced a trap composed of 140 places in 129 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1295 variables, and 128 constraints, problems are : Problem set: 0 solved, 760 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/533 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 760/760 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 36/128 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 16:06:47] [INFO ] Deduced a trap composed of 139 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:06:47] [INFO ] Deduced a trap composed of 139 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:06:47] [INFO ] Deduced a trap composed of 139 places in 188 ms of which 4 ms to minimize.
[2024-06-01 16:06:47] [INFO ] Deduced a trap composed of 139 places in 163 ms of which 3 ms to minimize.
[2024-06-01 16:06:48] [INFO ] Deduced a trap composed of 139 places in 137 ms of which 2 ms to minimize.
[2024-06-01 16:06:48] [INFO ] Deduced a trap composed of 139 places in 129 ms of which 3 ms to minimize.
[2024-06-01 16:06:48] [INFO ] Deduced a trap composed of 139 places in 132 ms of which 3 ms to minimize.
[2024-06-01 16:06:48] [INFO ] Deduced a trap composed of 139 places in 131 ms of which 3 ms to minimize.
[2024-06-01 16:06:48] [INFO ] Deduced a trap composed of 139 places in 152 ms of which 3 ms to minimize.
[2024-06-01 16:06:48] [INFO ] Deduced a trap composed of 139 places in 130 ms of which 3 ms to minimize.
[2024-06-01 16:06:49] [INFO ] Deduced a trap composed of 139 places in 130 ms of which 3 ms to minimize.
[2024-06-01 16:06:49] [INFO ] Deduced a trap composed of 139 places in 132 ms of which 3 ms to minimize.
[2024-06-01 16:06:49] [INFO ] Deduced a trap composed of 139 places in 129 ms of which 3 ms to minimize.
[2024-06-01 16:06:49] [INFO ] Deduced a trap composed of 139 places in 132 ms of which 3 ms to minimize.
[2024-06-01 16:06:49] [INFO ] Deduced a trap composed of 139 places in 134 ms of which 7 ms to minimize.
[2024-06-01 16:06:49] [INFO ] Deduced a trap composed of 139 places in 132 ms of which 3 ms to minimize.
[2024-06-01 16:06:49] [INFO ] Deduced a trap composed of 139 places in 134 ms of which 2 ms to minimize.
[2024-06-01 16:06:49] [INFO ] Deduced a trap composed of 139 places in 133 ms of which 2 ms to minimize.
[2024-06-01 16:06:50] [INFO ] Deduced a trap composed of 139 places in 129 ms of which 2 ms to minimize.
[2024-06-01 16:06:50] [INFO ] Deduced a trap composed of 142 places in 140 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 16:06:56] [INFO ] Deduced a trap composed of 136 places in 194 ms of which 4 ms to minimize.
[2024-06-01 16:06:56] [INFO ] Deduced a trap composed of 139 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:06:56] [INFO ] Deduced a trap composed of 130 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:06:56] [INFO ] Deduced a trap composed of 130 places in 167 ms of which 4 ms to minimize.
[2024-06-01 16:06:56] [INFO ] Deduced a trap composed of 124 places in 154 ms of which 3 ms to minimize.
[2024-06-01 16:06:56] [INFO ] Deduced a trap composed of 130 places in 131 ms of which 2 ms to minimize.
[2024-06-01 16:06:57] [INFO ] Deduced a trap composed of 120 places in 208 ms of which 3 ms to minimize.
[2024-06-01 16:06:57] [INFO ] Deduced a trap composed of 125 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:06:59] [INFO ] Deduced a trap composed of 210 places in 223 ms of which 4 ms to minimize.
[2024-06-01 16:06:59] [INFO ] Deduced a trap composed of 208 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:07:00] [INFO ] Deduced a trap composed of 198 places in 164 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 11/159 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 16:07:04] [INFO ] Deduced a trap composed of 212 places in 194 ms of which 4 ms to minimize.
[2024-06-01 16:07:04] [INFO ] Deduced a trap composed of 232 places in 140 ms of which 3 ms to minimize.
[2024-06-01 16:07:04] [INFO ] Deduced a trap composed of 234 places in 144 ms of which 3 ms to minimize.
[2024-06-01 16:07:04] [INFO ] Deduced a trap composed of 233 places in 154 ms of which 3 ms to minimize.
[2024-06-01 16:07:04] [INFO ] Deduced a trap composed of 201 places in 147 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1295 variables, and 164 constraints, problems are : Problem set: 0 solved, 760 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 86/90 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/533 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/760 constraints, Known Traps: 72/72 constraints]
After SMT, in 41282ms problems are : Problem set: 0 solved, 760 unsolved
Search for dead transitions found 0 dead transitions in 41292ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41374 ms. Remains : 533/629 places, 766/857 transitions.
[2024-06-01 16:07:05] [INFO ] Flatten gal took : 31 ms
[2024-06-01 16:07:06] [INFO ] Flatten gal took : 33 ms
[2024-06-01 16:07:06] [INFO ] Input system was already deterministic with 766 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 812
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 579 transition count 812
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 90 place count 579 transition count 768
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 178 place count 535 transition count 768
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 534 transition count 767
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 534 transition count 767
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 184 place count 532 transition count 765
Applied a total of 184 rules in 51 ms. Remains 532 /629 variables (removed 97) and now considering 765/857 (removed 92) transitions.
Running 759 sub problems to find dead transitions.
[2024-06-01 16:07:06] [INFO ] Flow matrix only has 761 transitions (discarded 4 similar events)
// Phase 1: matrix 761 rows 532 cols
[2024-06-01 16:07:06] [INFO ] Computed 97 invariants in 10 ms
[2024-06-01 16:07:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 3 (OVERLAPS) 4/531 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD319 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/532 variables, 1/97 constraints. Problems are: Problem set: 17 solved, 742 unsolved
[2024-06-01 16:07:27] [INFO ] Deduced a trap composed of 95 places in 224 ms of which 4 ms to minimize.
SMT process timed out in 21579ms, After SMT, problems are : Problem set: 17 solved, 742 unsolved
Search for dead transitions found 17 dead transitions in 21587ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 17 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 532/629 places, 748/857 transitions.
Applied a total of 0 rules in 21 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21662 ms. Remains : 532/629 places, 748/857 transitions.
[2024-06-01 16:07:27] [INFO ] Flatten gal took : 31 ms
[2024-06-01 16:07:27] [INFO ] Flatten gal took : 33 ms
[2024-06-01 16:07:27] [INFO ] Input system was already deterministic with 748 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 857
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 856
Applied a total of 7 rules in 11 ms. Remains 623 /629 variables (removed 6) and now considering 856/857 (removed 1) transitions.
Running 850 sub problems to find dead transitions.
[2024-06-01 16:07:27] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
// Phase 1: matrix 852 rows 623 cols
[2024-06-01 16:07:27] [INFO ] Computed 97 invariants in 22 ms
[2024-06-01 16:07:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-06-01 16:08:00] [INFO ] Deduced a trap composed of 204 places in 307 ms of which 11 ms to minimize.
[2024-06-01 16:08:00] [INFO ] Deduced a trap composed of 14 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:08:01] [INFO ] Deduced a trap composed of 15 places in 293 ms of which 5 ms to minimize.
[2024-06-01 16:08:04] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 2)
(s1 0)
(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 1)
(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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1475 variables, and 100 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 4/4 constraints]
After SMT, in 41292ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 41302ms
Finished structural reductions in LTL mode , in 1 iterations and 41316 ms. Remains : 623/629 places, 856/857 transitions.
[2024-06-01 16:08:09] [INFO ] Flatten gal took : 23 ms
[2024-06-01 16:08:09] [INFO ] Flatten gal took : 25 ms
[2024-06-01 16:08:09] [INFO ] Input system was already deterministic with 856 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 857
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 856
Applied a total of 7 rules in 14 ms. Remains 623 /629 variables (removed 6) and now considering 856/857 (removed 1) transitions.
Running 850 sub problems to find dead transitions.
[2024-06-01 16:08:09] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-06-01 16:08:09] [INFO ] Invariant cache hit.
[2024-06-01 16:08:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-06-01 16:08:34] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 2 ms to minimize.
[2024-06-01 16:08:34] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 4 (OVERLAPS) 5/622 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-06-01 16:08:49] [INFO ] Deduced a trap composed of 204 places in 237 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1475 variables, and 99 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 3/3 constraints]
After SMT, in 41160ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 41168ms
Finished structural reductions in LTL mode , in 1 iterations and 41183 ms. Remains : 623/629 places, 856/857 transitions.
[2024-06-01 16:08:50] [INFO ] Flatten gal took : 23 ms
[2024-06-01 16:08:50] [INFO ] Flatten gal took : 25 ms
[2024-06-01 16:08:50] [INFO ] Input system was already deterministic with 856 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 624 transition count 855
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 622 transition count 853
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 620 transition count 853
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 620 transition count 850
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 617 transition count 850
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 616 transition count 849
Applied a total of 16 rules in 43 ms. Remains 616 /629 variables (removed 13) and now considering 849/857 (removed 8) transitions.
Running 843 sub problems to find dead transitions.
[2024-06-01 16:08:50] [INFO ] Flow matrix only has 845 transitions (discarded 4 similar events)
// Phase 1: matrix 845 rows 616 cols
[2024-06-01 16:08:50] [INFO ] Computed 97 invariants in 20 ms
[2024-06-01 16:08:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 843 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/611 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 843 unsolved
[2024-06-01 16:08:58] [INFO ] Deduced a trap composed of 233 places in 202 ms of which 3 ms to minimize.
[2024-06-01 16:08:58] [INFO ] Deduced a trap composed of 221 places in 153 ms of which 3 ms to minimize.
[2024-06-01 16:08:59] [INFO ] Deduced a trap composed of 221 places in 154 ms of which 3 ms to minimize.
[2024-06-01 16:08:59] [INFO ] Deduced a trap composed of 221 places in 148 ms of which 2 ms to minimize.
[2024-06-01 16:08:59] [INFO ] Deduced a trap composed of 221 places in 149 ms of which 3 ms to minimize.
[2024-06-01 16:08:59] [INFO ] Deduced a trap composed of 242 places in 157 ms of which 2 ms to minimize.
[2024-06-01 16:08:59] [INFO ] Deduced a trap composed of 245 places in 246 ms of which 5 ms to minimize.
[2024-06-01 16:09:00] [INFO ] Deduced a trap composed of 221 places in 223 ms of which 4 ms to minimize.
[2024-06-01 16:09:00] [INFO ] Deduced a trap composed of 221 places in 212 ms of which 4 ms to minimize.
[2024-06-01 16:09:00] [INFO ] Deduced a trap composed of 221 places in 252 ms of which 4 ms to minimize.
[2024-06-01 16:09:00] [INFO ] Deduced a trap composed of 221 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:09:01] [INFO ] Deduced a trap composed of 221 places in 189 ms of which 4 ms to minimize.
[2024-06-01 16:09:01] [INFO ] Deduced a trap composed of 243 places in 172 ms of which 3 ms to minimize.
[2024-06-01 16:09:01] [INFO ] Deduced a trap composed of 222 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:09:01] [INFO ] Deduced a trap composed of 222 places in 216 ms of which 3 ms to minimize.
[2024-06-01 16:09:01] [INFO ] Deduced a trap composed of 222 places in 220 ms of which 3 ms to minimize.
[2024-06-01 16:09:02] [INFO ] Deduced a trap composed of 221 places in 201 ms of which 4 ms to minimize.
[2024-06-01 16:09:02] [INFO ] Deduced a trap composed of 221 places in 202 ms of which 3 ms to minimize.
[2024-06-01 16:09:02] [INFO ] Deduced a trap composed of 221 places in 204 ms of which 3 ms to minimize.
[2024-06-01 16:09:02] [INFO ] Deduced a trap composed of 221 places in 192 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/611 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 843 unsolved
[2024-06-01 16:09:07] [INFO ] Deduced a trap composed of 16 places in 281 ms of which 4 ms to minimize.
[2024-06-01 16:09:10] [INFO ] Deduced a trap composed of 258 places in 240 ms of which 4 ms to minimize.
[2024-06-01 16:09:10] [INFO ] Deduced a trap composed of 276 places in 197 ms of which 4 ms to minimize.
[2024-06-01 16:09:10] [INFO ] Deduced a trap composed of 252 places in 185 ms of which 4 ms to minimize.
[2024-06-01 16:09:10] [INFO ] Deduced a trap composed of 267 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:09:11] [INFO ] Deduced a trap composed of 299 places in 195 ms of which 3 ms to minimize.
[2024-06-01 16:09:11] [INFO ] Deduced a trap composed of 322 places in 269 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/611 variables, 7/119 constraints. Problems are: Problem set: 0 solved, 843 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 611/1461 variables, and 119 constraints, problems are : Problem set: 0 solved, 843 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 87/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/616 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 843/843 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 843 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 843 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/611 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 843 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/611 variables, 27/119 constraints. Problems are: Problem set: 0 solved, 843 unsolved
[2024-06-01 16:09:14] [INFO ] Deduced a trap composed of 249 places in 217 ms of which 4 ms to minimize.
[2024-06-01 16:09:14] [INFO ] Deduced a trap composed of 221 places in 219 ms of which 4 ms to minimize.
[2024-06-01 16:09:15] [INFO ] Deduced a trap composed of 222 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:09:15] [INFO ] Deduced a trap composed of 222 places in 209 ms of which 4 ms to minimize.
[2024-06-01 16:09:15] [INFO ] Deduced a trap composed of 222 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:09:15] [INFO ] Deduced a trap composed of 222 places in 225 ms of which 4 ms to minimize.
[2024-06-01 16:09:16] [INFO ] Deduced a trap composed of 221 places in 212 ms of which 4 ms to minimize.
[2024-06-01 16:09:16] [INFO ] Deduced a trap composed of 221 places in 183 ms of which 3 ms to minimize.
[2024-06-01 16:09:16] [INFO ] Deduced a trap composed of 221 places in 152 ms of which 3 ms to minimize.
[2024-06-01 16:09:16] [INFO ] Deduced a trap composed of 222 places in 178 ms of which 2 ms to minimize.
[2024-06-01 16:09:17] [INFO ] Deduced a trap composed of 221 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:09:17] [INFO ] Deduced a trap composed of 225 places in 178 ms of which 4 ms to minimize.
[2024-06-01 16:09:17] [INFO ] Deduced a trap composed of 221 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:09:17] [INFO ] Deduced a trap composed of 226 places in 176 ms of which 3 ms to minimize.
[2024-06-01 16:09:17] [INFO ] Deduced a trap composed of 222 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:09:18] [INFO ] Deduced a trap composed of 221 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:09:18] [INFO ] Deduced a trap composed of 225 places in 178 ms of which 3 ms to minimize.
[2024-06-01 16:09:18] [INFO ] Deduced a trap composed of 221 places in 180 ms of which 3 ms to minimize.
[2024-06-01 16:09:18] [INFO ] Deduced a trap composed of 221 places in 179 ms of which 4 ms to minimize.
[2024-06-01 16:09:18] [INFO ] Deduced a trap composed of 221 places in 178 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/611 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 843 unsolved
[2024-06-01 16:09:20] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 2 ms to minimize.
[2024-06-01 16:09:21] [INFO ] Deduced a trap composed of 316 places in 226 ms of which 4 ms to minimize.
[2024-06-01 16:09:21] [INFO ] Deduced a trap composed of 221 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:09:21] [INFO ] Deduced a trap composed of 221 places in 173 ms of which 3 ms to minimize.
[2024-06-01 16:09:22] [INFO ] Deduced a trap composed of 221 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:09:22] [INFO ] Deduced a trap composed of 225 places in 179 ms of which 3 ms to minimize.
[2024-06-01 16:09:22] [INFO ] Deduced a trap composed of 221 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:09:22] [INFO ] Deduced a trap composed of 221 places in 196 ms of which 3 ms to minimize.
[2024-06-01 16:09:22] [INFO ] Deduced a trap composed of 221 places in 198 ms of which 4 ms to minimize.
[2024-06-01 16:09:23] [INFO ] Deduced a trap composed of 225 places in 159 ms of which 3 ms to minimize.
[2024-06-01 16:09:23] [INFO ] Deduced a trap composed of 221 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:09:23] [INFO ] Deduced a trap composed of 225 places in 179 ms of which 3 ms to minimize.
[2024-06-01 16:09:23] [INFO ] Deduced a trap composed of 221 places in 182 ms of which 3 ms to minimize.
[2024-06-01 16:09:23] [INFO ] Deduced a trap composed of 245 places in 195 ms of which 3 ms to minimize.
[2024-06-01 16:09:24] [INFO ] Deduced a trap composed of 225 places in 168 ms of which 3 ms to minimize.
[2024-06-01 16:09:24] [INFO ] Deduced a trap composed of 221 places in 153 ms of which 3 ms to minimize.
[2024-06-01 16:09:24] [INFO ] Deduced a trap composed of 225 places in 155 ms of which 2 ms to minimize.
[2024-06-01 16:09:24] [INFO ] Deduced a trap composed of 221 places in 153 ms of which 3 ms to minimize.
[2024-06-01 16:09:24] [INFO ] Deduced a trap composed of 221 places in 155 ms of which 3 ms to minimize.
[2024-06-01 16:09:24] [INFO ] Deduced a trap composed of 221 places in 153 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/611 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 843 unsolved
[2024-06-01 16:09:28] [INFO ] Deduced a trap composed of 225 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:09:28] [INFO ] Deduced a trap composed of 221 places in 227 ms of which 4 ms to minimize.
[2024-06-01 16:09:28] [INFO ] Deduced a trap composed of 221 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:09:28] [INFO ] Deduced a trap composed of 221 places in 204 ms of which 3 ms to minimize.
[2024-06-01 16:09:28] [INFO ] Deduced a trap composed of 221 places in 156 ms of which 2 ms to minimize.
[2024-06-01 16:09:29] [INFO ] Deduced a trap composed of 221 places in 159 ms of which 2 ms to minimize.
[2024-06-01 16:09:29] [INFO ] Deduced a trap composed of 225 places in 155 ms of which 3 ms to minimize.
[2024-06-01 16:09:29] [INFO ] Deduced a trap composed of 221 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:09:29] [INFO ] Deduced a trap composed of 221 places in 166 ms of which 2 ms to minimize.
[2024-06-01 16:09:29] [INFO ] Deduced a trap composed of 221 places in 161 ms of which 3 ms to minimize.
[2024-06-01 16:09:29] [INFO ] Deduced a trap composed of 226 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:09:30] [INFO ] Deduced a trap composed of 222 places in 156 ms of which 3 ms to minimize.
[2024-06-01 16:09:30] [INFO ] Deduced a trap composed of 222 places in 165 ms of which 3 ms to minimize.
[2024-06-01 16:09:30] [INFO ] Deduced a trap composed of 221 places in 160 ms of which 2 ms to minimize.
[2024-06-01 16:09:30] [INFO ] Deduced a trap composed of 225 places in 202 ms of which 3 ms to minimize.
[2024-06-01 16:09:30] [INFO ] Deduced a trap composed of 225 places in 164 ms of which 3 ms to minimize.
[2024-06-01 16:09:31] [INFO ] Deduced a trap composed of 221 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:09:31] [INFO ] Deduced a trap composed of 221 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:09:31] [INFO ] Deduced a trap composed of 221 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:09:31] [INFO ] Deduced a trap composed of 221 places in 161 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/611 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 843 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 611/1461 variables, and 179 constraints, problems are : Problem set: 0 solved, 843 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 87/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/616 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/843 constraints, Known Traps: 87/87 constraints]
After SMT, in 41243ms problems are : Problem set: 0 solved, 843 unsolved
Search for dead transitions found 0 dead transitions in 41251ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41296 ms. Remains : 616/629 places, 849/857 transitions.
[2024-06-01 16:09:31] [INFO ] Flatten gal took : 25 ms
[2024-06-01 16:09:31] [INFO ] Flatten gal took : 26 ms
[2024-06-01 16:09:31] [INFO ] Input system was already deterministic with 849 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 857
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 856
Applied a total of 7 rules in 35 ms. Remains 623 /629 variables (removed 6) and now considering 856/857 (removed 1) transitions.
Running 850 sub problems to find dead transitions.
[2024-06-01 16:09:32] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
// Phase 1: matrix 852 rows 623 cols
[2024-06-01 16:09:32] [INFO ] Computed 97 invariants in 28 ms
[2024-06-01 16:09:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-06-01 16:10:05] [INFO ] Deduced a trap composed of 204 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:10:05] [INFO ] Deduced a trap composed of 14 places in 304 ms of which 4 ms to minimize.
[2024-06-01 16:10:05] [INFO ] Deduced a trap composed of 15 places in 284 ms of which 4 ms to minimize.
[2024-06-01 16:10:09] [INFO ] Deduced a trap composed of 24 places in 273 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1475 variables, and 100 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 4/4 constraints]
After SMT, in 41250ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 41258ms
Finished structural reductions in LTL mode , in 1 iterations and 41294 ms. Remains : 623/629 places, 856/857 transitions.
[2024-06-01 16:10:13] [INFO ] Flatten gal took : 23 ms
[2024-06-01 16:10:13] [INFO ] Flatten gal took : 24 ms
[2024-06-01 16:10:13] [INFO ] Input system was already deterministic with 856 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 857
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 856
Applied a total of 7 rules in 16 ms. Remains 623 /629 variables (removed 6) and now considering 856/857 (removed 1) transitions.
Running 850 sub problems to find dead transitions.
[2024-06-01 16:10:13] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-06-01 16:10:13] [INFO ] Invariant cache hit.
[2024-06-01 16:10:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 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 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 (/ 2.0 3.0))
(s125 0.0)
(s126 0.0)
(s127 1.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 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 (/ 1.0 3.0))
(s169 (/ 1.0 3.0))
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 (/ 2.0 3.0))
(s211 1.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 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 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 4.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 9.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 0.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 0.0)
(s355 0.0)
(s356 0.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 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.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 1.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 0.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 1.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 1.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 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 0.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 0.0)
(s523 0.0)
(s524 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 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-06-01 16:10:38] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:10:38] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 4 (OVERLAPS) 5/622 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-06-01 16:10:52] [INFO ] Deduced a trap composed of 204 places in 194 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1475 variables, and 99 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/850 constraints, Known Traps: 3/3 constraints]
After SMT, in 41210ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 41217ms
Finished structural reductions in LTL mode , in 1 iterations and 41235 ms. Remains : 623/629 places, 856/857 transitions.
[2024-06-01 16:10:54] [INFO ] Flatten gal took : 22 ms
[2024-06-01 16:10:54] [INFO ] Flatten gal took : 23 ms
[2024-06-01 16:10:54] [INFO ] Input system was already deterministic with 856 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 857
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 856
Applied a total of 7 rules in 16 ms. Remains 623 /629 variables (removed 6) and now considering 856/857 (removed 1) transitions.
Running 850 sub problems to find dead transitions.
[2024-06-01 16:10:54] [INFO ] Flow matrix only has 852 transitions (discarded 4 similar events)
[2024-06-01 16:10:54] [INFO ] Invariant cache hit.
[2024-06-01 16:10:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 5/622 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1475 variables, and 96 constraints, problems are : Problem set: 0 solved, 850 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-06-01 16:11:20] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 3 ms to minimize.
[2024-06-01 16:11:20] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 4 (OVERLAPS) 5/622 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 850 unsolved
[2024-06-01 16:11:35] [INFO ] Deduced a trap composed of 204 places in 200 ms of which 3 ms to minimize.
SMT process timed out in 41183ms, After SMT, problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 41191ms
Finished structural reductions in LTL mode , in 1 iterations and 41209 ms. Remains : 623/629 places, 856/857 transitions.
[2024-06-01 16:11:35] [INFO ] Flatten gal took : 25 ms
[2024-06-01 16:11:36] [INFO ] Flatten gal took : 26 ms
[2024-06-01 16:11:36] [INFO ] Input system was already deterministic with 856 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 857
Applied a total of 5 rules in 8 ms. Remains 624 /629 variables (removed 5) and now considering 857/857 (removed 0) transitions.
Running 851 sub problems to find dead transitions.
[2024-06-01 16:11:36] [INFO ] Flow matrix only has 853 transitions (discarded 4 similar events)
// Phase 1: matrix 853 rows 624 cols
[2024-06-01 16:11:36] [INFO ] Computed 97 invariants in 19 ms
[2024-06-01 16:11:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 3 (OVERLAPS) 5/623 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 851 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1477 variables, and 96 constraints, problems are : Problem set: 0 solved, 851 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 851/851 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 851 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 851 unsolved
[2024-06-01 16:12:01] [INFO ] Deduced a trap composed of 99 places in 153 ms of which 2 ms to minimize.
[2024-06-01 16:12:01] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/618 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 851 unsolved
At refinement iteration 4 (OVERLAPS) 5/623 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 851 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/1477 variables, and 98 constraints, problems are : Problem set: 0 solved, 851 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/851 constraints, Known Traps: 2/2 constraints]
After SMT, in 41319ms problems are : Problem set: 0 solved, 851 unsolved
Search for dead transitions found 0 dead transitions in 41327ms
Finished structural reductions in LTL mode , in 1 iterations and 41337 ms. Remains : 624/629 places, 857/857 transitions.
[2024-06-01 16:12:17] [INFO ] Flatten gal took : 22 ms
[2024-06-01 16:12:17] [INFO ] Flatten gal took : 24 ms
[2024-06-01 16:12:17] [INFO ] Input system was already deterministic with 857 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 857/857 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 624 transition count 813
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 89 place count 580 transition count 812
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 579 transition count 812
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 90 place count 579 transition count 768
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 178 place count 535 transition count 768
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 179 place count 534 transition count 767
Iterating global reduction 3 with 1 rules applied. Total rules applied 180 place count 534 transition count 767
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 533 transition count 766
Applied a total of 182 rules in 59 ms. Remains 533 /629 variables (removed 96) and now considering 766/857 (removed 91) transitions.
Running 760 sub problems to find dead transitions.
[2024-06-01 16:12:17] [INFO ] Flow matrix only has 762 transitions (discarded 4 similar events)
// Phase 1: matrix 762 rows 533 cols
[2024-06-01 16:12:17] [INFO ] Computed 97 invariants in 18 ms
[2024-06-01 16:12:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 3 (OVERLAPS) 4/531 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 760 unsolved
Problem TDEAD509 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD549 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/533 variables, 2/97 constraints. Problems are: Problem set: 17 solved, 743 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 533/1295 variables, and 97 constraints, problems are : Problem set: 17 solved, 743 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/533 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 760/760 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 743 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 86/86 constraints. Problems are: Problem set: 17 solved, 743 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 5/91 constraints. Problems are: Problem set: 17 solved, 743 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 0/91 constraints. Problems are: Problem set: 17 solved, 743 unsolved
At refinement iteration 3 (OVERLAPS) 4/531 variables, 4/95 constraints. Problems are: Problem set: 17 solved, 743 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 0/95 constraints. Problems are: Problem set: 17 solved, 743 unsolved
At refinement iteration 5 (OVERLAPS) 2/533 variables, 2/97 constraints. Problems are: Problem set: 17 solved, 743 unsolved
[2024-06-01 16:12:53] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 2 ms to minimize.
[2024-06-01 16:12:56] [INFO ] Deduced a trap composed of 178 places in 168 ms of which 2 ms to minimize.
[2024-06-01 16:12:59] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 2 ms to minimize.
SMT process timed out in 41426ms, After SMT, problems are : Problem set: 17 solved, 743 unsolved
Search for dead transitions found 17 dead transitions in 41436ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 17 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 533/629 places, 749/857 transitions.
Applied a total of 0 rules in 39 ms. Remains 533 /533 variables (removed 0) and now considering 749/749 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41537 ms. Remains : 533/629 places, 749/857 transitions.
[2024-06-01 16:12:59] [INFO ] Flatten gal took : 42 ms
[2024-06-01 16:12:59] [INFO ] Flatten gal took : 38 ms
[2024-06-01 16:12:59] [INFO ] Input system was already deterministic with 749 transitions.
[2024-06-01 16:12:59] [INFO ] Flatten gal took : 46 ms
[2024-06-01 16:12:59] [INFO ] Flatten gal took : 46 ms
[2024-06-01 16:12:59] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 18 ms.
[2024-06-01 16:12:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 629 places, 857 transitions and 4329 arcs took 8 ms.
Total runtime 725000 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 : PolyORBNT-COL-S05J40-CTLFireability-2024-00
Could not compute solution for formula : PolyORBNT-COL-S05J40-CTLFireability-2024-01
Could not compute solution for formula : PolyORBNT-COL-S05J40-CTLFireability-2024-02
Could not compute solution for formula : PolyORBNT-COL-S05J40-CTLFireability-2024-03
Could not compute solution for formula : PolyORBNT-COL-S05J40-CTLFireability-2024-04
Could not compute solution for formula : PolyORBNT-COL-S05J40-CTLFireability-2024-07
Could not compute solution for formula : PolyORBNT-COL-S05J40-CTLFireability-2024-08
Could not compute solution for formula : PolyORBNT-COL-S05J40-CTLFireability-2024-09
Could not compute solution for formula : PolyORBNT-COL-S05J40-CTLFireability-2024-10
Could not compute solution for formula : PolyORBNT-COL-S05J40-CTLFireability-2024-11
Could not compute solution for formula : PolyORBNT-COL-S05J40-CTLFireability-2024-12
Could not compute solution for formula : PolyORBNT-COL-S05J40-CTLFireability-2024-13
Could not compute solution for formula : PolyORBNT-COL-S05J40-CTLFireability-2024-14
Could not compute solution for formula : PolyORBNT-COL-S05J40-CTLFireability-2024-15

BK_STOP 1717258379899

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

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