Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r512-smll-171654407300275.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Peterson-PT-5, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407300275
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 110K Apr 12 02:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 458K Apr 12 02:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 107K Apr 12 02:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 475K Apr 12 02:41 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 47K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 135K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 173K Apr 12 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 733K Apr 12 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 289K Apr 12 03:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 12 03:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 535K 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 Peterson-PT-5-LTLCardinality-00
FORMULA_NAME Peterson-PT-5-LTLCardinality-01
FORMULA_NAME Peterson-PT-5-LTLCardinality-02
FORMULA_NAME Peterson-PT-5-LTLCardinality-03
FORMULA_NAME Peterson-PT-5-LTLCardinality-04
FORMULA_NAME Peterson-PT-5-LTLCardinality-05
FORMULA_NAME Peterson-PT-5-LTLCardinality-06
FORMULA_NAME Peterson-PT-5-LTLCardinality-07
FORMULA_NAME Peterson-PT-5-LTLCardinality-08
FORMULA_NAME Peterson-PT-5-LTLCardinality-09
FORMULA_NAME Peterson-PT-5-LTLCardinality-10
FORMULA_NAME Peterson-PT-5-LTLCardinality-11
FORMULA_NAME Peterson-PT-5-LTLCardinality-12
FORMULA_NAME Peterson-PT-5-LTLCardinality-13
FORMULA_NAME Peterson-PT-5-LTLCardinality-14
FORMULA_NAME Peterson-PT-5-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717272689354

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-5
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:11:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 20:11:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:11:31] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2024-06-01 20:11:31] [INFO ] Transformed 834 places.
[2024-06-01 20:11:31] [INFO ] Transformed 1242 transitions.
[2024-06-01 20:11:31] [INFO ] Found NUPN structural information;
[2024-06-01 20:11:31] [INFO ] Parsed PT model containing 834 places and 1242 transitions and 3828 arcs in 538 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Peterson-PT-5-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 643 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 49 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 20:11:32] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-06-01 20:11:32] [INFO ] Computed 23 invariants in 37 ms
[2024-06-01 20:11:33] [INFO ] Implicit Places using invariants in 876 ms returned [785, 805, 806, 809]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1016 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 830/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 31 ms. Remains 830 /830 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1121 ms. Remains : 830/834 places, 1242/1242 transitions.
Support contains 643 out of 830 places after structural reductions.
[2024-06-01 20:11:33] [INFO ] Flatten gal took : 150 ms
[2024-06-01 20:11:33] [INFO ] Flatten gal took : 84 ms
[2024-06-01 20:11:33] [INFO ] Input system was already deterministic with 1242 transitions.
Support contains 641 out of 830 places (down from 643) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1867 ms. (21 steps per ms) remains 5/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 374 ms. (106 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
[2024-06-01 20:11:34] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 830 cols
[2024-06-01 20:11:34] [INFO ] Computed 19 invariants in 7 ms
[2024-06-01 20:11:34] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 2 (OVERLAPS) 574/794 variables, 8/228 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/794 variables, 574/802 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/794 variables, 0/802 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/798 variables, 4/806 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 4/810 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/798 variables, 0/810 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/800 variables, 2/812 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/800 variables, 2/814 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/800 variables, 0/814 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1122/1922 variables, 800/1614 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1922 variables, 205/1819 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1922 variables, 0/1819 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 30/1952 variables, 30/1849 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1952 variables, 30/1879 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1952 variables, 5/1884 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1952 variables, 0/1884 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1952 variables, 0/1884 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1952/1952 variables, and 1884 constraints, problems are : Problem set: 1 solved, 4 unsolved in 2535 ms.
Refiners :[Domain max(s): 830/830 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 830/830 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 190/190 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/190 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 604/794 variables, 8/198 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/794 variables, 604/802 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 20:11:38] [INFO ] Deduced a trap composed of 139 places in 688 ms of which 79 ms to minimize.
[2024-06-01 20:11:39] [INFO ] Deduced a trap composed of 79 places in 704 ms of which 10 ms to minimize.
[2024-06-01 20:11:39] [INFO ] Deduced a trap composed of 179 places in 261 ms of which 5 ms to minimize.
[2024-06-01 20:11:39] [INFO ] Deduced a trap composed of 219 places in 231 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/794 variables, 4/806 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 0/806 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 4/798 variables, 4/810 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/798 variables, 4/814 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/798 variables, 0/814 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/800 variables, 2/816 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/800 variables, 2/818 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 20:11:40] [INFO ] Deduced a trap composed of 159 places in 229 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/800 variables, 1/819 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 20:11:40] [INFO ] Deduced a trap composed of 119 places in 318 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/800 variables, 1/820 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/800 variables, 0/820 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1122/1922 variables, 800/1620 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1922 variables, 205/1825 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1922 variables, 3/1828 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1922/1952 variables, and 1828 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5011 ms.
Refiners :[Domain max(s): 800/830 constraints, Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 800/830 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 6/6 constraints]
After SMT, in 7725ms problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 190 out of 830 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 830/830 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 830 transition count 1094
Reduce places removed 148 places and 0 transitions.
Performed 149 Post agglomeration using F-continuation condition.Transition count delta: 149
Iterating post reduction 1 with 297 rules applied. Total rules applied 445 place count 682 transition count 945
Reduce places removed 149 places and 0 transitions.
Iterating post reduction 2 with 149 rules applied. Total rules applied 594 place count 533 transition count 945
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 594 place count 533 transition count 891
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 702 place count 479 transition count 891
Applied a total of 702 rules in 142 ms. Remains 479 /830 variables (removed 351) and now considering 891/1242 (removed 351) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 479/830 places, 891/1242 transitions.
RANDOM walk for 40000 steps (8 resets) in 604 ms. (66 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 311 ms. (128 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 388136 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :1 out of 4
Probabilistic random walk after 388136 steps, saw 58179 distinct states, run finished after 3014 ms. (steps per millisecond=128 ) properties seen :1
[2024-06-01 20:11:46] [INFO ] Flow matrix only has 771 transitions (discarded 120 similar events)
// Phase 1: matrix 771 rows 479 cols
[2024-06-01 20:11:46] [INFO ] Computed 19 invariants in 6 ms
[2024-06-01 20:11:46] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 433/443 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 433/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/447 variables, 4/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 4/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/449 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 771/1220 variables, 449/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1220 variables, 205/1117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1220 variables, 0/1117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 30/1250 variables, 30/1147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1250 variables, 30/1177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1250 variables, 5/1182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1250 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1250 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1250/1250 variables, and 1182 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1066 ms.
Refiners :[Domain max(s): 479/479 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 479/479 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 433/443 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 433/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/447 variables, 4/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 4/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/449 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 771/1220 variables, 449/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1220 variables, 205/1117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1220 variables, 2/1119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1220 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 30/1250 variables, 30/1149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1250 variables, 30/1179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1250 variables, 5/1184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1250 variables, 1/1185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:11:48] [INFO ] Deduced a trap composed of 33 places in 373 ms of which 5 ms to minimize.
[2024-06-01 20:11:48] [INFO ] Deduced a trap composed of 49 places in 354 ms of which 5 ms to minimize.
[2024-06-01 20:11:49] [INFO ] Deduced a trap composed of 37 places in 323 ms of which 5 ms to minimize.
[2024-06-01 20:11:49] [INFO ] Deduced a trap composed of 136 places in 335 ms of which 4 ms to minimize.
[2024-06-01 20:11:50] [INFO ] Deduced a trap composed of 51 places in 340 ms of which 5 ms to minimize.
[2024-06-01 20:11:50] [INFO ] Deduced a trap composed of 27 places in 340 ms of which 4 ms to minimize.
[2024-06-01 20:11:50] [INFO ] Deduced a trap composed of 21 places in 339 ms of which 5 ms to minimize.
[2024-06-01 20:11:51] [INFO ] Deduced a trap composed of 27 places in 319 ms of which 4 ms to minimize.
[2024-06-01 20:11:51] [INFO ] Deduced a trap composed of 25 places in 325 ms of which 4 ms to minimize.
[2024-06-01 20:11:51] [INFO ] Deduced a trap composed of 9 places in 303 ms of which 4 ms to minimize.
[2024-06-01 20:11:52] [INFO ] Deduced a trap composed of 9 places in 306 ms of which 4 ms to minimize.
[2024-06-01 20:11:52] [INFO ] Deduced a trap composed of 49 places in 310 ms of which 4 ms to minimize.
[2024-06-01 20:11:52] [INFO ] Deduced a trap composed of 11 places in 281 ms of which 4 ms to minimize.
Problem AtomicPropp2 is UNSAT
[2024-06-01 20:11:53] [INFO ] Deduced a trap composed of 83 places in 303 ms of which 4 ms to minimize.
[2024-06-01 20:11:53] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 4 ms to minimize.
[2024-06-01 20:11:53] [INFO ] Deduced a trap composed of 17 places in 306 ms of which 5 ms to minimize.
[2024-06-01 20:11:54] [INFO ] Deduced a trap composed of 13 places in 304 ms of which 5 ms to minimize.
[2024-06-01 20:11:54] [INFO ] Deduced a trap composed of 11 places in 331 ms of which 4 ms to minimize.
[2024-06-01 20:11:54] [INFO ] Deduced a trap composed of 17 places in 311 ms of which 4 ms to minimize.
[2024-06-01 20:11:55] [INFO ] Deduced a trap composed of 17 places in 276 ms of which 4 ms to minimize.
Problem AtomicPropp2 is UNSAT
At refinement iteration 19 (INCLUDED_ONLY) 0/1250 variables, 20/1205 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 20:11:55] [INFO ] Deduced a trap composed of 11 places in 294 ms of which 3 ms to minimize.
[2024-06-01 20:11:55] [INFO ] Deduced a trap composed of 11 places in 319 ms of which 4 ms to minimize.
[2024-06-01 20:11:56] [INFO ] Deduced a trap composed of 31 places in 303 ms of which 4 ms to minimize.
[2024-06-01 20:11:56] [INFO ] Deduced a trap composed of 25 places in 280 ms of which 4 ms to minimize.
[2024-06-01 20:11:56] [INFO ] Deduced a trap composed of 57 places in 200 ms of which 3 ms to minimize.
[2024-06-01 20:11:57] [INFO ] Deduced a trap composed of 43 places in 247 ms of which 4 ms to minimize.
[2024-06-01 20:11:57] [INFO ] Deduced a trap composed of 43 places in 212 ms of which 3 ms to minimize.
[2024-06-01 20:11:57] [INFO ] Deduced a trap composed of 62 places in 206 ms of which 4 ms to minimize.
[2024-06-01 20:11:57] [INFO ] Deduced a trap composed of 65 places in 215 ms of which 9 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1250 variables, 9/1214 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1250 variables, 0/1214 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1250 variables, 0/1214 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1250/1250 variables, and 1214 constraints, problems are : Problem set: 1 solved, 2 unsolved in 11019 ms.
Refiners :[Domain max(s): 479/479 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 479/479 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 29/29 constraints]
After SMT, in 12120ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 1 properties in 180 ms.
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 479/479 places, 891/891 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 479 transition count 834
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 422 transition count 834
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 129 Pre rules applied. Total rules applied 114 place count 422 transition count 705
Deduced a syphon composed of 129 places in 1 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 372 place count 293 transition count 705
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 430 place count 264 transition count 676
Applied a total of 430 rules in 68 ms. Remains 264 /479 variables (removed 215) and now considering 676/891 (removed 215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 264/479 places, 676/891 transitions.
RANDOM walk for 40000 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 969822 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :0 out of 1
Probabilistic random walk after 969822 steps, saw 141591 distinct states, run finished after 3003 ms. (steps per millisecond=322 ) properties seen :0
[2024-06-01 20:12:01] [INFO ] Flow matrix only has 556 transitions (discarded 120 similar events)
// Phase 1: matrix 556 rows 264 cols
[2024-06-01 20:12:01] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 20:12:01] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 76/78 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 76/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/80 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 188/268 variables, 80/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 30/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 130/398 variables, 30/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 30/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/398 variables, 5/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/398 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 220/618 variables, 40/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/618 variables, 40/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/618 variables, 175/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/618 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 108/726 variables, 4/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/726 variables, 108/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/726 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/730 variables, 4/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/730 variables, 4/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/730 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/732 variables, 2/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/732 variables, 2/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/732 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 88/820 variables, 114/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/820 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/820 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 820/820 variables, and 752 constraints, problems are : Problem set: 0 solved, 1 unsolved in 476 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 264/264 constraints, ReadFeed: 205/205 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/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 76/78 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 76/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/80 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 188/268 variables, 80/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 30/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 130/398 variables, 30/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 30/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/398 variables, 5/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/398 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:12:02] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/398 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/398 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 220/618 variables, 40/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/618 variables, 40/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/618 variables, 175/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/618 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 108/726 variables, 4/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/726 variables, 108/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:12:02] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 3 ms to minimize.
[2024-06-01 20:12:02] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 3 ms to minimize.
[2024-06-01 20:12:02] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/726 variables, 3/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/726 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/730 variables, 4/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/730 variables, 4/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/730 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/732 variables, 2/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/732 variables, 2/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:12:03] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 4 ms to minimize.
[2024-06-01 20:12:03] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 3 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/732 variables, 2/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/732 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 88/820 variables, 114/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:12:03] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 3 ms to minimize.
[2024-06-01 20:12:03] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 2 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/820 variables, 2/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/820 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/820 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 820/820 variables, and 761 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1775 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 264/264 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 2268ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1554 steps, including 268 resets, run visited all 1 properties in 6 ms. (steps per millisecond=259 )
Parikh walk visited 1 properties in 13 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA Peterson-PT-5-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 180 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 1242/1242 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 830 transition count 1212
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 800 transition count 1212
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 60 place count 800 transition count 1057
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 370 place count 645 transition count 1057
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 420 place count 620 transition count 1032
Applied a total of 420 rules in 99 ms. Remains 620 /830 variables (removed 210) and now considering 1032/1242 (removed 210) transitions.
[2024-06-01 20:12:04] [INFO ] Flow matrix only has 912 transitions (discarded 120 similar events)
// Phase 1: matrix 912 rows 620 cols
[2024-06-01 20:12:04] [INFO ] Computed 19 invariants in 5 ms
[2024-06-01 20:12:04] [INFO ] Implicit Places using invariants in 456 ms returned [599, 600]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 459 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 618/830 places, 1032/1242 transitions.
Applied a total of 0 rules in 24 ms. Remains 618 /618 variables (removed 0) and now considering 1032/1032 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 583 ms. Remains : 618/830 places, 1032/1242 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-00
Product exploration explored 100000 steps with 3806 reset in 731 ms.
Stack based approach found an accepted trace after 1483 steps with 56 reset with depth 28 and stack size 28 in 12 ms.
FORMULA Peterson-PT-5-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLCardinality-00 finished in 1660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)||G(p2)))))'
Support contains 270 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 830 transition count 1092
Reduce places removed 150 places and 0 transitions.
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Iterating post reduction 1 with 300 rules applied. Total rules applied 450 place count 680 transition count 942
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 600 place count 530 transition count 942
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 600 place count 530 transition count 912
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 660 place count 500 transition count 912
Applied a total of 660 rules in 54 ms. Remains 500 /830 variables (removed 330) and now considering 912/1242 (removed 330) transitions.
[2024-06-01 20:12:05] [INFO ] Flow matrix only has 792 transitions (discarded 120 similar events)
// Phase 1: matrix 792 rows 500 cols
[2024-06-01 20:12:05] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 20:12:06] [INFO ] Implicit Places using invariants in 353 ms returned [474, 475]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 355 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 498/830 places, 912/1242 transitions.
Applied a total of 0 rules in 17 ms. Remains 498 /498 variables (removed 0) and now considering 912/912 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 427 ms. Remains : 498/830 places, 912/1242 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-04
Product exploration explored 100000 steps with 4400 reset in 1585 ms.
Stack based approach found an accepted trace after 148 steps with 9 reset with depth 23 and stack size 23 in 3 ms.
FORMULA Peterson-PT-5-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLCardinality-04 finished in 2127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(G(p1))))))'
Support contains 186 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 1242/1242 transitions.
Applied a total of 0 rules in 11 ms. Remains 830 /830 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 20:12:07] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 830 cols
[2024-06-01 20:12:07] [INFO ] Computed 19 invariants in 5 ms
[2024-06-01 20:12:08] [INFO ] Implicit Places using invariants in 613 ms returned [804, 805]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 617 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/830 places, 1242/1242 transitions.
Applied a total of 0 rules in 11 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 639 ms. Remains : 828/830 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 250 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-5-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-5-LTLCardinality-05 finished in 915 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 30 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 830 transition count 882
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 470 transition count 882
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 156 Pre rules applied. Total rules applied 720 place count 470 transition count 726
Deduced a syphon composed of 156 places in 1 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 1032 place count 314 transition count 726
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1092 place count 284 transition count 696
Applied a total of 1092 rules in 49 ms. Remains 284 /830 variables (removed 546) and now considering 696/1242 (removed 546) transitions.
[2024-06-01 20:12:08] [INFO ] Flow matrix only has 576 transitions (discarded 120 similar events)
// Phase 1: matrix 576 rows 284 cols
[2024-06-01 20:12:08] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 20:12:09] [INFO ] Implicit Places using invariants in 293 ms returned [263, 264]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 294 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 282/830 places, 696/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 282 /282 variables (removed 0) and now considering 696/696 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 358 ms. Remains : 282/830 places, 696/1242 transitions.
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-06
Product exploration explored 100000 steps with 19 reset in 249 ms.
Product exploration explored 100000 steps with 32 reset in 368 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Support contains 30 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 696/696 transitions.
Applied a total of 0 rules in 12 ms. Remains 282 /282 variables (removed 0) and now considering 696/696 (removed 0) transitions.
[2024-06-01 20:12:10] [INFO ] Flow matrix only has 576 transitions (discarded 120 similar events)
// Phase 1: matrix 576 rows 282 cols
[2024-06-01 20:12:10] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 20:12:10] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-06-01 20:12:10] [INFO ] Flow matrix only has 576 transitions (discarded 120 similar events)
[2024-06-01 20:12:10] [INFO ] Invariant cache hit.
[2024-06-01 20:12:10] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:12:11] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
[2024-06-01 20:12:11] [INFO ] Redundant transitions in 44 ms returned []
Running 690 sub problems to find dead transitions.
[2024-06-01 20:12:11] [INFO ] Flow matrix only has 576 transitions (discarded 120 similar events)
[2024-06-01 20:12:11] [INFO ] Invariant cache hit.
[2024-06-01 20:12:11] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 282/282 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 17/299 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-06-01 20:12:16] [INFO ] Deduced a trap composed of 29 places in 200 ms of which 4 ms to minimize.
[2024-06-01 20:12:17] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 3 ms to minimize.
[2024-06-01 20:12:17] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 3 ms to minimize.
[2024-06-01 20:12:17] [INFO ] Deduced a trap composed of 35 places in 178 ms of which 3 ms to minimize.
[2024-06-01 20:12:17] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 3 ms to minimize.
[2024-06-01 20:12:17] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 3 ms to minimize.
[2024-06-01 20:12:18] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 3 ms to minimize.
[2024-06-01 20:12:18] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 4 ms to minimize.
[2024-06-01 20:12:18] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 3 ms to minimize.
[2024-06-01 20:12:18] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 3 ms to minimize.
[2024-06-01 20:12:18] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 3 ms to minimize.
[2024-06-01 20:12:18] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 3 ms to minimize.
[2024-06-01 20:12:19] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 14 ms to minimize.
[2024-06-01 20:12:19] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 3 ms to minimize.
[2024-06-01 20:12:19] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 2 ms to minimize.
[2024-06-01 20:12:19] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 3 ms to minimize.
[2024-06-01 20:12:19] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 3 ms to minimize.
[2024-06-01 20:12:19] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 3 ms to minimize.
[2024-06-01 20:12:20] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:12:20] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 20/319 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-06-01 20:12:20] [INFO ] Deduced a trap composed of 20 places in 204 ms of which 4 ms to minimize.
[2024-06-01 20:12:20] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 3 ms to minimize.
[2024-06-01 20:12:21] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 3 ms to minimize.
[2024-06-01 20:12:21] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 3 ms to minimize.
[2024-06-01 20:12:21] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 3 ms to minimize.
[2024-06-01 20:12:21] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 3 ms to minimize.
[2024-06-01 20:12:21] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 3 ms to minimize.
[2024-06-01 20:12:22] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 3 ms to minimize.
[2024-06-01 20:12:22] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 3 ms to minimize.
[2024-06-01 20:12:22] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 3 ms to minimize.
[2024-06-01 20:12:22] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 3 ms to minimize.
[2024-06-01 20:12:22] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 3 ms to minimize.
[2024-06-01 20:12:22] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 2 ms to minimize.
[2024-06-01 20:12:23] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 3 ms to minimize.
[2024-06-01 20:12:23] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 2 ms to minimize.
[2024-06-01 20:12:23] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 2 ms to minimize.
[2024-06-01 20:12:23] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 3 ms to minimize.
[2024-06-01 20:12:23] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:12:23] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 5 ms to minimize.
[2024-06-01 20:12:23] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 20/339 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-06-01 20:12:28] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 2 ms to minimize.
[2024-06-01 20:12:29] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:12:29] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 3 ms to minimize.
[2024-06-01 20:12:29] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 3 ms to minimize.
[2024-06-01 20:12:29] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 2 ms to minimize.
[2024-06-01 20:12:29] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:12:29] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:12:29] [INFO ] Deduced a trap composed of 56 places in 135 ms of which 2 ms to minimize.
[2024-06-01 20:12:30] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 3 ms to minimize.
[2024-06-01 20:12:30] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 3 ms to minimize.
[2024-06-01 20:12:30] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-06-01 20:12:30] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-06-01 20:12:30] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
[2024-06-01 20:12:30] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 2 ms to minimize.
[2024-06-01 20:12:30] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
[2024-06-01 20:12:31] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 3 ms to minimize.
[2024-06-01 20:12:31] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 2 ms to minimize.
[2024-06-01 20:12:31] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 2 ms to minimize.
[2024-06-01 20:12:31] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:12:31] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 20/359 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-06-01 20:12:32] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 2 ms to minimize.
[2024-06-01 20:12:32] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 2 ms to minimize.
[2024-06-01 20:12:32] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:12:32] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
[2024-06-01 20:12:33] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 3 ms to minimize.
[2024-06-01 20:12:33] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 2 ms to minimize.
[2024-06-01 20:12:33] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 2 ms to minimize.
[2024-06-01 20:12:33] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 3 ms to minimize.
[2024-06-01 20:12:34] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 3 ms to minimize.
[2024-06-01 20:12:34] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-06-01 20:12:34] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 1 ms to minimize.
[2024-06-01 20:12:34] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-06-01 20:12:34] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-06-01 20:12:34] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 2 ms to minimize.
[2024-06-01 20:12:34] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 2 ms to minimize.
[2024-06-01 20:12:34] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 2 ms to minimize.
[2024-06-01 20:12:34] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2024-06-01 20:12:35] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 2 ms to minimize.
[2024-06-01 20:12:35] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
[2024-06-01 20:12:35] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 20/379 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-06-01 20:12:37] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2024-06-01 20:12:37] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-06-01 20:12:37] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 2 ms to minimize.
[2024-06-01 20:12:37] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 3 ms to minimize.
[2024-06-01 20:12:38] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 3 ms to minimize.
[2024-06-01 20:12:38] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:12:38] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 2 ms to minimize.
[2024-06-01 20:12:39] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-06-01 20:12:39] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 2 ms to minimize.
[2024-06-01 20:12:39] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:12:39] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 2 ms to minimize.
[2024-06-01 20:12:39] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:12:39] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 3 ms to minimize.
[2024-06-01 20:12:39] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 3 ms to minimize.
[2024-06-01 20:12:40] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 2 ms to minimize.
[2024-06-01 20:12:40] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 2 ms to minimize.
[2024-06-01 20:12:40] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 3 ms to minimize.
[2024-06-01 20:12:40] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:12:40] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 2 ms to minimize.
[2024-06-01 20:12:41] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 20/399 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 282/858 variables, and 399 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30040 ms.
Refiners :[Domain max(s): 282/282 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/282 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 282/282 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 17/299 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 100/399 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-06-01 20:12:46] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 2 ms to minimize.
[2024-06-01 20:12:46] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:12:46] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 2 ms to minimize.
[2024-06-01 20:12:46] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:12:46] [INFO ] Deduced a trap composed of 50 places in 137 ms of which 2 ms to minimize.
[2024-06-01 20:12:46] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 3 ms to minimize.
[2024-06-01 20:12:47] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:12:47] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 3 ms to minimize.
[2024-06-01 20:12:47] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 3 ms to minimize.
[2024-06-01 20:12:47] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 2 ms to minimize.
[2024-06-01 20:12:47] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 3 ms to minimize.
[2024-06-01 20:12:48] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 4 ms to minimize.
[2024-06-01 20:12:48] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 4 ms to minimize.
[2024-06-01 20:12:48] [INFO ] Deduced a trap composed of 18 places in 251 ms of which 4 ms to minimize.
[2024-06-01 20:12:49] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 2 ms to minimize.
[2024-06-01 20:12:49] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:12:49] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 3 ms to minimize.
[2024-06-01 20:12:49] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 3 ms to minimize.
[2024-06-01 20:12:50] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 3 ms to minimize.
[2024-06-01 20:12:50] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 20/419 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-06-01 20:12:54] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 4 ms to minimize.
[2024-06-01 20:12:54] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:12:55] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-06-01 20:12:55] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 3 ms to minimize.
[2024-06-01 20:12:55] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 3 ms to minimize.
[2024-06-01 20:12:55] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
[2024-06-01 20:12:55] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 3 ms to minimize.
[2024-06-01 20:12:55] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:12:55] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 1 ms to minimize.
[2024-06-01 20:12:56] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 2 ms to minimize.
[2024-06-01 20:12:56] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 3 ms to minimize.
[2024-06-01 20:12:56] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 2 ms to minimize.
[2024-06-01 20:12:57] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 4 ms to minimize.
[2024-06-01 20:12:57] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:12:57] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:12:58] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 3 ms to minimize.
[2024-06-01 20:12:58] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 3 ms to minimize.
[2024-06-01 20:12:58] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 3 ms to minimize.
[2024-06-01 20:12:59] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 3 ms to minimize.
[2024-06-01 20:12:59] [INFO ] Deduced a trap composed of 42 places in 227 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 20/439 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-06-01 20:13:11] [INFO ] Deduced a trap composed of 24 places in 248 ms of which 4 ms to minimize.
[2024-06-01 20:13:11] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 4 ms to minimize.
[2024-06-01 20:13:11] [INFO ] Deduced a trap composed of 26 places in 259 ms of which 3 ms to minimize.
[2024-06-01 20:13:12] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 3 ms to minimize.
SMT process timed out in 60458ms, After SMT, problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60472ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61799 ms. Remains : 282/282 places, 696/696 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[p0, p0]
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[p0, p0]
Stuttering acceptance computed with spot in 99 ms :[p0, p0]
Stuttering acceptance computed with spot in 97 ms :[p0, p0]
Product exploration explored 100000 steps with 8 reset in 393 ms.
Stack based approach found an accepted trace after 28 steps with 2 reset with depth 14 and stack size 14 in 0 ms.
FORMULA Peterson-PT-5-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLCardinality-06 finished in 64449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 186 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 830 transition count 1092
Reduce places removed 150 places and 0 transitions.
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Iterating post reduction 1 with 300 rules applied. Total rules applied 450 place count 680 transition count 942
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 600 place count 530 transition count 942
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 600 place count 530 transition count 888
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 708 place count 476 transition count 888
Applied a total of 708 rules in 72 ms. Remains 476 /830 variables (removed 354) and now considering 888/1242 (removed 354) transitions.
[2024-06-01 20:13:13] [INFO ] Flow matrix only has 768 transitions (discarded 120 similar events)
// Phase 1: matrix 768 rows 476 cols
[2024-06-01 20:13:13] [INFO ] Computed 19 invariants in 5 ms
[2024-06-01 20:13:13] [INFO ] Implicit Places using invariants in 645 ms returned [450, 451]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 647 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 474/830 places, 888/1242 transitions.
Applied a total of 0 rules in 19 ms. Remains 474 /474 variables (removed 0) and now considering 888/888 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 740 ms. Remains : 474/830 places, 888/1242 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 123 steps with 0 reset in 2 ms.
FORMULA Peterson-PT-5-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-5-LTLCardinality-07 finished in 922 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 358 transitions
Trivial Post-agglo rules discarded 358 transitions
Performed 358 trivial Post agglomeration. Transition count delta: 358
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 830 transition count 884
Reduce places removed 358 places and 0 transitions.
Iterating post reduction 1 with 358 rules applied. Total rules applied 716 place count 472 transition count 884
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 716 place count 472 transition count 704
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1076 place count 292 transition count 704
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1136 place count 262 transition count 674
Applied a total of 1136 rules in 61 ms. Remains 262 /830 variables (removed 568) and now considering 674/1242 (removed 568) transitions.
[2024-06-01 20:13:14] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 262 cols
[2024-06-01 20:13:14] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 20:13:14] [INFO ] Implicit Places using invariants in 536 ms returned [241, 242]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 540 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 260/830 places, 674/1242 transitions.
Applied a total of 0 rules in 9 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 612 ms. Remains : 260/830 places, 674/1242 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 261 ms.
Product exploration explored 100000 steps with 0 reset in 408 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 236 ms. (168 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 925351 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :0 out of 1
Probabilistic random walk after 925351 steps, saw 135314 distinct states, run finished after 3001 ms. (steps per millisecond=308 ) properties seen :0
[2024-06-01 20:13:18] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2024-06-01 20:13:18] [INFO ] Computed 17 invariants in 5 ms
[2024-06-01 20:13:18] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 39/41 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 39/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/78 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 37/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 186/264 variables, 78/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 30/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 130/394 variables, 30/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 30/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 5/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 220/614 variables, 40/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/614 variables, 40/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/614 variables, 175/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/614 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 108/722 variables, 4/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/722 variables, 108/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/722 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/726 variables, 4/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/726 variables, 4/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/726 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 88/814 variables, 112/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/814 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/814 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 814/814 variables, and 742 constraints, problems are : Problem set: 0 solved, 1 unsolved in 359 ms.
Refiners :[Domain max(s): 260/260 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 260/260 constraints, ReadFeed: 205/205 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/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 39/41 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 39/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/78 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 37/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 186/264 variables, 78/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 30/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 130/394 variables, 30/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 30/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 5/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/394 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 220/614 variables, 40/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/614 variables, 40/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/614 variables, 175/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:13:19] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/614 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/614 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 108/722 variables, 4/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/722 variables, 108/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:13:20] [INFO ] Deduced a trap composed of 16 places in 313 ms of which 4 ms to minimize.
[2024-06-01 20:13:20] [INFO ] Deduced a trap composed of 11 places in 272 ms of which 4 ms to minimize.
[2024-06-01 20:13:20] [INFO ] Deduced a trap composed of 9 places in 287 ms of which 4 ms to minimize.
[2024-06-01 20:13:20] [INFO ] Deduced a trap composed of 9 places in 280 ms of which 4 ms to minimize.
[2024-06-01 20:13:21] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 4 ms to minimize.
[2024-06-01 20:13:21] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 4 ms to minimize.
[2024-06-01 20:13:21] [INFO ] Deduced a trap composed of 25 places in 211 ms of which 3 ms to minimize.
[2024-06-01 20:13:21] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 3 ms to minimize.
[2024-06-01 20:13:21] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/722 variables, 9/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/722 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/726 variables, 4/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/726 variables, 4/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/726 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 88/814 variables, 112/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:13:22] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 3 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/814 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/814 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/814 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 814/814 variables, and 754 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3211 ms.
Refiners :[Domain max(s): 260/260 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 260/260 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 3588ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 674/674 transitions.
Applied a total of 0 rules in 19 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 260/260 places, 674/674 transitions.
RANDOM walk for 40000 steps (8 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1056755 steps, run timeout after 3001 ms. (steps per millisecond=352 ) properties seen :0 out of 1
Probabilistic random walk after 1056755 steps, saw 153674 distinct states, run finished after 3004 ms. (steps per millisecond=351 ) properties seen :0
[2024-06-01 20:13:25] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
[2024-06-01 20:13:25] [INFO ] Invariant cache hit.
[2024-06-01 20:13:25] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 39/41 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 39/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/78 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 37/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 186/264 variables, 78/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 30/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 130/394 variables, 30/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 30/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 5/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 220/614 variables, 40/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/614 variables, 40/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/614 variables, 175/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/614 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 108/722 variables, 4/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/722 variables, 108/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/722 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/726 variables, 4/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/726 variables, 4/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/726 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 88/814 variables, 112/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/814 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/814 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 814/814 variables, and 742 constraints, problems are : Problem set: 0 solved, 1 unsolved in 325 ms.
Refiners :[Domain max(s): 260/260 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 260/260 constraints, ReadFeed: 205/205 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/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 39/41 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 39/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/78 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 37/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 186/264 variables, 78/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 30/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 130/394 variables, 30/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 30/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 5/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/394 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 220/614 variables, 40/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/614 variables, 40/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/614 variables, 175/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/614 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 108/722 variables, 4/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/722 variables, 108/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:13:26] [INFO ] Deduced a trap composed of 21 places in 298 ms of which 5 ms to minimize.
[2024-06-01 20:13:26] [INFO ] Deduced a trap composed of 12 places in 270 ms of which 4 ms to minimize.
[2024-06-01 20:13:27] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 3 ms to minimize.
[2024-06-01 20:13:27] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 4 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/722 variables, 4/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/722 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 4/726 variables, 4/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/726 variables, 4/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/726 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 88/814 variables, 112/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/814 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/814 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 814/814 variables, and 747 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1766 ms.
Refiners :[Domain max(s): 260/260 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 260/260 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 2104ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 674/674 transitions.
Applied a total of 0 rules in 16 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 260/260 places, 674/674 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 674/674 transitions.
Applied a total of 0 rules in 16 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
[2024-06-01 20:13:27] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
[2024-06-01 20:13:27] [INFO ] Invariant cache hit.
[2024-06-01 20:13:28] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-06-01 20:13:28] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
[2024-06-01 20:13:28] [INFO ] Invariant cache hit.
[2024-06-01 20:13:28] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:13:29] [INFO ] Implicit Places using invariants and state equation in 1476 ms returned []
Implicit Place search using SMT with State Equation took 1954 ms to find 0 implicit places.
[2024-06-01 20:13:29] [INFO ] Redundant transitions in 15 ms returned []
Running 668 sub problems to find dead transitions.
[2024-06-01 20:13:29] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
[2024-06-01 20:13:29] [INFO ] Invariant cache hit.
[2024-06-01 20:13:29] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 260/260 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 17/277 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 20:13:37] [INFO ] Deduced a trap composed of 26 places in 308 ms of which 5 ms to minimize.
[2024-06-01 20:13:37] [INFO ] Deduced a trap composed of 19 places in 294 ms of which 4 ms to minimize.
[2024-06-01 20:13:37] [INFO ] Deduced a trap composed of 35 places in 292 ms of which 4 ms to minimize.
[2024-06-01 20:13:38] [INFO ] Deduced a trap composed of 12 places in 278 ms of which 3 ms to minimize.
[2024-06-01 20:13:38] [INFO ] Deduced a trap composed of 9 places in 277 ms of which 4 ms to minimize.
[2024-06-01 20:13:38] [INFO ] Deduced a trap composed of 52 places in 259 ms of which 4 ms to minimize.
[2024-06-01 20:13:39] [INFO ] Deduced a trap composed of 33 places in 266 ms of which 4 ms to minimize.
[2024-06-01 20:13:39] [INFO ] Deduced a trap composed of 19 places in 322 ms of which 5 ms to minimize.
[2024-06-01 20:13:39] [INFO ] Deduced a trap composed of 34 places in 306 ms of which 4 ms to minimize.
[2024-06-01 20:13:40] [INFO ] Deduced a trap composed of 9 places in 325 ms of which 4 ms to minimize.
[2024-06-01 20:13:40] [INFO ] Deduced a trap composed of 45 places in 336 ms of which 4 ms to minimize.
[2024-06-01 20:13:40] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 4 ms to minimize.
[2024-06-01 20:13:40] [INFO ] Deduced a trap composed of 9 places in 279 ms of which 4 ms to minimize.
[2024-06-01 20:13:41] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 3 ms to minimize.
[2024-06-01 20:13:41] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 3 ms to minimize.
[2024-06-01 20:13:41] [INFO ] Deduced a trap composed of 35 places in 253 ms of which 4 ms to minimize.
[2024-06-01 20:13:41] [INFO ] Deduced a trap composed of 26 places in 293 ms of which 4 ms to minimize.
[2024-06-01 20:13:42] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 2 ms to minimize.
[2024-06-01 20:13:42] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 2 ms to minimize.
[2024-06-01 20:13:42] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 20/297 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 20:13:42] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 3 ms to minimize.
[2024-06-01 20:13:43] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 4 ms to minimize.
[2024-06-01 20:13:43] [INFO ] Deduced a trap composed of 17 places in 274 ms of which 4 ms to minimize.
[2024-06-01 20:13:43] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-06-01 20:13:43] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 2 ms to minimize.
[2024-06-01 20:13:43] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 3 ms to minimize.
[2024-06-01 20:13:44] [INFO ] Deduced a trap composed of 33 places in 212 ms of which 4 ms to minimize.
[2024-06-01 20:13:44] [INFO ] Deduced a trap composed of 20 places in 201 ms of which 4 ms to minimize.
[2024-06-01 20:13:44] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 3 ms to minimize.
[2024-06-01 20:13:44] [INFO ] Deduced a trap composed of 40 places in 177 ms of which 5 ms to minimize.
[2024-06-01 20:13:44] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 3 ms to minimize.
[2024-06-01 20:13:45] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 2 ms to minimize.
[2024-06-01 20:13:45] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-06-01 20:13:45] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 3 ms to minimize.
[2024-06-01 20:13:45] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:13:45] [INFO ] Deduced a trap composed of 27 places in 206 ms of which 3 ms to minimize.
[2024-06-01 20:13:45] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 2 ms to minimize.
[2024-06-01 20:13:46] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 2 ms to minimize.
[2024-06-01 20:13:46] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 2 ms to minimize.
[2024-06-01 20:13:46] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 20/317 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 20:13:51] [INFO ] Deduced a trap composed of 16 places in 200 ms of which 3 ms to minimize.
[2024-06-01 20:13:52] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 3 ms to minimize.
[2024-06-01 20:13:52] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 3 ms to minimize.
[2024-06-01 20:13:52] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 2 ms to minimize.
[2024-06-01 20:13:52] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-06-01 20:13:52] [INFO ] Deduced a trap composed of 9 places in 288 ms of which 4 ms to minimize.
[2024-06-01 20:13:53] [INFO ] Deduced a trap composed of 40 places in 232 ms of which 5 ms to minimize.
[2024-06-01 20:13:53] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-06-01 20:13:53] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 3 ms to minimize.
[2024-06-01 20:13:53] [INFO ] Deduced a trap composed of 51 places in 209 ms of which 3 ms to minimize.
[2024-06-01 20:13:53] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 4 ms to minimize.
[2024-06-01 20:13:54] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 3 ms to minimize.
[2024-06-01 20:13:54] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 4 ms to minimize.
[2024-06-01 20:13:54] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 3 ms to minimize.
[2024-06-01 20:13:55] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 3 ms to minimize.
[2024-06-01 20:13:55] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 4 ms to minimize.
[2024-06-01 20:13:55] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 3 ms to minimize.
[2024-06-01 20:13:55] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:13:55] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2024-06-01 20:13:55] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 20/337 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 20:13:56] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 3 ms to minimize.
[2024-06-01 20:13:57] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 3 ms to minimize.
[2024-06-01 20:13:57] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 2 ms to minimize.
[2024-06-01 20:13:57] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 3 ms to minimize.
[2024-06-01 20:13:57] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 2 ms to minimize.
[2024-06-01 20:13:57] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 2 ms to minimize.
[2024-06-01 20:13:58] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 4 ms to minimize.
[2024-06-01 20:13:58] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 2 ms to minimize.
[2024-06-01 20:13:59] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 3 ms to minimize.
[2024-06-01 20:13:59] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-06-01 20:13:59] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-06-01 20:13:59] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 3 ms to minimize.
[2024-06-01 20:13:59] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 3 ms to minimize.
[2024-06-01 20:13:59] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 3 ms to minimize.
[2024-06-01 20:13:59] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 2 ms to minimize.
[2024-06-01 20:14:00] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 3 ms to minimize.
[2024-06-01 20:14:00] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 3 ms to minimize.
SMT process timed out in 30499ms, After SMT, problems are : Problem set: 0 solved, 668 unsolved
Search for dead transitions found 0 dead transitions in 30516ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32517 ms. Remains : 260/260 places, 674/674 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 510 edges and 260 vertex of which 176 / 260 are part of one of the 30 SCC in 6 ms
Free SCC test removed 146 places
Drop transitions (Empty/Sink Transition effects.) removed 292 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 441 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 114 transition count 204
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 85 transition count 204
Performed 4 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 67 place count 81 transition count 197
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 17 rules applied. Total rules applied 84 place count 70 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 36 edges and 70 vertex of which 30 / 70 are part of one of the 5 SCC in 0 ms
Free SCC test removed 25 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 86 place count 45 transition count 196
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (trivial) has 106 edges and 41 vertex of which 20 / 41 are part of one of the 5 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 1 with 35 rules applied. Total rules applied 121 place count 26 transition count 166
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 2 with 123 rules applied. Total rules applied 244 place count 26 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 247 place count 26 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 248 place count 26 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 249 place count 25 transition count 39
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 250 place count 25 transition count 39
Applied a total of 250 rules in 58 ms. Remains 25 /260 variables (removed 235) and now considering 39/674 (removed 635) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 39 rows 25 cols
[2024-06-01 20:14:00] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 20:14:00] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 20:14:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 20:14:00] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 20:14:00] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 20:14:00] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 240 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Support contains 2 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 674/674 transitions.
Applied a total of 0 rules in 25 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
[2024-06-01 20:14:00] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2024-06-01 20:14:00] [INFO ] Computed 17 invariants in 2 ms
[2024-06-01 20:14:01] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-06-01 20:14:01] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
[2024-06-01 20:14:01] [INFO ] Invariant cache hit.
[2024-06-01 20:14:01] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:14:02] [INFO ] Implicit Places using invariants and state equation in 1310 ms returned []
Implicit Place search using SMT with State Equation took 1742 ms to find 0 implicit places.
[2024-06-01 20:14:02] [INFO ] Redundant transitions in 5 ms returned []
Running 668 sub problems to find dead transitions.
[2024-06-01 20:14:02] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
[2024-06-01 20:14:02] [INFO ] Invariant cache hit.
[2024-06-01 20:14:02] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 260/260 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 17/277 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 20:14:09] [INFO ] Deduced a trap composed of 26 places in 293 ms of which 5 ms to minimize.
[2024-06-01 20:14:10] [INFO ] Deduced a trap composed of 19 places in 281 ms of which 4 ms to minimize.
[2024-06-01 20:14:10] [INFO ] Deduced a trap composed of 35 places in 257 ms of which 4 ms to minimize.
[2024-06-01 20:14:10] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 2 ms to minimize.
[2024-06-01 20:14:10] [INFO ] Deduced a trap composed of 9 places in 265 ms of which 4 ms to minimize.
[2024-06-01 20:14:11] [INFO ] Deduced a trap composed of 52 places in 271 ms of which 4 ms to minimize.
[2024-06-01 20:14:11] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 4 ms to minimize.
[2024-06-01 20:14:11] [INFO ] Deduced a trap composed of 19 places in 295 ms of which 4 ms to minimize.
[2024-06-01 20:14:12] [INFO ] Deduced a trap composed of 34 places in 314 ms of which 5 ms to minimize.
[2024-06-01 20:14:12] [INFO ] Deduced a trap composed of 9 places in 301 ms of which 4 ms to minimize.
[2024-06-01 20:14:12] [INFO ] Deduced a trap composed of 45 places in 296 ms of which 4 ms to minimize.
[2024-06-01 20:14:12] [INFO ] Deduced a trap composed of 23 places in 314 ms of which 4 ms to minimize.
[2024-06-01 20:14:13] [INFO ] Deduced a trap composed of 9 places in 306 ms of which 4 ms to minimize.
[2024-06-01 20:14:13] [INFO ] Deduced a trap composed of 9 places in 303 ms of which 4 ms to minimize.
[2024-06-01 20:14:13] [INFO ] Deduced a trap composed of 17 places in 267 ms of which 4 ms to minimize.
[2024-06-01 20:14:14] [INFO ] Deduced a trap composed of 35 places in 277 ms of which 4 ms to minimize.
[2024-06-01 20:14:14] [INFO ] Deduced a trap composed of 26 places in 292 ms of which 4 ms to minimize.
[2024-06-01 20:14:14] [INFO ] Deduced a trap composed of 40 places in 278 ms of which 4 ms to minimize.
[2024-06-01 20:14:15] [INFO ] Deduced a trap composed of 16 places in 276 ms of which 4 ms to minimize.
[2024-06-01 20:14:15] [INFO ] Deduced a trap composed of 17 places in 262 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 20/297 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 20:14:15] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 3 ms to minimize.
[2024-06-01 20:14:16] [INFO ] Deduced a trap composed of 23 places in 272 ms of which 4 ms to minimize.
[2024-06-01 20:14:16] [INFO ] Deduced a trap composed of 17 places in 251 ms of which 3 ms to minimize.
[2024-06-01 20:14:16] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 3 ms to minimize.
[2024-06-01 20:14:16] [INFO ] Deduced a trap composed of 26 places in 255 ms of which 4 ms to minimize.
[2024-06-01 20:14:17] [INFO ] Deduced a trap composed of 18 places in 277 ms of which 3 ms to minimize.
[2024-06-01 20:14:17] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 2 ms to minimize.
[2024-06-01 20:14:17] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 3 ms to minimize.
[2024-06-01 20:14:17] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-06-01 20:14:17] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 1 ms to minimize.
[2024-06-01 20:14:17] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-06-01 20:14:18] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-06-01 20:14:18] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-06-01 20:14:18] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:14:18] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
[2024-06-01 20:14:18] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:14:18] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 3 ms to minimize.
[2024-06-01 20:14:18] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:14:19] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 3 ms to minimize.
[2024-06-01 20:14:19] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 20/317 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 20:14:25] [INFO ] Deduced a trap composed of 16 places in 293 ms of which 4 ms to minimize.
[2024-06-01 20:14:25] [INFO ] Deduced a trap composed of 9 places in 273 ms of which 4 ms to minimize.
[2024-06-01 20:14:25] [INFO ] Deduced a trap composed of 34 places in 233 ms of which 4 ms to minimize.
[2024-06-01 20:14:25] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-06-01 20:14:25] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 3 ms to minimize.
[2024-06-01 20:14:26] [INFO ] Deduced a trap composed of 9 places in 294 ms of which 4 ms to minimize.
[2024-06-01 20:14:26] [INFO ] Deduced a trap composed of 40 places in 265 ms of which 4 ms to minimize.
[2024-06-01 20:14:26] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-06-01 20:14:26] [INFO ] Deduced a trap composed of 18 places in 250 ms of which 3 ms to minimize.
[2024-06-01 20:14:27] [INFO ] Deduced a trap composed of 51 places in 242 ms of which 4 ms to minimize.
[2024-06-01 20:14:27] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 3 ms to minimize.
[2024-06-01 20:14:27] [INFO ] Deduced a trap composed of 16 places in 211 ms of which 4 ms to minimize.
[2024-06-01 20:14:28] [INFO ] Deduced a trap composed of 37 places in 226 ms of which 4 ms to minimize.
[2024-06-01 20:14:28] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 3 ms to minimize.
[2024-06-01 20:14:28] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 2 ms to minimize.
[2024-06-01 20:14:28] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 3 ms to minimize.
[2024-06-01 20:14:29] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 3 ms to minimize.
[2024-06-01 20:14:29] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 3 ms to minimize.
[2024-06-01 20:14:29] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:14:29] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 20/337 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 20:14:30] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:14:30] [INFO ] Deduced a trap composed of 25 places in 271 ms of which 4 ms to minimize.
[2024-06-01 20:14:31] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 4 ms to minimize.
[2024-06-01 20:14:31] [INFO ] Deduced a trap composed of 20 places in 249 ms of which 4 ms to minimize.
[2024-06-01 20:14:31] [INFO ] Deduced a trap composed of 47 places in 245 ms of which 3 ms to minimize.
[2024-06-01 20:14:31] [INFO ] Deduced a trap composed of 20 places in 249 ms of which 4 ms to minimize.
[2024-06-01 20:14:32] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 4 ms to minimize.
[2024-06-01 20:14:32] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 260/814 variables, and 345 constraints, problems are : Problem set: 0 solved, 668 unsolved in 30035 ms.
Refiners :[Domain max(s): 260/260 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/260 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 668/668 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 0 solved, 668 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 260/260 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 17/277 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 68/345 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 20:14:35] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 4 ms to minimize.
[2024-06-01 20:14:35] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-06-01 20:14:36] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 3 ms to minimize.
[2024-06-01 20:14:36] [INFO ] Deduced a trap composed of 19 places in 250 ms of which 3 ms to minimize.
[2024-06-01 20:14:36] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 3 ms to minimize.
[2024-06-01 20:14:37] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 3 ms to minimize.
[2024-06-01 20:14:37] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:14:37] [INFO ] Deduced a trap composed of 18 places in 234 ms of which 4 ms to minimize.
[2024-06-01 20:14:37] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 4 ms to minimize.
[2024-06-01 20:14:38] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 3 ms to minimize.
[2024-06-01 20:14:38] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 2 ms to minimize.
[2024-06-01 20:14:38] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 3 ms to minimize.
[2024-06-01 20:14:38] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 3 ms to minimize.
[2024-06-01 20:14:38] [INFO ] Deduced a trap composed of 63 places in 191 ms of which 3 ms to minimize.
[2024-06-01 20:14:39] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 3 ms to minimize.
[2024-06-01 20:14:39] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 3 ms to minimize.
[2024-06-01 20:14:39] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:14:39] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 1 ms to minimize.
[2024-06-01 20:14:39] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:14:39] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 20/365 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 20:14:41] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 3 ms to minimize.
[2024-06-01 20:14:41] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 3 ms to minimize.
[2024-06-01 20:14:41] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 3 ms to minimize.
[2024-06-01 20:14:42] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 3 ms to minimize.
[2024-06-01 20:14:42] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 3 ms to minimize.
[2024-06-01 20:14:42] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 2 ms to minimize.
[2024-06-01 20:14:42] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:14:42] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 3 ms to minimize.
[2024-06-01 20:14:43] [INFO ] Deduced a trap composed of 59 places in 209 ms of which 3 ms to minimize.
[2024-06-01 20:14:43] [INFO ] Deduced a trap composed of 17 places in 234 ms of which 4 ms to minimize.
[2024-06-01 20:14:44] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 3 ms to minimize.
[2024-06-01 20:14:44] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:14:44] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 2 ms to minimize.
[2024-06-01 20:14:44] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 2 ms to minimize.
[2024-06-01 20:14:44] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 3 ms to minimize.
[2024-06-01 20:14:45] [INFO ] Deduced a trap composed of 53 places in 120 ms of which 3 ms to minimize.
[2024-06-01 20:14:45] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 3 ms to minimize.
[2024-06-01 20:14:45] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 2 ms to minimize.
[2024-06-01 20:14:45] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 3 ms to minimize.
[2024-06-01 20:14:45] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 20/385 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 20:14:48] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 3 ms to minimize.
[2024-06-01 20:14:48] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 3 ms to minimize.
[2024-06-01 20:14:49] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 7 ms to minimize.
[2024-06-01 20:14:49] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 4 ms to minimize.
[2024-06-01 20:14:49] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 3 ms to minimize.
[2024-06-01 20:14:49] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 3 ms to minimize.
[2024-06-01 20:14:50] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 3 ms to minimize.
[2024-06-01 20:14:50] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 3 ms to minimize.
[2024-06-01 20:14:50] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 3 ms to minimize.
[2024-06-01 20:14:50] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 4 ms to minimize.
[2024-06-01 20:14:51] [INFO ] Deduced a trap composed of 43 places in 193 ms of which 3 ms to minimize.
[2024-06-01 20:14:51] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 2 ms to minimize.
[2024-06-01 20:14:51] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:14:51] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 3 ms to minimize.
[2024-06-01 20:14:52] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-06-01 20:14:52] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 3 ms to minimize.
[2024-06-01 20:14:52] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 3 ms to minimize.
[2024-06-01 20:14:52] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 2 ms to minimize.
[2024-06-01 20:14:52] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-06-01 20:14:52] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 20/405 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 20:14:56] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-06-01 20:14:56] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 3 ms to minimize.
[2024-06-01 20:14:57] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 3 ms to minimize.
[2024-06-01 20:14:57] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:14:57] [INFO ] Deduced a trap composed of 51 places in 195 ms of which 4 ms to minimize.
[2024-06-01 20:14:57] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 4 ms to minimize.
[2024-06-01 20:14:57] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 3 ms to minimize.
[2024-06-01 20:14:58] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:14:58] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:14:59] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 2 ms to minimize.
[2024-06-01 20:14:59] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 3 ms to minimize.
[2024-06-01 20:14:59] [INFO ] Deduced a trap composed of 39 places in 231 ms of which 4 ms to minimize.
[2024-06-01 20:14:59] [INFO ] Deduced a trap composed of 10 places in 276 ms of which 4 ms to minimize.
[2024-06-01 20:15:00] [INFO ] Deduced a trap composed of 13 places in 278 ms of which 4 ms to minimize.
[2024-06-01 20:15:00] [INFO ] Deduced a trap composed of 11 places in 265 ms of which 4 ms to minimize.
[2024-06-01 20:15:00] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 2 ms to minimize.
[2024-06-01 20:15:01] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 3 ms to minimize.
[2024-06-01 20:15:01] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 3 ms to minimize.
[2024-06-01 20:15:01] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-06-01 20:15:02] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 20/425 constraints. Problems are: Problem set: 0 solved, 668 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 260/814 variables, and 425 constraints, problems are : Problem set: 0 solved, 668 unsolved in 30031 ms.
Refiners :[Domain max(s): 260/260 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/260 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/668 constraints, Known Traps: 148/148 constraints]
After SMT, in 60475ms problems are : Problem set: 0 solved, 668 unsolved
Search for dead transitions found 0 dead transitions in 60485ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62269 ms. Remains : 260/260 places, 674/674 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 776006 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :0 out of 1
Probabilistic random walk after 776006 steps, saw 114251 distinct states, run finished after 3002 ms. (steps per millisecond=258 ) properties seen :0
[2024-06-01 20:15:06] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
[2024-06-01 20:15:06] [INFO ] Invariant cache hit.
[2024-06-01 20:15:06] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 39/41 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 39/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/78 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 37/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 186/264 variables, 78/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 30/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 130/394 variables, 30/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 30/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 5/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 220/614 variables, 40/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/614 variables, 40/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/614 variables, 175/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/614 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 108/722 variables, 4/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/722 variables, 108/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/722 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/726 variables, 4/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/726 variables, 4/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/726 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 88/814 variables, 112/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/814 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/814 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 814/814 variables, and 742 constraints, problems are : Problem set: 0 solved, 1 unsolved in 356 ms.
Refiners :[Domain max(s): 260/260 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 260/260 constraints, ReadFeed: 205/205 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/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 39/41 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 39/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/78 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 37/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 186/264 variables, 78/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 30/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 130/394 variables, 30/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 30/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 5/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/394 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 220/614 variables, 40/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/614 variables, 40/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/614 variables, 175/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/614 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 108/722 variables, 4/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/722 variables, 108/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:15:07] [INFO ] Deduced a trap composed of 21 places in 306 ms of which 4 ms to minimize.
[2024-06-01 20:15:07] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 4 ms to minimize.
[2024-06-01 20:15:07] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 3 ms to minimize.
[2024-06-01 20:15:08] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/722 variables, 4/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/722 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 4/726 variables, 4/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/726 variables, 4/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/726 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 88/814 variables, 112/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/814 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/814 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 814/814 variables, and 747 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1740 ms.
Refiners :[Domain max(s): 260/260 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 260/260 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 2109ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 674/674 transitions.
Applied a total of 0 rules in 22 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 260/260 places, 674/674 transitions.
RANDOM walk for 40000 steps (8 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 871031 steps, run timeout after 3001 ms. (steps per millisecond=290 ) properties seen :0 out of 1
Probabilistic random walk after 871031 steps, saw 127023 distinct states, run finished after 3001 ms. (steps per millisecond=290 ) properties seen :0
[2024-06-01 20:15:11] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
[2024-06-01 20:15:11] [INFO ] Invariant cache hit.
[2024-06-01 20:15:11] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 39/41 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 39/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/78 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 37/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 186/264 variables, 78/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 30/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 130/394 variables, 30/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 30/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 5/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 220/614 variables, 40/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/614 variables, 40/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/614 variables, 175/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/614 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 108/722 variables, 4/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/722 variables, 108/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/722 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/726 variables, 4/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/726 variables, 4/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/726 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 88/814 variables, 112/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/814 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/814 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 814/814 variables, and 742 constraints, problems are : Problem set: 0 solved, 1 unsolved in 529 ms.
Refiners :[Domain max(s): 260/260 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 260/260 constraints, ReadFeed: 205/205 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/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 39/41 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 39/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/78 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 37/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 186/264 variables, 78/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 30/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 130/394 variables, 30/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 30/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 5/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/394 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 220/614 variables, 40/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/614 variables, 40/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/614 variables, 175/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/614 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 108/722 variables, 4/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/722 variables, 108/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:15:12] [INFO ] Deduced a trap composed of 21 places in 305 ms of which 4 ms to minimize.
[2024-06-01 20:15:12] [INFO ] Deduced a trap composed of 12 places in 263 ms of which 3 ms to minimize.
[2024-06-01 20:15:13] [INFO ] Deduced a trap composed of 10 places in 247 ms of which 4 ms to minimize.
[2024-06-01 20:15:13] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/722 variables, 4/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/722 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 4/726 variables, 4/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/726 variables, 4/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/726 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 88/814 variables, 112/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/814 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/814 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 814/814 variables, and 747 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1756 ms.
Refiners :[Domain max(s): 260/260 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 260/260 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 2316ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 674/674 transitions.
Applied a total of 0 rules in 21 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 260/260 places, 674/674 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 674/674 transitions.
Applied a total of 0 rules in 21 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
[2024-06-01 20:15:13] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
[2024-06-01 20:15:13] [INFO ] Invariant cache hit.
[2024-06-01 20:15:14] [INFO ] Implicit Places using invariants in 574 ms returned []
[2024-06-01 20:15:14] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
[2024-06-01 20:15:14] [INFO ] Invariant cache hit.
[2024-06-01 20:15:14] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:15:15] [INFO ] Implicit Places using invariants and state equation in 1571 ms returned []
Implicit Place search using SMT with State Equation took 2152 ms to find 0 implicit places.
[2024-06-01 20:15:15] [INFO ] Redundant transitions in 8 ms returned []
Running 668 sub problems to find dead transitions.
[2024-06-01 20:15:15] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
[2024-06-01 20:15:15] [INFO ] Invariant cache hit.
[2024-06-01 20:15:15] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 260/260 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 17/277 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 20:15:22] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 3 ms to minimize.
[2024-06-01 20:15:22] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 2 ms to minimize.
[2024-06-01 20:15:22] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 3 ms to minimize.
[2024-06-01 20:15:22] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 2 ms to minimize.
[2024-06-01 20:15:23] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 4 ms to minimize.
[2024-06-01 20:15:23] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 2 ms to minimize.
[2024-06-01 20:15:23] [INFO ] Deduced a trap composed of 33 places in 235 ms of which 3 ms to minimize.
[2024-06-01 20:15:23] [INFO ] Deduced a trap composed of 19 places in 309 ms of which 4 ms to minimize.
[2024-06-01 20:15:24] [INFO ] Deduced a trap composed of 34 places in 286 ms of which 4 ms to minimize.
[2024-06-01 20:15:24] [INFO ] Deduced a trap composed of 9 places in 278 ms of which 4 ms to minimize.
[2024-06-01 20:15:24] [INFO ] Deduced a trap composed of 45 places in 290 ms of which 4 ms to minimize.
[2024-06-01 20:15:24] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 3 ms to minimize.
[2024-06-01 20:15:25] [INFO ] Deduced a trap composed of 9 places in 259 ms of which 4 ms to minimize.
[2024-06-01 20:15:25] [INFO ] Deduced a trap composed of 9 places in 285 ms of which 4 ms to minimize.
[2024-06-01 20:15:25] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 3 ms to minimize.
[2024-06-01 20:15:26] [INFO ] Deduced a trap composed of 35 places in 268 ms of which 4 ms to minimize.
[2024-06-01 20:15:26] [INFO ] Deduced a trap composed of 26 places in 275 ms of which 4 ms to minimize.
[2024-06-01 20:15:26] [INFO ] Deduced a trap composed of 40 places in 271 ms of which 3 ms to minimize.
[2024-06-01 20:15:26] [INFO ] Deduced a trap composed of 16 places in 277 ms of which 4 ms to minimize.
[2024-06-01 20:15:27] [INFO ] Deduced a trap composed of 17 places in 260 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 20/297 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 20:15:27] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 3 ms to minimize.
[2024-06-01 20:15:28] [INFO ] Deduced a trap composed of 23 places in 261 ms of which 3 ms to minimize.
[2024-06-01 20:15:28] [INFO ] Deduced a trap composed of 17 places in 259 ms of which 4 ms to minimize.
[2024-06-01 20:15:28] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 3 ms to minimize.
[2024-06-01 20:15:28] [INFO ] Deduced a trap composed of 26 places in 236 ms of which 3 ms to minimize.
[2024-06-01 20:15:29] [INFO ] Deduced a trap composed of 18 places in 254 ms of which 4 ms to minimize.
[2024-06-01 20:15:29] [INFO ] Deduced a trap composed of 33 places in 227 ms of which 4 ms to minimize.
[2024-06-01 20:15:29] [INFO ] Deduced a trap composed of 20 places in 218 ms of which 3 ms to minimize.
[2024-06-01 20:15:29] [INFO ] Deduced a trap composed of 34 places in 158 ms of which 3 ms to minimize.
[2024-06-01 20:15:29] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 3 ms to minimize.
[2024-06-01 20:15:30] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 3 ms to minimize.
[2024-06-01 20:15:30] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 2 ms to minimize.
[2024-06-01 20:15:30] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 3 ms to minimize.
[2024-06-01 20:15:30] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 3 ms to minimize.
[2024-06-01 20:15:30] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 4 ms to minimize.
[2024-06-01 20:15:31] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 3 ms to minimize.
[2024-06-01 20:15:31] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 4 ms to minimize.
[2024-06-01 20:15:31] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 3 ms to minimize.
[2024-06-01 20:15:32] [INFO ] Deduced a trap composed of 37 places in 204 ms of which 3 ms to minimize.
[2024-06-01 20:15:32] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 20/317 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 20:15:38] [INFO ] Deduced a trap composed of 16 places in 332 ms of which 5 ms to minimize.
[2024-06-01 20:15:39] [INFO ] Deduced a trap composed of 9 places in 300 ms of which 4 ms to minimize.
[2024-06-01 20:15:39] [INFO ] Deduced a trap composed of 34 places in 272 ms of which 3 ms to minimize.
[2024-06-01 20:15:39] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 2 ms to minimize.
[2024-06-01 20:15:39] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-06-01 20:15:39] [INFO ] Deduced a trap composed of 9 places in 309 ms of which 4 ms to minimize.
[2024-06-01 20:15:40] [INFO ] Deduced a trap composed of 40 places in 293 ms of which 4 ms to minimize.
[2024-06-01 20:15:40] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-06-01 20:15:40] [INFO ] Deduced a trap composed of 18 places in 271 ms of which 4 ms to minimize.
[2024-06-01 20:15:40] [INFO ] Deduced a trap composed of 51 places in 263 ms of which 4 ms to minimize.
[2024-06-01 20:15:41] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 3 ms to minimize.
[2024-06-01 20:15:41] [INFO ] Deduced a trap composed of 16 places in 228 ms of which 3 ms to minimize.
[2024-06-01 20:15:42] [INFO ] Deduced a trap composed of 37 places in 238 ms of which 3 ms to minimize.
[2024-06-01 20:15:42] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 2 ms to minimize.
[2024-06-01 20:15:42] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 2 ms to minimize.
[2024-06-01 20:15:42] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 3 ms to minimize.
[2024-06-01 20:15:42] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 2 ms to minimize.
[2024-06-01 20:15:43] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 2 ms to minimize.
[2024-06-01 20:15:43] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:15:43] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 20/337 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 20:15:44] [INFO ] Deduced a trap composed of 30 places in 193 ms of which 3 ms to minimize.
[2024-06-01 20:15:44] [INFO ] Deduced a trap composed of 25 places in 275 ms of which 4 ms to minimize.
[2024-06-01 20:15:45] [INFO ] Deduced a trap composed of 19 places in 259 ms of which 4 ms to minimize.
[2024-06-01 20:15:45] [INFO ] Deduced a trap composed of 20 places in 279 ms of which 3 ms to minimize.
[2024-06-01 20:15:45] [INFO ] Deduced a trap composed of 47 places in 254 ms of which 4 ms to minimize.
[2024-06-01 20:15:46] [INFO ] Deduced a trap composed of 20 places in 247 ms of which 4 ms to minimize.
[2024-06-01 20:15:46] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 3 ms to minimize.
SMT process timed out in 30383ms, After SMT, problems are : Problem set: 0 solved, 668 unsolved
Search for dead transitions found 0 dead transitions in 30396ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32588 ms. Remains : 260/260 places, 674/674 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 510 edges and 260 vertex of which 176 / 260 are part of one of the 30 SCC in 1 ms
Free SCC test removed 146 places
Drop transitions (Empty/Sink Transition effects.) removed 292 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 441 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 114 transition count 204
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 85 transition count 204
Performed 4 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 67 place count 81 transition count 197
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 17 rules applied. Total rules applied 84 place count 70 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 36 edges and 70 vertex of which 30 / 70 are part of one of the 5 SCC in 0 ms
Free SCC test removed 25 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 86 place count 45 transition count 196
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (trivial) has 106 edges and 41 vertex of which 20 / 41 are part of one of the 5 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 1 with 35 rules applied. Total rules applied 121 place count 26 transition count 166
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 2 with 123 rules applied. Total rules applied 244 place count 26 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 247 place count 26 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 248 place count 26 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 249 place count 25 transition count 39
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 250 place count 25 transition count 39
Applied a total of 250 rules in 33 ms. Remains 25 /260 variables (removed 235) and now considering 39/674 (removed 635) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 39 rows 25 cols
[2024-06-01 20:15:46] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 20:15:46] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 20:15:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 20:15:46] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 20:15:46] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 20:15:46] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 158 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 334 ms.
Product exploration explored 100000 steps with 0 reset in 403 ms.
Support contains 2 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 674/674 transitions.
Applied a total of 0 rules in 7 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
[2024-06-01 20:15:47] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 260 cols
[2024-06-01 20:15:47] [INFO ] Computed 17 invariants in 3 ms
[2024-06-01 20:15:47] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-06-01 20:15:47] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
[2024-06-01 20:15:47] [INFO ] Invariant cache hit.
[2024-06-01 20:15:48] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:15:49] [INFO ] Implicit Places using invariants and state equation in 1447 ms returned []
Implicit Place search using SMT with State Equation took 1813 ms to find 0 implicit places.
[2024-06-01 20:15:49] [INFO ] Redundant transitions in 9 ms returned []
Running 668 sub problems to find dead transitions.
[2024-06-01 20:15:49] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
[2024-06-01 20:15:49] [INFO ] Invariant cache hit.
[2024-06-01 20:15:49] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 260/260 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 17/277 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 20:15:57] [INFO ] Deduced a trap composed of 26 places in 326 ms of which 4 ms to minimize.
[2024-06-01 20:15:57] [INFO ] Deduced a trap composed of 19 places in 277 ms of which 4 ms to minimize.
[2024-06-01 20:15:57] [INFO ] Deduced a trap composed of 35 places in 255 ms of which 4 ms to minimize.
[2024-06-01 20:15:57] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 4 ms to minimize.
[2024-06-01 20:15:58] [INFO ] Deduced a trap composed of 9 places in 268 ms of which 4 ms to minimize.
[2024-06-01 20:15:58] [INFO ] Deduced a trap composed of 52 places in 257 ms of which 4 ms to minimize.
[2024-06-01 20:15:58] [INFO ] Deduced a trap composed of 33 places in 261 ms of which 4 ms to minimize.
[2024-06-01 20:15:58] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 4 ms to minimize.
[2024-06-01 20:15:59] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 3 ms to minimize.
[2024-06-01 20:15:59] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 3 ms to minimize.
[2024-06-01 20:15:59] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 3 ms to minimize.
[2024-06-01 20:15:59] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 3 ms to minimize.
[2024-06-01 20:15:59] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 2 ms to minimize.
[2024-06-01 20:16:00] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 2 ms to minimize.
[2024-06-01 20:16:00] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:16:00] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 2 ms to minimize.
[2024-06-01 20:16:00] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 4 ms to minimize.
[2024-06-01 20:16:00] [INFO ] Deduced a trap composed of 40 places in 281 ms of which 4 ms to minimize.
[2024-06-01 20:16:01] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 3 ms to minimize.
[2024-06-01 20:16:01] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 20/297 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 20:16:01] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 3 ms to minimize.
[2024-06-01 20:16:02] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 3 ms to minimize.
[2024-06-01 20:16:02] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 2 ms to minimize.
[2024-06-01 20:16:02] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 2 ms to minimize.
[2024-06-01 20:16:02] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 3 ms to minimize.
[2024-06-01 20:16:02] [INFO ] Deduced a trap composed of 18 places in 253 ms of which 4 ms to minimize.
[2024-06-01 20:16:03] [INFO ] Deduced a trap composed of 33 places in 214 ms of which 3 ms to minimize.
[2024-06-01 20:16:03] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 2 ms to minimize.
[2024-06-01 20:16:03] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 1 ms to minimize.
[2024-06-01 20:16:03] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 3 ms to minimize.
[2024-06-01 20:16:03] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 2 ms to minimize.
[2024-06-01 20:16:03] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
[2024-06-01 20:16:03] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 2 ms to minimize.
[2024-06-01 20:16:04] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 3 ms to minimize.
[2024-06-01 20:16:04] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 2 ms to minimize.
[2024-06-01 20:16:04] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 3 ms to minimize.
[2024-06-01 20:16:04] [INFO ] Deduced a trap composed of 17 places in 230 ms of which 3 ms to minimize.
[2024-06-01 20:16:04] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 3 ms to minimize.
[2024-06-01 20:16:05] [INFO ] Deduced a trap composed of 37 places in 211 ms of which 3 ms to minimize.
[2024-06-01 20:16:05] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 20/317 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 20:16:11] [INFO ] Deduced a trap composed of 16 places in 277 ms of which 4 ms to minimize.
[2024-06-01 20:16:11] [INFO ] Deduced a trap composed of 9 places in 260 ms of which 4 ms to minimize.
[2024-06-01 20:16:11] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 3 ms to minimize.
[2024-06-01 20:16:12] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 2 ms to minimize.
[2024-06-01 20:16:12] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:16:12] [INFO ] Deduced a trap composed of 9 places in 300 ms of which 4 ms to minimize.
[2024-06-01 20:16:12] [INFO ] Deduced a trap composed of 40 places in 278 ms of which 3 ms to minimize.
[2024-06-01 20:16:12] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-06-01 20:16:13] [INFO ] Deduced a trap composed of 18 places in 245 ms of which 3 ms to minimize.
[2024-06-01 20:16:13] [INFO ] Deduced a trap composed of 51 places in 243 ms of which 3 ms to minimize.
[2024-06-01 20:16:13] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 3 ms to minimize.
[2024-06-01 20:16:14] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 3 ms to minimize.
[2024-06-01 20:16:14] [INFO ] Deduced a trap composed of 37 places in 237 ms of which 3 ms to minimize.
[2024-06-01 20:16:14] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 2 ms to minimize.
[2024-06-01 20:16:15] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 3 ms to minimize.
[2024-06-01 20:16:15] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 3 ms to minimize.
[2024-06-01 20:16:15] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 2 ms to minimize.
[2024-06-01 20:16:15] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:16:15] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 3 ms to minimize.
[2024-06-01 20:16:15] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 20/337 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 20:16:16] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 1 ms to minimize.
[2024-06-01 20:16:16] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 3 ms to minimize.
[2024-06-01 20:16:17] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:16:17] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 2 ms to minimize.
[2024-06-01 20:16:17] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 2 ms to minimize.
[2024-06-01 20:16:17] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:16:17] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 2 ms to minimize.
[2024-06-01 20:16:17] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:16:18] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 2 ms to minimize.
[2024-06-01 20:16:18] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2024-06-01 20:16:18] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-06-01 20:16:18] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-06-01 20:16:18] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:16:18] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-06-01 20:16:19] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 3 ms to minimize.
[2024-06-01 20:16:19] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-06-01 20:16:19] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2024-06-01 20:16:19] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-06-01 20:16:19] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 260/814 variables, and 356 constraints, problems are : Problem set: 0 solved, 668 unsolved in 30029 ms.
Refiners :[Domain max(s): 260/260 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/260 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 668/668 constraints, Known Traps: 79/79 constraints]
Escalating to Integer solving :Problem set: 0 solved, 668 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 260/260 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 17/277 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 79/356 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 20:16:23] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 4 ms to minimize.
[2024-06-01 20:16:23] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 4 ms to minimize.
[2024-06-01 20:16:23] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 4 ms to minimize.
[2024-06-01 20:16:23] [INFO ] Deduced a trap composed of 13 places in 281 ms of which 4 ms to minimize.
[2024-06-01 20:16:24] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2024-06-01 20:16:24] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 2 ms to minimize.
[2024-06-01 20:16:24] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 3 ms to minimize.
[2024-06-01 20:16:25] [INFO ] Deduced a trap composed of 41 places in 186 ms of which 3 ms to minimize.
[2024-06-01 20:16:25] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 2 ms to minimize.
[2024-06-01 20:16:25] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 3 ms to minimize.
[2024-06-01 20:16:25] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 2 ms to minimize.
[2024-06-01 20:16:26] [INFO ] Deduced a trap composed of 51 places in 170 ms of which 4 ms to minimize.
[2024-06-01 20:16:26] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 3 ms to minimize.
[2024-06-01 20:16:26] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 3 ms to minimize.
[2024-06-01 20:16:26] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 3 ms to minimize.
[2024-06-01 20:16:26] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:16:27] [INFO ] Deduced a trap composed of 30 places in 189 ms of which 3 ms to minimize.
[2024-06-01 20:16:27] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:16:27] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:16:27] [INFO ] Deduced a trap composed of 39 places in 214 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 20:16:30] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 3 ms to minimize.
[2024-06-01 20:16:30] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 3 ms to minimize.
[2024-06-01 20:16:30] [INFO ] Deduced a trap composed of 43 places in 247 ms of which 4 ms to minimize.
[2024-06-01 20:16:30] [INFO ] Deduced a trap composed of 19 places in 239 ms of which 3 ms to minimize.
[2024-06-01 20:16:31] [INFO ] Deduced a trap composed of 18 places in 234 ms of which 3 ms to minimize.
[2024-06-01 20:16:31] [INFO ] Deduced a trap composed of 44 places in 237 ms of which 4 ms to minimize.
[2024-06-01 20:16:31] [INFO ] Deduced a trap composed of 28 places in 239 ms of which 3 ms to minimize.
[2024-06-01 20:16:31] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 3 ms to minimize.
[2024-06-01 20:16:32] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 3 ms to minimize.
[2024-06-01 20:16:32] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 2 ms to minimize.
[2024-06-01 20:16:32] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 3 ms to minimize.
[2024-06-01 20:16:33] [INFO ] Deduced a trap composed of 35 places in 273 ms of which 4 ms to minimize.
[2024-06-01 20:16:33] [INFO ] Deduced a trap composed of 20 places in 287 ms of which 3 ms to minimize.
[2024-06-01 20:16:33] [INFO ] Deduced a trap composed of 13 places in 273 ms of which 4 ms to minimize.
[2024-06-01 20:16:33] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 4 ms to minimize.
[2024-06-01 20:16:34] [INFO ] Deduced a trap composed of 16 places in 235 ms of which 4 ms to minimize.
[2024-06-01 20:16:34] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 3 ms to minimize.
[2024-06-01 20:16:35] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 3 ms to minimize.
[2024-06-01 20:16:35] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 2 ms to minimize.
[2024-06-01 20:16:35] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 20:16:38] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 2 ms to minimize.
[2024-06-01 20:16:38] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2024-06-01 20:16:39] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-06-01 20:16:39] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2024-06-01 20:16:39] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-06-01 20:16:39] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 3 ms to minimize.
[2024-06-01 20:16:40] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-06-01 20:16:40] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 2 ms to minimize.
[2024-06-01 20:16:40] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2024-06-01 20:16:40] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 3 ms to minimize.
[2024-06-01 20:16:40] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 3 ms to minimize.
[2024-06-01 20:16:41] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 3 ms to minimize.
[2024-06-01 20:16:41] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
[2024-06-01 20:16:41] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 3 ms to minimize.
[2024-06-01 20:16:41] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:16:41] [INFO ] Deduced a trap composed of 48 places in 197 ms of which 2 ms to minimize.
[2024-06-01 20:16:42] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 3 ms to minimize.
[2024-06-01 20:16:42] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 3 ms to minimize.
[2024-06-01 20:16:42] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 2 ms to minimize.
[2024-06-01 20:16:43] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 20/416 constraints. Problems are: Problem set: 0 solved, 668 unsolved
[2024-06-01 20:16:47] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:16:48] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 3 ms to minimize.
[2024-06-01 20:16:48] [INFO ] Deduced a trap composed of 24 places in 221 ms of which 4 ms to minimize.
[2024-06-01 20:16:49] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 3 ms to minimize.
[2024-06-01 20:16:49] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 3 ms to minimize.
[2024-06-01 20:16:49] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 260/814 variables, and 422 constraints, problems are : Problem set: 0 solved, 668 unsolved in 30035 ms.
Refiners :[Domain max(s): 260/260 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/260 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/668 constraints, Known Traps: 145/145 constraints]
After SMT, in 60409ms problems are : Problem set: 0 solved, 668 unsolved
Search for dead transitions found 0 dead transitions in 60423ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62262 ms. Remains : 260/260 places, 674/674 transitions.
Treatment of property Peterson-PT-5-LTLCardinality-08 finished in 215855 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 358 transitions
Trivial Post-agglo rules discarded 358 transitions
Performed 358 trivial Post agglomeration. Transition count delta: 358
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 830 transition count 884
Reduce places removed 358 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 359 rules applied. Total rules applied 717 place count 472 transition count 883
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 718 place count 471 transition count 883
Performed 178 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 178 Pre rules applied. Total rules applied 718 place count 471 transition count 705
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 1074 place count 293 transition count 705
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1132 place count 264 transition count 676
Applied a total of 1132 rules in 55 ms. Remains 264 /830 variables (removed 566) and now considering 676/1242 (removed 566) transitions.
[2024-06-01 20:16:50] [INFO ] Flow matrix only has 556 transitions (discarded 120 similar events)
// Phase 1: matrix 556 rows 264 cols
[2024-06-01 20:16:50] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 20:16:50] [INFO ] Implicit Places using invariants in 489 ms returned [243, 244]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 490 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 262/830 places, 676/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 262 /262 variables (removed 0) and now considering 676/676 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 560 ms. Remains : 262/830 places, 676/1242 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 349 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 3 ms.
FORMULA Peterson-PT-5-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLCardinality-10 finished in 1086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 1242/1242 transitions.
Applied a total of 0 rules in 22 ms. Remains 830 /830 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 20:16:51] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 830 cols
[2024-06-01 20:16:51] [INFO ] Computed 19 invariants in 7 ms
[2024-06-01 20:16:52] [INFO ] Implicit Places using invariants in 922 ms returned [804, 805]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 924 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/830 places, 1242/1242 transitions.
Applied a total of 0 rules in 22 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 971 ms. Remains : 828/830 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 606 ms.
Product exploration explored 100000 steps with 50000 reset in 497 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-5-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-5-LTLCardinality-12 finished in 2241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(F(p1)))))'
Support contains 5 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 1242/1242 transitions.
Applied a total of 0 rules in 14 ms. Remains 830 /830 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 20:16:53] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 20:16:53] [INFO ] Invariant cache hit.
[2024-06-01 20:16:54] [INFO ] Implicit Places using invariants in 863 ms returned [804]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 865 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 829/830 places, 1242/1242 transitions.
Applied a total of 0 rules in 24 ms. Remains 829 /829 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 905 ms. Remains : 829/830 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-13
Product exploration explored 100000 steps with 1411 reset in 434 ms.
Stack based approach found an accepted trace after 368 steps with 3 reset with depth 225 and stack size 225 in 2 ms.
FORMULA Peterson-PT-5-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLCardinality-13 finished in 1523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p0))||F((!p0 U (G(!p0)||(!p0&&G(!p1)))))))'
Support contains 4 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 1242/1242 transitions.
Applied a total of 0 rules in 24 ms. Remains 830 /830 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 20:16:54] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 20:16:54] [INFO ] Invariant cache hit.
[2024-06-01 20:16:55] [INFO ] Implicit Places using invariants in 838 ms returned [804, 805]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 840 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/830 places, 1242/1242 transitions.
Applied a total of 0 rules in 23 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 888 ms. Remains : 828/830 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 253 ms :[false, false, false, p0, (AND p0 p1)]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 613 ms.
Product exploration explored 100000 steps with 50000 reset in 550 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 22 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-5-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-5-LTLCardinality-15 finished in 2374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-06-01 20:16:57] [INFO ] Flatten gal took : 62 ms
[2024-06-01 20:16:57] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 20:16:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 830 places, 1242 transitions and 3820 arcs took 12 ms.
Total runtime 326555 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : Peterson-PT-5-LTLCardinality-08

BK_STOP 1717273453830

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name Peterson-PT-5-LTLCardinality-08
ltl formula formula --ltl=/tmp/2941/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 830 places, 1242 transitions and 3820 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.200 real 0.070 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2941/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2941/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2941/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2941/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 831 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 831, there are 1254 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~111508 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~231508 transitions
pnml2lts-mc( 0/ 4): ~10000 levels ~40000 states ~466852 transitions
pnml2lts-mc( 0/ 4): ~19997 levels ~80000 states ~946732 transitions
pnml2lts-mc( 0/ 4): ~39972 levels ~160000 states ~1903804 transitions
pnml2lts-mc( 3/ 4): ~79026 levels ~320000 states ~3835828 transitions
pnml2lts-mc( 1/ 4): ~115322 levels ~640000 states ~7671052 transitions
pnml2lts-mc( 1/ 4): ~115322 levels ~1280000 states ~15316948 transitions
pnml2lts-mc( 1/ 4): ~115322 levels ~2560000 states ~30676948 transitions
pnml2lts-mc( 0/ 4): ~185749 levels ~5120000 states ~61345660 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 404
pnml2lts-mc( 0/ 4): unique states count: 10089543
pnml2lts-mc( 0/ 4): unique transitions count: 119912520
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 614720
pnml2lts-mc( 0/ 4): - claim found count: 106305996
pnml2lts-mc( 0/ 4): - claim success count: 10089546
pnml2lts-mc( 0/ 4): - cum. max stack depth: 665792
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10089546 states 119912540 transitions, fanout: 11.885
pnml2lts-mc( 0/ 4): Total exploration time 434.860 sec (434.850 sec minimum, 434.855 sec on average)
pnml2lts-mc( 0/ 4): States per second: 23202, Transitions per second: 275750
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 143.1MB, 14.5 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 30.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1272 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 143.1MB (~256.0MB paged-in)

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="Peterson-PT-5"
export BK_EXAMINATION="LTLCardinality"
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 Peterson-PT-5, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654407300275"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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