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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.9K Apr 12 11:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 11:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 11:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 11:08 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.5K 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 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 13:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 13:20 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-S10J30-CTLFireability-2024-00
FORMULA_NAME PolyORBNT-COL-S10J30-CTLFireability-2024-01
FORMULA_NAME PolyORBNT-COL-S10J30-CTLFireability-2024-02
FORMULA_NAME PolyORBNT-COL-S10J30-CTLFireability-2024-03
FORMULA_NAME PolyORBNT-COL-S10J30-CTLFireability-2024-04
FORMULA_NAME PolyORBNT-COL-S10J30-CTLFireability-2024-05
FORMULA_NAME PolyORBNT-COL-S10J30-CTLFireability-2024-06
FORMULA_NAME PolyORBNT-COL-S10J30-CTLFireability-2024-07
FORMULA_NAME PolyORBNT-COL-S10J30-CTLFireability-2024-08
FORMULA_NAME PolyORBNT-COL-S10J30-CTLFireability-2024-09
FORMULA_NAME PolyORBNT-COL-S10J30-CTLFireability-2024-10
FORMULA_NAME PolyORBNT-COL-S10J30-CTLFireability-2024-11
FORMULA_NAME PolyORBNT-COL-S10J30-CTLFireability-2024-12
FORMULA_NAME PolyORBNT-COL-S10J30-CTLFireability-2024-13
FORMULA_NAME PolyORBNT-COL-S10J30-CTLFireability-2024-14
FORMULA_NAME PolyORBNT-COL-S10J30-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717258956614

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-S10J30
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:22:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:22:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:22:38] [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:22:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 16:22:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 650 ms
[2024-06-01 16:22:38] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
[2024-06-01 16:22:38] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2024-06-01 16:22:38] [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 8 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 31 to 30
RANDOM walk for 40010 steps (2278 resets) in 1451 ms. (27 steps per ms) remains 12/30 properties
BEST_FIRST walk for 40000 steps (498 resets) in 418 ms. (95 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40001 steps (758 resets) in 164 ms. (242 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (449 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (803 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (806 resets) in 108 ms. (366 steps per ms) remains 3/3 properties
// Phase 1: matrix 38 rows 48 cols
[2024-06-01 16:22:39] [INFO ] Computed 13 invariants in 5 ms
[2024-06-01 16:22:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 1 (OVERLAPS) 12/20 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/40 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/43 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 9 (OVERLAPS) 5/48 variables, 5/13 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-01 16:22:40] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 9 ms to minimize.
[2024-06-01 16:22:40] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 2/15 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 38/86 variables, 48/63 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/86 variables, 1/64 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/86 variables, 0/64 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/86 variables, 0/64 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 64 constraints, problems are : Problem set: 2 solved, 1 unsolved in 336 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: 3/3 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/12 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/34 variables, 2/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/41 variables, 4/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/42 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/47 variables, 5/13 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 2/15 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-01 16:22:40] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 16:22:40] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/47 variables, 2/17 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/47 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 38/85 variables, 47/64 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/85 variables, 1/65 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/85 variables, 0/65 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/86 variables, 1/66 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/86 variables, 1/67 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/86 variables, 0/67 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/86 variables, 0/67 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 67 constraints, problems are : Problem set: 2 solved, 1 unsolved in 159 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/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 533ms problems are : Problem set: 2 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 26 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:22:40] [INFO ] Computed 12 invariants in 2 ms
[2024-06-01 16:22:40] [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 313 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:22:40] [INFO ] Deduced a trap composed of 8 places in 25 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:22:40] [INFO ] Deduced a trap composed of 7 places in 24 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 565 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 899ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 899ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 940 ms. Remains : 34/48 places, 28/38 transitions.
RANDOM walk for 40022 steps (2953 resets) in 298 ms. (133 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1194 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Probably explored full state space saw : 521 states, properties seen :0
Probabilistic random walk after 1393 steps, saw 521 distinct states, run finished after 11 ms. (steps per millisecond=126 ) properties seen :0
Explored full state space saw : 521 states, properties seen :0
Exhaustive walk after 1393 steps, saw 521 distinct states, run finished after 3 ms. (steps per millisecond=464 ) properties seen :0
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
FORMULA PolyORBNT-COL-S10J30-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:22:41] [INFO ] Flatten gal took : 22 ms
[2024-06-01 16:22:41] [INFO ] Flatten gal took : 6 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:22:41] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 240 ms.
[2024-06-01 16:22:41] [INFO ] Unfolded 15 HLPN properties in 7 ms.
[2024-06-01 16:22:41] [INFO ] Reduced 780 identical enabling conditions.
[2024-06-01 16:22:41] [INFO ] Reduced 9285 identical enabling conditions.
[2024-06-01 16:22:41] [INFO ] Reduced 9285 identical enabling conditions.
[2024-06-01 16:22:41] [INFO ] Reduced 9285 identical enabling conditions.
[2024-06-01 16:22:41] [INFO ] Reduced 45 identical enabling conditions.
[2024-06-01 16:22:41] [INFO ] Reduced 9285 identical enabling conditions.
[2024-06-01 16:22:41] [INFO ] Reduced 9285 identical enabling conditions.
[2024-06-01 16:22:41] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 30 places in 21 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 664 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Applied a total of 0 rules in 39 ms. Remains 664 /664 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
Running 1929 sub problems to find dead transitions.
[2024-06-01 16:22:41] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2024-06-01 16:22:42] [INFO ] Computed 92 invariants in 102 ms
[2024-06-01 16:22:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/2595 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 66/85 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/664 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/2595 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 66/85 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/664 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 0/0 constraints]
After SMT, in 61071ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 61102ms
[2024-06-01 16:23:42] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-06-01 16:23:42] [INFO ] Invariant cache hit.
[2024-06-01 16:23:43] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-01 16:23:43] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-06-01 16:23:43] [INFO ] Invariant cache hit.
[2024-06-01 16:23:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:23:43] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-06-01 16:23:43] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-06-01 16:23:43] [INFO ] Invariant cache hit.
[2024-06-01 16:23:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/2595 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 66/85 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/664 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/643 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
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 TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 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 TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 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 TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 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 TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1216 is UNSAT
At refinement iteration 3 (OVERLAPS) 19/662 variables, 19/90 constraints. Problems are: Problem set: 558 solved, 1371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/2595 variables, and 90 constraints, problems are : Problem set: 558 solved, 1371 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/664 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 0/0 constraints]
After SMT, in 79098ms problems are : Problem set: 558 solved, 1371 unsolved
Search for dead transitions found 558 dead transitions in 79116ms
Found 558 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 558 transitions
Dead transitions reduction (with SMT) removed 558 transitions
Starting structural reductions in LTL mode, iteration 1 : 664/664 places, 1382/1940 transitions.
Applied a total of 0 rules in 11 ms. Remains 664 /664 variables (removed 0) and now considering 1382/1382 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 141047 ms. Remains : 664/664 places, 1382/1940 transitions.
Support contains 664 out of 664 places after structural reductions.
[2024-06-01 16:25:03] [INFO ] Flatten gal took : 236 ms
[2024-06-01 16:25:04] [INFO ] Flatten gal took : 236 ms
[2024-06-01 16:25:06] [INFO ] Input system was already deterministic with 1382 transitions.
Reduction of identical properties reduced properties to check from 56 to 54
RANDOM walk for 40000 steps (2241 resets) in 11859 ms. (3 steps per ms) remains 41/54 properties
BEST_FIRST walk for 4003 steps (40 resets) in 188 ms. (21 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 309 ms. (12 steps per ms) remains 24/41 properties
BEST_FIRST walk for 4004 steps (40 resets) in 179 ms. (22 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 516 ms. (7 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4003 steps (40 resets) in 142 ms. (27 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (39 resets) in 100 ms. (39 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (40 resets) in 66 ms. (59 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (40 resets) in 56 ms. (70 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (40 resets) in 63 ms. (62 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (40 resets) in 116 ms. (34 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (40 resets) in 55 ms. (71 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (41 resets) in 147 ms. (27 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (40 resets) in 67 ms. (58 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (40 resets) in 49 ms. (80 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (40 resets) in 49 ms. (80 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (40 resets) in 45 ms. (87 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (40 resets) in 45 ms. (87 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (12 resets) in 123 ms. (32 steps per ms) remains 14/23 properties
BEST_FIRST walk for 4003 steps (40 resets) in 38 ms. (102 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (37 resets) in 43 ms. (90 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (40 resets) in 47 ms. (83 steps per ms) remains 14/14 properties
[2024-06-01 16:25:10] [INFO ] Flow matrix only has 1373 transitions (discarded 9 similar events)
// Phase 1: matrix 1373 rows 664 cols
[2024-06-01 16:25:10] [INFO ] Computed 92 invariants in 47 ms
[2024-06-01 16:25:10] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/545 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/545 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/545 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp41 is UNSAT
At refinement iteration 3 (OVERLAPS) 117/662 variables, 84/86 constraints. Problems are: Problem set: 2 solved, 12 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/662 variables, 3/89 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/662 variables, 0/89 constraints. Problems are: Problem set: 6 solved, 8 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 6 (OVERLAPS) 2/664 variables, 3/92 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/664 variables, 0/92 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1373/2037 variables, 664/756 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2037 variables, 1/757 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2037 variables, 0/757 constraints. Problems are: Problem set: 7 solved, 7 unsolved
[2024-06-01 16:25:15] [INFO ] Deduced a trap composed of 309 places in 614 ms of which 7 ms to minimize.
[2024-06-01 16:25:16] [INFO ] Deduced a trap composed of 321 places in 777 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2037/2037 variables, and 759 constraints, problems are : Problem set: 7 solved, 7 unsolved in 5033 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 664/664 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/13 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 7 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 542/624 variables, 52/52 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 1/53 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/624 variables, 0/53 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 32/656 variables, 32/85 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/656 variables, 0/85 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 7/663 variables, 6/91 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/663 variables, 2/93 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 0/93 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1/664 variables, 1/94 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 0/94 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1373/2037 variables, 664/758 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2037 variables, 1/759 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2037 variables, 7/766 constraints. Problems are: Problem set: 7 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2037/2037 variables, and 766 constraints, problems are : Problem set: 7 solved, 7 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 664/664 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/13 constraints, Known Traps: 2/2 constraints]
After SMT, in 11103ms problems are : Problem set: 7 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 82 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1382/1382 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 654 transition count 1347
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 80 place count 619 transition count 1347
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 80 place count 619 transition count 1314
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 146 place count 586 transition count 1314
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 585 transition count 1313
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 585 transition count 1313
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 152 place count 583 transition count 1311
Applied a total of 152 rules in 295 ms. Remains 583 /664 variables (removed 81) and now considering 1311/1382 (removed 71) transitions.
Running 1300 sub problems to find dead transitions.
[2024-06-01 16:25:22] [INFO ] Flow matrix only has 1302 transitions (discarded 9 similar events)
// Phase 1: matrix 1302 rows 583 cols
[2024-06-01 16:25:22] [INFO ] Computed 82 invariants in 53 ms
[2024-06-01 16:25:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
[2024-06-01 16:25:39] [INFO ] Deduced a trap composed of 242 places in 266 ms of which 5 ms to minimize.
[2024-06-01 16:25:39] [INFO ] Deduced a trap composed of 184 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:25:40] [INFO ] Deduced a trap composed of 184 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:25:40] [INFO ] Deduced a trap composed of 184 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:25:40] [INFO ] Deduced a trap composed of 179 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:25:41] [INFO ] Deduced a trap composed of 154 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:25:41] [INFO ] Deduced a trap composed of 159 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:25:41] [INFO ] Deduced a trap composed of 159 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:25:41] [INFO ] Deduced a trap composed of 169 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:25:42] [INFO ] Deduced a trap composed of 164 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:25:42] [INFO ] Deduced a trap composed of 159 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:25:42] [INFO ] Deduced a trap composed of 159 places in 263 ms of which 3 ms to minimize.
[2024-06-01 16:25:43] [INFO ] Deduced a trap composed of 228 places in 237 ms of which 4 ms to minimize.
[2024-06-01 16:25:43] [INFO ] Deduced a trap composed of 164 places in 252 ms of which 4 ms to minimize.
[2024-06-01 16:25:43] [INFO ] Deduced a trap composed of 174 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:25:43] [INFO ] Deduced a trap composed of 169 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:25:44] [INFO ] Deduced a trap composed of 194 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:25:44] [INFO ] Deduced a trap composed of 159 places in 235 ms of which 3 ms to minimize.
[2024-06-01 16:25:44] [INFO ] Deduced a trap composed of 179 places in 296 ms of which 4 ms to minimize.
[2024-06-01 16:25:45] [INFO ] Deduced a trap composed of 164 places in 267 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/573 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/1885 variables, and 92 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/583 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1300/1300 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/573 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
[2024-06-01 16:26:02] [INFO ] Deduced a trap composed of 16 places in 304 ms of which 6 ms to minimize.
[2024-06-01 16:26:02] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/573 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1300 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 573/1885 variables, and 94 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/583 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1300 constraints, Known Traps: 22/22 constraints]
After SMT, in 46879ms problems are : Problem set: 0 solved, 1300 unsolved
Search for dead transitions found 0 dead transitions in 46894ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47192 ms. Remains : 583/664 places, 1311/1382 transitions.
RANDOM walk for 40002 steps (2602 resets) in 516 ms. (77 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (355 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
[2024-06-01 16:26:09] [INFO ] Flow matrix only has 1302 transitions (discarded 9 similar events)
[2024-06-01 16:26:09] [INFO ] Invariant cache hit.
[2024-06-01 16:26:09] [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) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 108/119 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 453/572 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/573 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/581 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/582 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1302/1884 variables, 582/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1884 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1884 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1885 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1885 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1885 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1885/1885 variables, and 666 constraints, problems are : Problem set: 0 solved, 1 unsolved in 623 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 583/583 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 108/119 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 453/572 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/573 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/581 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:26:10] [INFO ] Deduced a trap composed of 228 places in 264 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/582 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1302/1884 variables, 582/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1884 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:26:11] [INFO ] Deduced a trap composed of 240 places in 394 ms of which 4 ms to minimize.
[2024-06-01 16:26:11] [INFO ] Deduced a trap composed of 248 places in 333 ms of which 3 ms to minimize.
[2024-06-01 16:26:11] [INFO ] Deduced a trap composed of 234 places in 376 ms of which 4 ms to minimize.
[2024-06-01 16:26:12] [INFO ] Deduced a trap composed of 244 places in 386 ms of which 5 ms to minimize.
[2024-06-01 16:26:12] [INFO ] Deduced a trap composed of 236 places in 430 ms of which 4 ms to minimize.
[2024-06-01 16:26:13] [INFO ] Deduced a trap composed of 234 places in 355 ms of which 4 ms to minimize.
[2024-06-01 16:26:13] [INFO ] Deduced a trap composed of 232 places in 344 ms of which 4 ms to minimize.
[2024-06-01 16:26:14] [INFO ] Deduced a trap composed of 234 places in 373 ms of which 4 ms to minimize.
[2024-06-01 16:26:14] [INFO ] Deduced a trap composed of 232 places in 254 ms of which 4 ms to minimize.
[2024-06-01 16:26:14] [INFO ] Deduced a trap composed of 230 places in 270 ms of which 3 ms to minimize.
[2024-06-01 16:26:14] [INFO ] Deduced a trap composed of 240 places in 276 ms of which 3 ms to minimize.
[2024-06-01 16:26:15] [INFO ] Deduced a trap composed of 244 places in 404 ms of which 4 ms to minimize.
[2024-06-01 16:26:15] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:26:16] [INFO ] Deduced a trap composed of 236 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:26:16] [INFO ] Deduced a trap composed of 236 places in 394 ms of which 4 ms to minimize.
[2024-06-01 16:26:16] [INFO ] Deduced a trap composed of 228 places in 299 ms of which 3 ms to minimize.
[2024-06-01 16:26:17] [INFO ] Deduced a trap composed of 232 places in 373 ms of which 4 ms to minimize.
[2024-06-01 16:26:17] [INFO ] Deduced a trap composed of 234 places in 340 ms of which 11 ms to minimize.
[2024-06-01 16:26:18] [INFO ] Deduced a trap composed of 234 places in 352 ms of which 4 ms to minimize.
[2024-06-01 16:26:18] [INFO ] Deduced a trap composed of 236 places in 315 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1884 variables, 20/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:26:18] [INFO ] Deduced a trap composed of 234 places in 343 ms of which 4 ms to minimize.
[2024-06-01 16:26:19] [INFO ] Deduced a trap composed of 246 places in 282 ms of which 3 ms to minimize.
[2024-06-01 16:26:19] [INFO ] Deduced a trap composed of 230 places in 282 ms of which 3 ms to minimize.
[2024-06-01 16:26:19] [INFO ] Deduced a trap composed of 230 places in 331 ms of which 3 ms to minimize.
[2024-06-01 16:26:20] [INFO ] Deduced a trap composed of 228 places in 372 ms of which 4 ms to minimize.
[2024-06-01 16:26:20] [INFO ] Deduced a trap composed of 230 places in 386 ms of which 8 ms to minimize.
[2024-06-01 16:26:21] [INFO ] Deduced a trap composed of 230 places in 369 ms of which 3 ms to minimize.
[2024-06-01 16:26:21] [INFO ] Deduced a trap composed of 234 places in 351 ms of which 4 ms to minimize.
[2024-06-01 16:26:22] [INFO ] Deduced a trap composed of 238 places in 329 ms of which 4 ms to minimize.
[2024-06-01 16:26:23] [INFO ] Deduced a trap composed of 232 places in 411 ms of which 6 ms to minimize.
[2024-06-01 16:26:23] [INFO ] Deduced a trap composed of 234 places in 402 ms of which 4 ms to minimize.
[2024-06-01 16:26:24] [INFO ] Deduced a trap composed of 228 places in 360 ms of which 4 ms to minimize.
[2024-06-01 16:26:24] [INFO ] Deduced a trap composed of 238 places in 334 ms of which 4 ms to minimize.
[2024-06-01 16:26:25] [INFO ] Deduced a trap composed of 236 places in 318 ms of which 3 ms to minimize.
[2024-06-01 16:26:25] [INFO ] Deduced a trap composed of 234 places in 337 ms of which 4 ms to minimize.
[2024-06-01 16:26:26] [INFO ] Deduced a trap composed of 242 places in 399 ms of which 4 ms to minimize.
[2024-06-01 16:26:27] [INFO ] Deduced a trap composed of 236 places in 332 ms of which 4 ms to minimize.
[2024-06-01 16:26:27] [INFO ] Deduced a trap composed of 232 places in 273 ms of which 3 ms to minimize.
[2024-06-01 16:26:27] [INFO ] Deduced a trap composed of 228 places in 240 ms of which 3 ms to minimize.
[2024-06-01 16:26:28] [INFO ] Deduced a trap composed of 238 places in 261 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1884 variables, 20/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:26:28] [INFO ] Deduced a trap composed of 238 places in 278 ms of which 3 ms to minimize.
[2024-06-01 16:26:28] [INFO ] Deduced a trap composed of 244 places in 267 ms of which 3 ms to minimize.
[2024-06-01 16:26:28] [INFO ] Deduced a trap composed of 236 places in 246 ms of which 3 ms to minimize.
[2024-06-01 16:26:29] [INFO ] Deduced a trap composed of 244 places in 314 ms of which 3 ms to minimize.
[2024-06-01 16:26:29] [INFO ] Deduced a trap composed of 234 places in 284 ms of which 3 ms to minimize.
[2024-06-01 16:26:29] [INFO ] Deduced a trap composed of 242 places in 290 ms of which 4 ms to minimize.
[2024-06-01 16:26:30] [INFO ] Deduced a trap composed of 240 places in 330 ms of which 3 ms to minimize.
[2024-06-01 16:26:30] [INFO ] Deduced a trap composed of 238 places in 301 ms of which 3 ms to minimize.
[2024-06-01 16:26:30] [INFO ] Deduced a trap composed of 232 places in 296 ms of which 3 ms to minimize.
[2024-06-01 16:26:31] [INFO ] Deduced a trap composed of 230 places in 371 ms of which 3 ms to minimize.
[2024-06-01 16:26:32] [INFO ] Deduced a trap composed of 240 places in 291 ms of which 3 ms to minimize.
[2024-06-01 16:26:32] [INFO ] Deduced a trap composed of 234 places in 286 ms of which 3 ms to minimize.
[2024-06-01 16:26:32] [INFO ] Deduced a trap composed of 232 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:26:33] [INFO ] Deduced a trap composed of 248 places in 450 ms of which 3 ms to minimize.
[2024-06-01 16:26:33] [INFO ] Deduced a trap composed of 236 places in 306 ms of which 3 ms to minimize.
[2024-06-01 16:26:33] [INFO ] Deduced a trap composed of 236 places in 326 ms of which 4 ms to minimize.
[2024-06-01 16:26:34] [INFO ] Deduced a trap composed of 246 places in 352 ms of which 4 ms to minimize.
[2024-06-01 16:26:34] [INFO ] Deduced a trap composed of 242 places in 305 ms of which 3 ms to minimize.
[2024-06-01 16:26:35] [INFO ] Deduced a trap composed of 236 places in 328 ms of which 4 ms to minimize.
[2024-06-01 16:26:35] [INFO ] Deduced a trap composed of 242 places in 315 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1884 variables, 20/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:26:36] [INFO ] Deduced a trap composed of 232 places in 294 ms of which 3 ms to minimize.
[2024-06-01 16:26:36] [INFO ] Deduced a trap composed of 228 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:26:36] [INFO ] Deduced a trap composed of 250 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:26:37] [INFO ] Deduced a trap composed of 240 places in 249 ms of which 3 ms to minimize.
[2024-06-01 16:26:37] [INFO ] Deduced a trap composed of 234 places in 242 ms of which 3 ms to minimize.
[2024-06-01 16:26:37] [INFO ] Deduced a trap composed of 246 places in 318 ms of which 3 ms to minimize.
[2024-06-01 16:26:38] [INFO ] Deduced a trap composed of 236 places in 330 ms of which 4 ms to minimize.
[2024-06-01 16:26:38] [INFO ] Deduced a trap composed of 232 places in 387 ms of which 4 ms to minimize.
[2024-06-01 16:26:39] [INFO ] Deduced a trap composed of 232 places in 364 ms of which 4 ms to minimize.
[2024-06-01 16:26:39] [INFO ] Deduced a trap composed of 242 places in 345 ms of which 4 ms to minimize.
[2024-06-01 16:26:39] [INFO ] Deduced a trap composed of 236 places in 337 ms of which 4 ms to minimize.
[2024-06-01 16:26:40] [INFO ] Deduced a trap composed of 232 places in 317 ms of which 4 ms to minimize.
[2024-06-01 16:26:40] [INFO ] Deduced a trap composed of 238 places in 296 ms of which 3 ms to minimize.
[2024-06-01 16:26:41] [INFO ] Deduced a trap composed of 236 places in 333 ms of which 4 ms to minimize.
[2024-06-01 16:26:41] [INFO ] Deduced a trap composed of 238 places in 302 ms of which 3 ms to minimize.
[2024-06-01 16:26:41] [INFO ] Deduced a trap composed of 240 places in 278 ms of which 3 ms to minimize.
[2024-06-01 16:26:42] [INFO ] Deduced a trap composed of 244 places in 371 ms of which 5 ms to minimize.
[2024-06-01 16:26:42] [INFO ] Deduced a trap composed of 238 places in 267 ms of which 3 ms to minimize.
[2024-06-01 16:26:43] [INFO ] Deduced a trap composed of 238 places in 403 ms of which 5 ms to minimize.
[2024-06-01 16:26:43] [INFO ] Deduced a trap composed of 240 places in 366 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1884 variables, 20/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:26:44] [INFO ] Deduced a trap composed of 230 places in 310 ms of which 3 ms to minimize.
[2024-06-01 16:26:44] [INFO ] Deduced a trap composed of 252 places in 321 ms of which 4 ms to minimize.
[2024-06-01 16:26:44] [INFO ] Deduced a trap composed of 232 places in 287 ms of which 4 ms to minimize.
[2024-06-01 16:26:45] [INFO ] Deduced a trap composed of 240 places in 386 ms of which 4 ms to minimize.
[2024-06-01 16:26:46] [INFO ] Deduced a trap composed of 234 places in 339 ms of which 4 ms to minimize.
[2024-06-01 16:26:47] [INFO ] Deduced a trap composed of 232 places in 395 ms of which 5 ms to minimize.
[2024-06-01 16:26:48] [INFO ] Deduced a trap composed of 230 places in 348 ms of which 4 ms to minimize.
[2024-06-01 16:26:48] [INFO ] Deduced a trap composed of 236 places in 384 ms of which 3 ms to minimize.
[2024-06-01 16:26:49] [INFO ] Deduced a trap composed of 238 places in 408 ms of which 4 ms to minimize.
[2024-06-01 16:26:49] [INFO ] Deduced a trap composed of 240 places in 381 ms of which 4 ms to minimize.
[2024-06-01 16:26:50] [INFO ] Deduced a trap composed of 240 places in 297 ms of which 3 ms to minimize.
[2024-06-01 16:26:50] [INFO ] Deduced a trap composed of 252 places in 349 ms of which 16 ms to minimize.
[2024-06-01 16:26:50] [INFO ] Deduced a trap composed of 236 places in 283 ms of which 3 ms to minimize.
[2024-06-01 16:26:51] [INFO ] Deduced a trap composed of 244 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:26:51] [INFO ] Deduced a trap composed of 238 places in 287 ms of which 3 ms to minimize.
[2024-06-01 16:26:52] [INFO ] Deduced a trap composed of 238 places in 345 ms of which 3 ms to minimize.
[2024-06-01 16:26:53] [INFO ] Deduced a trap composed of 238 places in 347 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1884/1885 variables, and 763 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45040 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 582/583 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 98/98 constraints]
After SMT, in 45677ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 1311/1311 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 583 transition count 1310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 582 transition count 1310
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 582 transition count 1308
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 580 transition count 1308
Applied a total of 6 rules in 57 ms. Remains 580 /583 variables (removed 3) and now considering 1308/1311 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 580/583 places, 1308/1311 transitions.
Successfully simplified 7 atomic propositions for a total of 15 simplifications.
[2024-06-01 16:26:55] [INFO ] Flatten gal took : 218 ms
[2024-06-01 16:26:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBNT-COL-S10J30-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:26:56] [INFO ] Flatten gal took : 158 ms
[2024-06-01 16:26:57] [INFO ] Input system was already deterministic with 1382 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 664/664 places, 1382/1382 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1347
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 619 transition count 1347
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 619 transition count 1313
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 585 transition count 1313
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 584 transition count 1312
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 584 transition count 1312
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 583 transition count 1311
Applied a total of 142 rules in 118 ms. Remains 583 /664 variables (removed 81) and now considering 1311/1382 (removed 71) transitions.
Running 1300 sub problems to find dead transitions.
[2024-06-01 16:26:57] [INFO ] Flow matrix only has 1302 transitions (discarded 9 similar events)
// Phase 1: matrix 1302 rows 583 cols
[2024-06-01 16:26:57] [INFO ] Computed 82 invariants in 25 ms
[2024-06-01 16:26:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/573 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 3 (OVERLAPS) 9/582 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 582/1885 variables, and 81 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/583 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1300/1300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
[2024-06-01 16:27:24] [INFO ] Deduced a trap composed of 187 places in 294 ms of which 4 ms to minimize.
[2024-06-01 16:27:25] [INFO ] Deduced a trap composed of 159 places in 287 ms of which 3 ms to minimize.
[2024-06-01 16:27:25] [INFO ] Deduced a trap composed of 159 places in 288 ms of which 3 ms to minimize.
[2024-06-01 16:27:25] [INFO ] Deduced a trap composed of 177 places in 295 ms of which 3 ms to minimize.
[2024-06-01 16:27:26] [INFO ] Deduced a trap composed of 149 places in 286 ms of which 3 ms to minimize.
[2024-06-01 16:27:26] [INFO ] Deduced a trap composed of 154 places in 297 ms of which 3 ms to minimize.
[2024-06-01 16:27:26] [INFO ] Deduced a trap composed of 187 places in 303 ms of which 3 ms to minimize.
[2024-06-01 16:27:27] [INFO ] Deduced a trap composed of 167 places in 276 ms of which 3 ms to minimize.
[2024-06-01 16:27:27] [INFO ] Deduced a trap composed of 160 places in 290 ms of which 4 ms to minimize.
[2024-06-01 16:27:27] [INFO ] Deduced a trap composed of 179 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:27:28] [INFO ] Deduced a trap composed of 154 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:27:28] [INFO ] Deduced a trap composed of 154 places in 274 ms of which 3 ms to minimize.
[2024-06-01 16:27:28] [INFO ] Deduced a trap composed of 149 places in 275 ms of which 2 ms to minimize.
[2024-06-01 16:27:28] [INFO ] Deduced a trap composed of 167 places in 275 ms of which 3 ms to minimize.
[2024-06-01 16:27:29] [INFO ] Deduced a trap composed of 162 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:27:29] [INFO ] Deduced a trap composed of 162 places in 309 ms of which 3 ms to minimize.
[2024-06-01 16:27:29] [INFO ] Deduced a trap composed of 162 places in 308 ms of which 3 ms to minimize.
[2024-06-01 16:27:30] [INFO ] Deduced a trap composed of 157 places in 316 ms of which 3 ms to minimize.
[2024-06-01 16:27:30] [INFO ] Deduced a trap composed of 237 places in 311 ms of which 3 ms to minimize.
[2024-06-01 16:27:30] [INFO ] Deduced a trap composed of 134 places in 297 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/573 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
[2024-06-01 16:27:32] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 2 ms to minimize.
[2024-06-01 16:27:34] [INFO ] Deduced a trap composed of 20 places in 308 ms of which 3 ms to minimize.
[2024-06-01 16:27:39] [INFO ] Deduced a trap composed of 81 places in 200 ms of which 3 ms to minimize.
[2024-06-01 16:27:39] [INFO ] Deduced a trap composed of 81 places in 212 ms of which 3 ms to minimize.
[2024-06-01 16:27:40] [INFO ] Deduced a trap composed of 81 places in 215 ms of which 3 ms to minimize.
[2024-06-01 16:27:40] [INFO ] Deduced a trap composed of 81 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:27:40] [INFO ] Deduced a trap composed of 81 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:27:41] [INFO ] Deduced a trap composed of 81 places in 193 ms of which 2 ms to minimize.
[2024-06-01 16:27:41] [INFO ] Deduced a trap composed of 81 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:27:41] [INFO ] Deduced a trap composed of 139 places in 201 ms of which 2 ms to minimize.
[2024-06-01 16:27:42] [INFO ] Deduced a trap composed of 134 places in 203 ms of which 2 ms to minimize.
[2024-06-01 16:27:42] [INFO ] Deduced a trap composed of 81 places in 202 ms of which 3 ms to minimize.
[2024-06-01 16:27:42] [INFO ] Deduced a trap composed of 233 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:27:43] [INFO ] Deduced a trap composed of 81 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:27:43] [INFO ] Deduced a trap composed of 235 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:27:43] [INFO ] Deduced a trap composed of 81 places in 277 ms of which 3 ms to minimize.
SMT process timed out in 46543ms, After SMT, problems are : Problem set: 0 solved, 1300 unsolved
Search for dead transitions found 0 dead transitions in 46561ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 46683 ms. Remains : 583/664 places, 1311/1382 transitions.
[2024-06-01 16:27:43] [INFO ] Flatten gal took : 55 ms
[2024-06-01 16:27:43] [INFO ] Flatten gal took : 68 ms
[2024-06-01 16:27:44] [INFO ] Input system was already deterministic with 1311 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1382/1382 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1382
Applied a total of 10 rules in 10 ms. Remains 654 /664 variables (removed 10) and now considering 1382/1382 (removed 0) transitions.
Running 1371 sub problems to find dead transitions.
[2024-06-01 16:27:44] [INFO ] Flow matrix only has 1373 transitions (discarded 9 similar events)
// Phase 1: matrix 1373 rows 654 cols
[2024-06-01 16:27:44] [INFO ] Computed 82 invariants in 20 ms
[2024-06-01 16:27:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/2027 variables, and 71 constraints, problems are : Problem set: 0 solved, 1371 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 66/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/654 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1371/1371 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/643 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
At refinement iteration 3 (OVERLAPS) 10/653 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
[2024-06-01 16:28:28] [INFO ] Deduced a trap composed of 12 places in 308 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 653/2027 variables, and 82 constraints, problems are : Problem set: 0 solved, 1371 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/654 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1371 constraints, Known Traps: 1/1 constraints]
After SMT, in 46012ms problems are : Problem set: 0 solved, 1371 unsolved
Search for dead transitions found 0 dead transitions in 46025ms
Finished structural reductions in LTL mode , in 1 iterations and 46040 ms. Remains : 654/664 places, 1382/1382 transitions.
[2024-06-01 16:28:30] [INFO ] Flatten gal took : 94 ms
[2024-06-01 16:28:30] [INFO ] Flatten gal took : 116 ms
[2024-06-01 16:28:30] [INFO ] Input system was already deterministic with 1382 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1382/1382 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1382
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1381
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1381
Applied a total of 12 rules in 28 ms. Remains 653 /664 variables (removed 11) and now considering 1381/1382 (removed 1) transitions.
Running 1370 sub problems to find dead transitions.
[2024-06-01 16:28:30] [INFO ] Flow matrix only has 1372 transitions (discarded 9 similar events)
// Phase 1: matrix 1372 rows 653 cols
[2024-06-01 16:28:30] [INFO ] Computed 82 invariants in 20 ms
[2024-06-01 16:28:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1370 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 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.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 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 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 1.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 4.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 9.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 10/652 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 652/2025 variables, and 81 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1370/1370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-06-01 16:29:01] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 2 ms to minimize.
[2024-06-01 16:29:01] [INFO ] Deduced a trap composed of 12 places in 250 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2025 variables, and 73 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 66/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1370 constraints, Known Traps: 2/2 constraints]
After SMT, in 47217ms problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 47236ms
Finished structural reductions in LTL mode , in 1 iterations and 47269 ms. Remains : 653/664 places, 1381/1382 transitions.
[2024-06-01 16:29:18] [INFO ] Flatten gal took : 52 ms
[2024-06-01 16:29:18] [INFO ] Flatten gal took : 54 ms
[2024-06-01 16:29:18] [INFO ] Input system was already deterministic with 1381 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 664/664 places, 1382/1382 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1347
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 619 transition count 1346
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 618 transition count 1346
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 72 place count 618 transition count 1312
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 140 place count 584 transition count 1312
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 583 transition count 1311
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 583 transition count 1311
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 3 with 4 rules applied. Total rules applied 146 place count 581 transition count 1309
Applied a total of 146 rules in 172 ms. Remains 581 /664 variables (removed 83) and now considering 1309/1382 (removed 73) transitions.
Running 1298 sub problems to find dead transitions.
[2024-06-01 16:29:18] [INFO ] Flow matrix only has 1300 transitions (discarded 9 similar events)
// Phase 1: matrix 1300 rows 581 cols
[2024-06-01 16:29:18] [INFO ] Computed 82 invariants in 15 ms
[2024-06-01 16:29:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
[2024-06-01 16:29:34] [INFO ] Deduced a trap composed of 240 places in 212 ms of which 4 ms to minimize.
[2024-06-01 16:29:34] [INFO ] Deduced a trap composed of 177 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:29:34] [INFO ] Deduced a trap composed of 167 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:29:35] [INFO ] Deduced a trap composed of 172 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:29:35] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:29:35] [INFO ] Deduced a trap composed of 172 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:29:35] [INFO ] Deduced a trap composed of 167 places in 214 ms of which 15 ms to minimize.
[2024-06-01 16:29:35] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:29:36] [INFO ] Deduced a trap composed of 172 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:29:36] [INFO ] Deduced a trap composed of 157 places in 267 ms of which 3 ms to minimize.
[2024-06-01 16:29:36] [INFO ] Deduced a trap composed of 152 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:29:37] [INFO ] Deduced a trap composed of 157 places in 218 ms of which 3 ms to minimize.
[2024-06-01 16:29:37] [INFO ] Deduced a trap composed of 157 places in 216 ms of which 4 ms to minimize.
[2024-06-01 16:29:37] [INFO ] Deduced a trap composed of 234 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:29:37] [INFO ] Deduced a trap composed of 152 places in 236 ms of which 4 ms to minimize.
[2024-06-01 16:29:38] [INFO ] Deduced a trap composed of 236 places in 240 ms of which 3 ms to minimize.
[2024-06-01 16:29:38] [INFO ] Deduced a trap composed of 162 places in 298 ms of which 4 ms to minimize.
[2024-06-01 16:29:38] [INFO ] Deduced a trap composed of 162 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:29:38] [INFO ] Deduced a trap composed of 162 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:29:39] [INFO ] Deduced a trap composed of 234 places in 251 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
[2024-06-01 16:29:39] [INFO ] Deduced a trap composed of 157 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:29:40] [INFO ] Deduced a trap composed of 157 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:29:40] [INFO ] Deduced a trap composed of 152 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:29:40] [INFO ] Deduced a trap composed of 152 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:29:40] [INFO ] Deduced a trap composed of 157 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:29:41] [INFO ] Deduced a trap composed of 152 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:29:41] [INFO ] Deduced a trap composed of 142 places in 233 ms of which 3 ms to minimize.
[2024-06-01 16:29:41] [INFO ] Deduced a trap composed of 137 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:29:41] [INFO ] Deduced a trap composed of 142 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:29:42] [INFO ] Deduced a trap composed of 147 places in 223 ms of which 3 ms to minimize.
[2024-06-01 16:29:42] [INFO ] Deduced a trap composed of 137 places in 208 ms of which 4 ms to minimize.
[2024-06-01 16:29:42] [INFO ] Deduced a trap composed of 147 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:29:42] [INFO ] Deduced a trap composed of 157 places in 202 ms of which 3 ms to minimize.
[2024-06-01 16:29:43] [INFO ] Deduced a trap composed of 167 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:29:43] [INFO ] Deduced a trap composed of 172 places in 217 ms of which 4 ms to minimize.
[2024-06-01 16:29:43] [INFO ] Deduced a trap composed of 157 places in 221 ms of which 4 ms to minimize.
[2024-06-01 16:29:43] [INFO ] Deduced a trap composed of 152 places in 204 ms of which 3 ms to minimize.
[2024-06-01 16:29:44] [INFO ] Deduced a trap composed of 157 places in 215 ms of which 2 ms to minimize.
[2024-06-01 16:29:44] [INFO ] Deduced a trap composed of 152 places in 215 ms of which 3 ms to minimize.
[2024-06-01 16:29:44] [INFO ] Deduced a trap composed of 157 places in 204 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/1881 variables, and 112 constraints, problems are : Problem set: 0 solved, 1298 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1298/1298 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
[2024-06-01 16:29:46] [INFO ] Deduced a trap composed of 238 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:29:46] [INFO ] Deduced a trap composed of 182 places in 208 ms of which 3 ms to minimize.
[2024-06-01 16:29:46] [INFO ] Deduced a trap composed of 177 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:29:47] [INFO ] Deduced a trap composed of 172 places in 202 ms of which 4 ms to minimize.
[2024-06-01 16:29:47] [INFO ] Deduced a trap composed of 167 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:29:47] [INFO ] Deduced a trap composed of 157 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:29:47] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:29:48] [INFO ] Deduced a trap composed of 177 places in 207 ms of which 3 ms to minimize.
[2024-06-01 16:29:48] [INFO ] Deduced a trap composed of 172 places in 221 ms of which 3 ms to minimize.
[2024-06-01 16:29:48] [INFO ] Deduced a trap composed of 177 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:29:48] [INFO ] Deduced a trap composed of 172 places in 206 ms of which 3 ms to minimize.
[2024-06-01 16:29:48] [INFO ] Deduced a trap composed of 182 places in 202 ms of which 3 ms to minimize.
[2024-06-01 16:29:49] [INFO ] Deduced a trap composed of 177 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:29:49] [INFO ] Deduced a trap composed of 147 places in 195 ms of which 3 ms to minimize.
[2024-06-01 16:29:49] [INFO ] Deduced a trap composed of 182 places in 200 ms of which 3 ms to minimize.
[2024-06-01 16:29:49] [INFO ] Deduced a trap composed of 167 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:29:49] [INFO ] Deduced a trap composed of 152 places in 196 ms of which 3 ms to minimize.
[2024-06-01 16:29:50] [INFO ] Deduced a trap composed of 152 places in 194 ms of which 2 ms to minimize.
[2024-06-01 16:29:50] [INFO ] Deduced a trap composed of 152 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:29:50] [INFO ] Deduced a trap composed of 152 places in 223 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1298 unsolved
[2024-06-01 16:29:52] [INFO ] Deduced a trap composed of 157 places in 256 ms of which 3 ms to minimize.
[2024-06-01 16:29:52] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 8 ms to minimize.
[2024-06-01 16:29:53] [INFO ] Deduced a trap composed of 151 places in 279 ms of which 2 ms to minimize.
[2024-06-01 16:29:54] [INFO ] Deduced a trap composed of 147 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:30:04] [INFO ] Deduced a trap composed of 230 places in 298 ms of which 15 ms to minimize.
SMT process timed out in 46504ms, After SMT, problems are : Problem set: 0 solved, 1298 unsolved
Search for dead transitions found 0 dead transitions in 46516ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 46753 ms. Remains : 581/664 places, 1309/1382 transitions.
[2024-06-01 16:30:05] [INFO ] Flatten gal took : 45 ms
[2024-06-01 16:30:05] [INFO ] Flatten gal took : 49 ms
[2024-06-01 16:30:05] [INFO ] Input system was already deterministic with 1309 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1382/1382 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1382
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1381
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1381
Applied a total of 12 rules in 20 ms. Remains 653 /664 variables (removed 11) and now considering 1381/1382 (removed 1) transitions.
Running 1370 sub problems to find dead transitions.
[2024-06-01 16:30:05] [INFO ] Flow matrix only has 1372 transitions (discarded 9 similar events)
// Phase 1: matrix 1372 rows 653 cols
[2024-06-01 16:30:05] [INFO ] Computed 82 invariants in 31 ms
[2024-06-01 16:30:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 3 (OVERLAPS) 10/652 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 652/2025 variables, and 81 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 20081 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1370/1370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-06-01 16:30:35] [INFO ] Deduced a trap composed of 19 places in 317 ms of which 6 ms to minimize.
[2024-06-01 16:30:35] [INFO ] Deduced a trap composed of 12 places in 394 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2025 variables, and 73 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 66/76 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1370 constraints, Known Traps: 2/2 constraints]
After SMT, in 46451ms problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 46463ms
Finished structural reductions in LTL mode , in 1 iterations and 46498 ms. Remains : 653/664 places, 1381/1382 transitions.
[2024-06-01 16:30:51] [INFO ] Flatten gal took : 61 ms
[2024-06-01 16:30:51] [INFO ] Flatten gal took : 76 ms
[2024-06-01 16:30:51] [INFO ] Input system was already deterministic with 1381 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 664/664 places, 1382/1382 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 654 transition count 1346
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 618 transition count 1346
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 72 place count 618 transition count 1311
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 142 place count 583 transition count 1311
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 582 transition count 1310
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 582 transition count 1310
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 148 place count 580 transition count 1308
Applied a total of 148 rules in 85 ms. Remains 580 /664 variables (removed 84) and now considering 1308/1382 (removed 74) transitions.
Running 1297 sub problems to find dead transitions.
[2024-06-01 16:30:52] [INFO ] Flow matrix only has 1299 transitions (discarded 9 similar events)
// Phase 1: matrix 1299 rows 580 cols
[2024-06-01 16:30:52] [INFO ] Computed 82 invariants in 21 ms
[2024-06-01 16:30:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:31:07] [INFO ] Deduced a trap composed of 161 places in 261 ms of which 10 ms to minimize.
[2024-06-01 16:31:07] [INFO ] Deduced a trap composed of 151 places in 323 ms of which 4 ms to minimize.
[2024-06-01 16:31:07] [INFO ] Deduced a trap composed of 151 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:31:08] [INFO ] Deduced a trap composed of 161 places in 251 ms of which 3 ms to minimize.
[2024-06-01 16:31:08] [INFO ] Deduced a trap composed of 156 places in 244 ms of which 3 ms to minimize.
[2024-06-01 16:31:08] [INFO ] Deduced a trap composed of 161 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:31:08] [INFO ] Deduced a trap composed of 156 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:31:09] [INFO ] Deduced a trap composed of 156 places in 216 ms of which 3 ms to minimize.
[2024-06-01 16:31:09] [INFO ] Deduced a trap composed of 161 places in 215 ms of which 3 ms to minimize.
[2024-06-01 16:31:09] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 3 ms to minimize.
[2024-06-01 16:31:09] [INFO ] Deduced a trap composed of 161 places in 310 ms of which 12 ms to minimize.
[2024-06-01 16:31:10] [INFO ] Deduced a trap composed of 156 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:31:10] [INFO ] Deduced a trap composed of 146 places in 212 ms of which 3 ms to minimize.
[2024-06-01 16:31:10] [INFO ] Deduced a trap composed of 136 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:31:10] [INFO ] Deduced a trap composed of 156 places in 218 ms of which 4 ms to minimize.
[2024-06-01 16:31:11] [INFO ] Deduced a trap composed of 151 places in 228 ms of which 17 ms to minimize.
[2024-06-01 16:31:11] [INFO ] Deduced a trap composed of 146 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:31:11] [INFO ] Deduced a trap composed of 151 places in 356 ms of which 15 ms to minimize.
[2024-06-01 16:31:11] [INFO ] Deduced a trap composed of 156 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:31:12] [INFO ] Deduced a trap composed of 156 places in 249 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
[2024-06-01 16:31:12] [INFO ] Deduced a trap composed of 176 places in 325 ms of which 14 ms to minimize.
[2024-06-01 16:31:13] [INFO ] Deduced a trap composed of 234 places in 245 ms of which 19 ms to minimize.
[2024-06-01 16:31:13] [INFO ] Deduced a trap composed of 236 places in 225 ms of which 3 ms to minimize.
[2024-06-01 16:31:13] [INFO ] Deduced a trap composed of 171 places in 202 ms of which 4 ms to minimize.
[2024-06-01 16:31:13] [INFO ] Deduced a trap composed of 151 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:31:14] [INFO ] Deduced a trap composed of 171 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:31:14] [INFO ] Deduced a trap composed of 161 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:31:14] [INFO ] Deduced a trap composed of 161 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:31:14] [INFO ] Deduced a trap composed of 156 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:31:14] [INFO ] Deduced a trap composed of 151 places in 200 ms of which 3 ms to minimize.
[2024-06-01 16:31:15] [INFO ] Deduced a trap composed of 151 places in 201 ms of which 4 ms to minimize.
[2024-06-01 16:31:15] [INFO ] Deduced a trap composed of 146 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:31:15] [INFO ] Deduced a trap composed of 146 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:31:15] [INFO ] Deduced a trap composed of 151 places in 196 ms of which 3 ms to minimize.
[2024-06-01 16:31:16] [INFO ] Deduced a trap composed of 146 places in 266 ms of which 24 ms to minimize.
[2024-06-01 16:31:16] [INFO ] Deduced a trap composed of 151 places in 278 ms of which 3 ms to minimize.
[2024-06-01 16:31:16] [INFO ] Deduced a trap composed of 151 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:31:16] [INFO ] Deduced a trap composed of 151 places in 239 ms of which 3 ms to minimize.
[2024-06-01 16:31:17] [INFO ] Deduced a trap composed of 146 places in 211 ms of which 3 ms to minimize.
[2024-06-01 16:31:17] [INFO ] Deduced a trap composed of 161 places in 499 ms of which 26 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1879 variables, and 112 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 20088 ms.
Refiners :[Positive P Invariants (semi-flows): 66/75 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1297/1297 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 1297 unsolved
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-S10J30-CTLFireability-2024-00
Could not compute solution for formula : PolyORBNT-COL-S10J30-CTLFireability-2024-01
Could not compute solution for formula : PolyORBNT-COL-S10J30-CTLFireability-2024-02
Could not compute solution for formula : PolyORBNT-COL-S10J30-CTLFireability-2024-03
Could not compute solution for formula : PolyORBNT-COL-S10J30-CTLFireability-2024-04
Could not compute solution for formula : PolyORBNT-COL-S10J30-CTLFireability-2024-05
Could not compute solution for formula : PolyORBNT-COL-S10J30-CTLFireability-2024-06
Could not compute solution for formula : PolyORBNT-COL-S10J30-CTLFireability-2024-07
Could not compute solution for formula : PolyORBNT-COL-S10J30-CTLFireability-2024-08
Could not compute solution for formula : PolyORBNT-COL-S10J30-CTLFireability-2024-09
Could not compute solution for formula : PolyORBNT-COL-S10J30-CTLFireability-2024-10
Could not compute solution for formula : PolyORBNT-COL-S10J30-CTLFireability-2024-11
Could not compute solution for formula : PolyORBNT-COL-S10J30-CTLFireability-2024-12
Could not compute solution for formula : PolyORBNT-COL-S10J30-CTLFireability-2024-13
Could not compute solution for formula : PolyORBNT-COL-S10J30-CTLFireability-2024-14
Could not compute solution for formula : PolyORBNT-COL-S10J30-CTLFireability-2024-15

BK_STOP 1717259483267

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

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