Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 25K Apr 11 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 11 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 243K Apr 11 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.5K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 58K Apr 11 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 293K Apr 11 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 93K Apr 11 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 478K Apr 11 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 906K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717252486841

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:34:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:34:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:34:50] [INFO ] Load time of PNML (sax parser for PT used): 243 ms
[2024-06-01 14:34:50] [INFO ] Transformed 752 places.
[2024-06-01 14:34:50] [INFO ] Transformed 1572 transitions.
[2024-06-01 14:34:50] [INFO ] Parsed PT model containing 752 places and 1572 transitions and 7262 arcs in 621 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 70 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 73 out of 752 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 741 transition count 1403
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 741 transition count 1403
Applied a total of 20 rules in 283 ms. Remains 741 /752 variables (removed 11) and now considering 1403/1412 (removed 9) transitions.
Running 1401 sub problems to find dead transitions.
[2024-06-01 14:34:51] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
// Phase 1: matrix 1383 rows 741 cols
[2024-06-01 14:34:51] [INFO ] Computed 52 invariants in 105 ms
[2024-06-01 14:34:51] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/739 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/739 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 739/2124 variables, and 50 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20137 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 39/41 constraints, State Equation: 0/741 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/739 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/739 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-06-01 14:35:26] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 25 ms to minimize.
[2024-06-01 14:35:26] [INFO ] Deduced a trap composed of 65 places in 220 ms of which 15 ms to minimize.
[2024-06-01 14:35:26] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 1 ms to minimize.
[2024-06-01 14:35:26] [INFO ] Deduced a trap composed of 65 places in 162 ms of which 11 ms to minimize.
[2024-06-01 14:35:26] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 1 ms to minimize.
[2024-06-01 14:35:27] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 2 ms to minimize.
[2024-06-01 14:35:27] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 1 ms to minimize.
[2024-06-01 14:35:27] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 3 ms to minimize.
[2024-06-01 14:35:27] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 13 ms to minimize.
[2024-06-01 14:35:28] [INFO ] Deduced a trap composed of 386 places in 604 ms of which 5 ms to minimize.
[2024-06-01 14:35:29] [INFO ] Deduced a trap composed of 390 places in 580 ms of which 4 ms to minimize.
[2024-06-01 14:35:30] [INFO ] Deduced a trap composed of 65 places in 596 ms of which 31 ms to minimize.
[2024-06-01 14:35:30] [INFO ] Deduced a trap composed of 393 places in 553 ms of which 31 ms to minimize.
[2024-06-01 14:35:31] [INFO ] Deduced a trap composed of 378 places in 528 ms of which 19 ms to minimize.
[2024-06-01 14:35:31] [INFO ] Deduced a trap composed of 247 places in 510 ms of which 4 ms to minimize.
[2024-06-01 14:35:34] [INFO ] Deduced a trap composed of 230 places in 3134 ms of which 5 ms to minimize.
SMT process timed out in 43673ms, After SMT, problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 43761ms
[2024-06-01 14:35:35] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
[2024-06-01 14:35:35] [INFO ] Invariant cache hit.
[2024-06-01 14:35:35] [INFO ] Implicit Places using invariants in 826 ms returned [4, 102, 190, 276, 394, 434, 522, 574, 584, 666]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 869 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 731/752 places, 1403/1412 transitions.
Applied a total of 0 rules in 36 ms. Remains 731 /731 variables (removed 0) and now considering 1403/1403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45069 ms. Remains : 731/752 places, 1403/1412 transitions.
Support contains 73 out of 731 places after structural reductions.
[2024-06-01 14:35:36] [INFO ] Flatten gal took : 280 ms
[2024-06-01 14:35:37] [INFO ] Flatten gal took : 181 ms
[2024-06-01 14:35:37] [INFO ] Input system was already deterministic with 1403 transitions.
RANDOM walk for 40000 steps (13 resets) in 2906 ms. (13 steps per ms) remains 10/22 properties
BEST_FIRST walk for 40002 steps (9 resets) in 559 ms. (71 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (10 resets) in 395 ms. (101 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 338 ms. (117 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 458 ms. (87 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (9 resets) in 387 ms. (103 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 345 ms. (115 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (11 resets) in 216 ms. (184 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 304 ms. (131 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (9 resets) in 338 ms. (118 steps per ms) remains 9/9 properties
[2024-06-01 14:35:39] [INFO ] Flow matrix only has 1383 transitions (discarded 20 similar events)
// Phase 1: matrix 1383 rows 731 cols
[2024-06-01 14:35:39] [INFO ] Computed 42 invariants in 63 ms
[2024-06-01 14:35:39] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 31/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/54 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 6 (OVERLAPS) 637/691 variables, 13/17 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/691 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 9/700 variables, 9/26 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/700 variables, 0/26 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 10 (OVERLAPS) 29/729 variables, 15/41 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/729 variables, 0/41 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1383/2112 variables, 729/770 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2112 variables, 120/890 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2112 variables, 0/890 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/2114 variables, 2/892 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2114 variables, 1/893 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2114 variables, 0/893 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/2114 variables, 0/893 constraints. Problems are: Problem set: 5 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2114/2114 variables, and 893 constraints, problems are : Problem set: 5 solved, 4 unsolved in 3150 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 731/731 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 20/36 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 651/687 variables, 12/13 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/687 variables, 0/13 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 11/698 variables, 11/24 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 0/24 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 31/729 variables, 17/41 constraints. Problems are: Problem set: 5 solved, 4 unsolved
[2024-06-01 14:35:44] [INFO ] Deduced a trap composed of 65 places in 351 ms of which 3 ms to minimize.
[2024-06-01 14:35:45] [INFO ] Deduced a trap composed of 65 places in 332 ms of which 3 ms to minimize.
[2024-06-01 14:35:47] [INFO ] Deduced a trap composed of 65 places in 2700 ms of which 3 ms to minimize.
[2024-06-01 14:35:49] [INFO ] Deduced a trap composed of 65 places in 1405 ms of which 23 ms to minimize.
SMT process timed out in 9544ms, After SMT, problems are : Problem set: 5 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 731 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 731/731 places, 1403/1403 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 731 transition count 1352
Reduce places removed 51 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 62 rules applied. Total rules applied 113 place count 680 transition count 1341
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 124 place count 669 transition count 1341
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 124 place count 669 transition count 1251
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 304 place count 579 transition count 1251
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 305 place count 578 transition count 1250
Iterating global reduction 3 with 1 rules applied. Total rules applied 306 place count 578 transition count 1250
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 384 place count 539 transition count 1211
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 392 place count 531 transition count 1203
Iterating global reduction 3 with 8 rules applied. Total rules applied 400 place count 531 transition count 1203
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 410 place count 531 transition count 1193
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 420 place count 521 transition count 1193
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 430 place count 521 transition count 1193
Applied a total of 430 rules in 483 ms. Remains 521 /731 variables (removed 210) and now considering 1193/1403 (removed 210) transitions.
Running 1191 sub problems to find dead transitions.
[2024-06-01 14:35:49] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
// Phase 1: matrix 1173 rows 521 cols
[2024-06-01 14:35:50] [INFO ] Computed 42 invariants in 54 ms
[2024-06-01 14:35:50] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 519/1694 variables, and 40 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 20094 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/521 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1191/1191 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 14:36:19] [INFO ] Deduced a trap composed of 44 places in 246 ms of which 8 ms to minimize.
[2024-06-01 14:36:19] [INFO ] Deduced a trap composed of 45 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:36:19] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 1 ms to minimize.
[2024-06-01 14:36:20] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 4 ms to minimize.
[2024-06-01 14:36:20] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 11 ms to minimize.
[2024-06-01 14:36:20] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 1 ms to minimize.
[2024-06-01 14:36:20] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 1 ms to minimize.
[2024-06-01 14:36:20] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:36:20] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:36:20] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:36:21] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 3 ms to minimize.
[2024-06-01 14:36:21] [INFO ] Deduced a trap composed of 3 places in 498 ms of which 7 ms to minimize.
[2024-06-01 14:36:22] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 4 ms to minimize.
[2024-06-01 14:36:22] [INFO ] Deduced a trap composed of 212 places in 292 ms of which 15 ms to minimize.
[2024-06-01 14:36:23] [INFO ] Deduced a trap composed of 160 places in 261 ms of which 5 ms to minimize.
[2024-06-01 14:36:23] [INFO ] Deduced a trap composed of 303 places in 480 ms of which 3 ms to minimize.
[2024-06-01 14:36:24] [INFO ] Deduced a trap composed of 243 places in 345 ms of which 4 ms to minimize.
[2024-06-01 14:36:25] [INFO ] Deduced a trap composed of 125 places in 405 ms of which 5 ms to minimize.
[2024-06-01 14:36:26] [INFO ] Deduced a trap composed of 129 places in 343 ms of which 3 ms to minimize.
[2024-06-01 14:36:26] [INFO ] Deduced a trap composed of 246 places in 411 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/1694 variables, and 60 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/521 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1191 constraints, Known Traps: 20/20 constraints]
After SMT, in 42030ms problems are : Problem set: 0 solved, 1191 unsolved
Search for dead transitions found 0 dead transitions in 42059ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42546 ms. Remains : 521/731 places, 1193/1403 transitions.
RANDOM walk for 40000 steps (14 resets) in 621 ms. (64 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (9 resets) in 341 ms. (116 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 234 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 378 ms. (105 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 323 ms. (123 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 59738 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 4
Probabilistic random walk after 59738 steps, saw 38032 distinct states, run finished after 3007 ms. (steps per millisecond=19 ) properties seen :0
[2024-06-01 14:36:35] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-06-01 14:36:35] [INFO ] Invariant cache hit.
[2024-06-01 14:36:35] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 126/142 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/144 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 337/481 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 8/489 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 30/519 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/519 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1173/1692 variables, 519/560 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1692 variables, 120/680 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1692 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/1694 variables, 2/682 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1694 variables, 1/683 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1694 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1694 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1694/1694 variables, and 683 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1284 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 521/521 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 126/142 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/144 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 337/481 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 8/489 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 30/519 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 14:36:37] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 3 ms to minimize.
[2024-06-01 14:36:37] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 6 ms to minimize.
[2024-06-01 14:36:38] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:36:38] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 2 ms to minimize.
[2024-06-01 14:36:38] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:36:38] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 1 ms to minimize.
[2024-06-01 14:36:38] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2024-06-01 14:36:39] [INFO ] Deduced a trap composed of 73 places in 352 ms of which 3 ms to minimize.
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
[2024-06-01 14:36:39] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
[2024-06-01 14:36:39] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 1 ms to minimize.
[2024-06-01 14:36:39] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/519 variables, 11/52 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/519 variables, 0/52 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1173/1692 variables, 519/571 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1692 variables, 120/691 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp2 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1692/1694 variables, and 693 constraints, problems are : Problem set: 3 solved, 1 unsolved in 15216 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 519/521 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 11/11 constraints]
After SMT, in 16586ms problems are : Problem set: 3 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 521 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 521/521 places, 1193/1193 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 481 transition count 1153
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 90 place count 481 transition count 1143
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 100 place count 471 transition count 1143
Applied a total of 100 rules in 169 ms. Remains 471 /521 variables (removed 50) and now considering 1143/1193 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 471/521 places, 1143/1193 transitions.
RANDOM walk for 40000 steps (23 resets) in 533 ms. (74 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (10 resets) in 282 ms. (141 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 157538 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 1
Probabilistic random walk after 157538 steps, saw 100321 distinct states, run finished after 3002 ms. (steps per millisecond=52 ) properties seen :0
[2024-06-01 14:36:55] [INFO ] Flow matrix only has 1123 transitions (discarded 20 similar events)
// Phase 1: matrix 1123 rows 471 cols
[2024-06-01 14:36:55] [INFO ] Computed 42 invariants in 37 ms
[2024-06-01 14:36:55] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 352/354 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/372 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/376 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 88/464 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/468 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/469 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/469 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1123/1592 variables, 469/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1592 variables, 120/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1592 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1594 variables, 2/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1594 variables, 1/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1594 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1594 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1594/1594 variables, and 633 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1284 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 471/471 constraints, ReadFeed: 120/120 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, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 352/354 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/372 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/376 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 88/464 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:36:57] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 1 ms to minimize.
[2024-06-01 14:36:58] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 1 ms to minimize.
[2024-06-01 14:36:58] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 2 ms to minimize.
[2024-06-01 14:36:58] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 1 ms to minimize.
[2024-06-01 14:36:58] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2024-06-01 14:36:58] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/468 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/469 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/469 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1123/1592 variables, 469/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1592 variables, 120/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1592 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1592 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1594 variables, 2/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1594 variables, 1/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:37:01] [INFO ] Deduced a trap composed of 42 places in 499 ms of which 44 ms to minimize.
[2024-06-01 14:37:02] [INFO ] Deduced a trap composed of 219 places in 528 ms of which 3 ms to minimize.
[2024-06-01 14:37:02] [INFO ] Deduced a trap composed of 178 places in 301 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1594 variables, 3/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1594 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1594 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1594/1594 variables, and 643 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5536 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 471/471 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 6921ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 2 out of 471 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 471/471 places, 1143/1143 transitions.
Applied a total of 0 rules in 40 ms. Remains 471 /471 variables (removed 0) and now considering 1143/1143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 471/471 places, 1143/1143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 471/471 places, 1143/1143 transitions.
Applied a total of 0 rules in 30 ms. Remains 471 /471 variables (removed 0) and now considering 1143/1143 (removed 0) transitions.
[2024-06-01 14:37:02] [INFO ] Flow matrix only has 1123 transitions (discarded 20 similar events)
[2024-06-01 14:37:02] [INFO ] Invariant cache hit.
[2024-06-01 14:37:07] [INFO ] Implicit Places using invariants in 4492 ms returned []
[2024-06-01 14:37:07] [INFO ] Flow matrix only has 1123 transitions (discarded 20 similar events)
[2024-06-01 14:37:07] [INFO ] Invariant cache hit.
[2024-06-01 14:37:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:37:21] [INFO ] Implicit Places using invariants and state equation in 14153 ms returned []
Implicit Place search using SMT with State Equation took 18664 ms to find 0 implicit places.
[2024-06-01 14:37:21] [INFO ] Redundant transitions in 67 ms returned []
Running 1141 sub problems to find dead transitions.
[2024-06-01 14:37:21] [INFO ] Flow matrix only has 1123 transitions (discarded 20 similar events)
[2024-06-01 14:37:21] [INFO ] Invariant cache hit.
[2024-06-01 14:37:21] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
[2024-06-01 14:37:32] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:37:32] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:37:33] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:37:33] [INFO ] Deduced a trap composed of 39 places in 216 ms of which 15 ms to minimize.
[2024-06-01 14:37:33] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 2 ms to minimize.
[2024-06-01 14:37:33] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2024-06-01 14:37:33] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:37:34] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:37:34] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:37:34] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:37:34] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:37:34] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 1 ms to minimize.
[2024-06-01 14:37:35] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 3 ms to minimize.
[2024-06-01 14:37:36] [INFO ] Deduced a trap composed of 309 places in 328 ms of which 4 ms to minimize.
[2024-06-01 14:37:36] [INFO ] Deduced a trap composed of 310 places in 311 ms of which 3 ms to minimize.
[2024-06-01 14:37:37] [INFO ] Deduced a trap composed of 307 places in 285 ms of which 3 ms to minimize.
[2024-06-01 14:37:37] [INFO ] Deduced a trap composed of 309 places in 373 ms of which 8 ms to minimize.
[2024-06-01 14:37:38] [INFO ] Deduced a trap composed of 60 places in 538 ms of which 8 ms to minimize.
[2024-06-01 14:37:39] [INFO ] Deduced a trap composed of 126 places in 381 ms of which 3 ms to minimize.
[2024-06-01 14:37:39] [INFO ] Deduced a trap composed of 106 places in 348 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
[2024-06-01 14:37:43] [INFO ] Deduced a trap composed of 176 places in 307 ms of which 3 ms to minimize.
[2024-06-01 14:37:44] [INFO ] Deduced a trap composed of 298 places in 366 ms of which 5 ms to minimize.
[2024-06-01 14:37:44] [INFO ] Deduced a trap composed of 284 places in 333 ms of which 2 ms to minimize.
[2024-06-01 14:37:45] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 6 ms to minimize.
[2024-06-01 14:37:48] [INFO ] Deduced a trap composed of 201 places in 293 ms of which 3 ms to minimize.
[2024-06-01 14:37:48] [INFO ] Deduced a trap composed of 175 places in 354 ms of which 8 ms to minimize.
[2024-06-01 14:37:53] [INFO ] Deduced a trap composed of 237 places in 291 ms of which 2 ms to minimize.
[2024-06-01 14:37:53] [INFO ] Deduced a trap composed of 181 places in 361 ms of which 5 ms to minimize.
[2024-06-01 14:37:54] [INFO ] Deduced a trap composed of 179 places in 321 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/1594 variables, and 69 constraints, problems are : Problem set: 0 solved, 1141 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/471 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1141/1141 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 29/69 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
[2024-06-01 14:38:22] [INFO ] Deduced a trap composed of 164 places in 356 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/1594 variables, and 70 constraints, problems are : Problem set: 0 solved, 1141 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/471 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1141 constraints, Known Traps: 30/30 constraints]
After SMT, in 62735ms problems are : Problem set: 0 solved, 1141 unsolved
Search for dead transitions found 0 dead transitions in 62747ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81551 ms. Remains : 471/471 places, 1143/1143 transitions.
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 8 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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))'
Support contains 32 out of 731 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 731/731 places, 1403/1403 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 731 transition count 1361
Reduce places removed 42 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 52 rules applied. Total rules applied 94 place count 689 transition count 1351
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 104 place count 679 transition count 1351
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 70 Pre rules applied. Total rules applied 104 place count 679 transition count 1281
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 244 place count 609 transition count 1281
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 245 place count 608 transition count 1280
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 608 transition count 1280
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 3 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 404 place count 529 transition count 1201
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 412 place count 521 transition count 1193
Iterating global reduction 3 with 8 rules applied. Total rules applied 420 place count 521 transition count 1193
Applied a total of 420 rules in 185 ms. Remains 521 /731 variables (removed 210) and now considering 1193/1403 (removed 210) transitions.
Running 1191 sub problems to find dead transitions.
[2024-06-01 14:38:24] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
// Phase 1: matrix 1173 rows 521 cols
[2024-06-01 14:38:24] [INFO ] Computed 42 invariants in 26 ms
[2024-06-01 14:38:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 14:38:36] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 2 ms to minimize.
[2024-06-01 14:38:36] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:38:36] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:38:36] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 0 ms to minimize.
[2024-06-01 14:38:36] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 0 ms to minimize.
[2024-06-01 14:38:36] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:38:37] [INFO ] Deduced a trap composed of 235 places in 345 ms of which 3 ms to minimize.
[2024-06-01 14:38:37] [INFO ] Deduced a trap composed of 234 places in 285 ms of which 2 ms to minimize.
[2024-06-01 14:38:38] [INFO ] Deduced a trap composed of 45 places in 401 ms of which 10 ms to minimize.
[2024-06-01 14:38:38] [INFO ] Deduced a trap composed of 220 places in 386 ms of which 19 ms to minimize.
[2024-06-01 14:38:38] [INFO ] Deduced a trap composed of 230 places in 271 ms of which 29 ms to minimize.
[2024-06-01 14:38:39] [INFO ] Deduced a trap composed of 223 places in 249 ms of which 2 ms to minimize.
[2024-06-01 14:38:39] [INFO ] Deduced a trap composed of 44 places in 368 ms of which 8 ms to minimize.
[2024-06-01 14:38:39] [INFO ] Deduced a trap composed of 239 places in 301 ms of which 3 ms to minimize.
[2024-06-01 14:38:40] [INFO ] Deduced a trap composed of 44 places in 265 ms of which 3 ms to minimize.
[2024-06-01 14:38:40] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:38:41] [INFO ] Deduced a trap composed of 68 places in 298 ms of which 6 ms to minimize.
[2024-06-01 14:38:41] [INFO ] Deduced a trap composed of 265 places in 268 ms of which 3 ms to minimize.
[2024-06-01 14:38:42] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 2 ms to minimize.
[2024-06-01 14:38:45] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 519/1694 variables, and 55 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/521 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1191/1191 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 14:38:56] [INFO ] Deduced a trap composed of 280 places in 331 ms of which 3 ms to minimize.
[2024-06-01 14:38:56] [INFO ] Deduced a trap composed of 289 places in 287 ms of which 3 ms to minimize.
[2024-06-01 14:38:57] [INFO ] Deduced a trap composed of 270 places in 365 ms of which 4 ms to minimize.
[2024-06-01 14:38:57] [INFO ] Deduced a trap composed of 260 places in 322 ms of which 3 ms to minimize.
[2024-06-01 14:38:57] [INFO ] Deduced a trap composed of 270 places in 296 ms of which 4 ms to minimize.
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 257 places in 405 ms of which 4 ms to minimize.
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:38:59] [INFO ] Deduced a trap composed of 211 places in 303 ms of which 3 ms to minimize.
[2024-06-01 14:38:59] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:38:59] [INFO ] Deduced a trap composed of 198 places in 321 ms of which 4 ms to minimize.
[2024-06-01 14:39:00] [INFO ] Deduced a trap composed of 330 places in 270 ms of which 3 ms to minimize.
[2024-06-01 14:39:00] [INFO ] Deduced a trap composed of 309 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:39:00] [INFO ] Deduced a trap composed of 284 places in 291 ms of which 4 ms to minimize.
[2024-06-01 14:39:01] [INFO ] Deduced a trap composed of 313 places in 256 ms of which 2 ms to minimize.
[2024-06-01 14:39:04] [INFO ] Deduced a trap composed of 322 places in 268 ms of which 3 ms to minimize.
[2024-06-01 14:39:06] [INFO ] Deduced a trap composed of 335 places in 265 ms of which 3 ms to minimize.
[2024-06-01 14:39:06] [INFO ] Deduced a trap composed of 333 places in 259 ms of which 3 ms to minimize.
SMT process timed out in 42062ms, After SMT, problems are : Problem set: 0 solved, 1191 unsolved
Search for dead transitions found 0 dead transitions in 42092ms
[2024-06-01 14:39:06] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-06-01 14:39:06] [INFO ] Invariant cache hit.
[2024-06-01 14:39:07] [INFO ] Implicit Places using invariants in 474 ms returned []
[2024-06-01 14:39:07] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-06-01 14:39:07] [INFO ] Invariant cache hit.
[2024-06-01 14:39:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:39:18] [INFO ] Implicit Places using invariants and state equation in 11159 ms returned []
Implicit Place search using SMT with State Equation took 11664 ms to find 0 implicit places.
[2024-06-01 14:39:18] [INFO ] Redundant transitions in 44 ms returned []
Running 1191 sub problems to find dead transitions.
[2024-06-01 14:39:18] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-06-01 14:39:18] [INFO ] Invariant cache hit.
[2024-06-01 14:39:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 14:39:30] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 1 ms to minimize.
[2024-06-01 14:39:30] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:39:30] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:39:30] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 14 ms to minimize.
[2024-06-01 14:39:30] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:39:30] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:39:30] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:39:30] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 1 ms to minimize.
[2024-06-01 14:39:31] [INFO ] Deduced a trap composed of 229 places in 385 ms of which 4 ms to minimize.
[2024-06-01 14:39:31] [INFO ] Deduced a trap composed of 45 places in 315 ms of which 3 ms to minimize.
[2024-06-01 14:39:32] [INFO ] Deduced a trap composed of 224 places in 313 ms of which 3 ms to minimize.
[2024-06-01 14:39:32] [INFO ] Deduced a trap composed of 219 places in 346 ms of which 6 ms to minimize.
[2024-06-01 14:39:32] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:39:33] [INFO ] Deduced a trap composed of 111 places in 373 ms of which 6 ms to minimize.
[2024-06-01 14:39:33] [INFO ] Deduced a trap composed of 235 places in 264 ms of which 3 ms to minimize.
[2024-06-01 14:39:34] [INFO ] Deduced a trap composed of 341 places in 351 ms of which 31 ms to minimize.
[2024-06-01 14:39:34] [INFO ] Deduced a trap composed of 255 places in 395 ms of which 5 ms to minimize.
[2024-06-01 14:39:34] [INFO ] Deduced a trap composed of 230 places in 347 ms of which 5 ms to minimize.
[2024-06-01 14:39:35] [INFO ] Deduced a trap composed of 257 places in 361 ms of which 4 ms to minimize.
[2024-06-01 14:39:35] [INFO ] Deduced a trap composed of 252 places in 357 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 14:39:39] [INFO ] Deduced a trap composed of 198 places in 640 ms of which 3 ms to minimize.
[2024-06-01 14:39:40] [INFO ] Deduced a trap composed of 37 places in 226 ms of which 4 ms to minimize.
[2024-06-01 14:39:40] [INFO ] Deduced a trap composed of 37 places in 258 ms of which 4 ms to minimize.
[2024-06-01 14:39:48] [INFO ] Deduced a trap composed of 287 places in 378 ms of which 5 ms to minimize.
[2024-06-01 14:39:48] [INFO ] Deduced a trap composed of 273 places in 288 ms of which 3 ms to minimize.
[2024-06-01 14:39:49] [INFO ] Deduced a trap composed of 275 places in 313 ms of which 3 ms to minimize.
[2024-06-01 14:39:50] [INFO ] Deduced a trap composed of 287 places in 480 ms of which 5 ms to minimize.
[2024-06-01 14:39:50] [INFO ] Deduced a trap composed of 323 places in 347 ms of which 5 ms to minimize.
SMT process timed out in 32009ms, After SMT, problems are : Problem set: 0 solved, 1191 unsolved
Search for dead transitions found 0 dead transitions in 32019ms
Starting structural reductions in SI_LTL mode, iteration 1 : 521/731 places, 1193/1403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86036 ms. Remains : 521/731 places, 1193/1403 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T10-LTLCardinality-02
Product exploration explored 100000 steps with 2313 reset in 626 ms.
Product exploration explored 100000 steps with 2317 reset in 900 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 161 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
RANDOM walk for 170 steps (0 resets) in 5 ms. (28 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 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-06-01 14:39:53] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-06-01 14:39:53] [INFO ] Invariant cache hit.
[2024-06-01 14:39:56] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 14:39:56] [INFO ] [Real]Absence check using 12 positive and 30 generalized place invariants in 67 ms returned sat
[2024-06-01 14:39:57] [INFO ] [Real]Absence check using state equation in 1368 ms returned sat
[2024-06-01 14:39:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:39:58] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 14:39:58] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 188 ms returned sat
[2024-06-01 14:40:01] [INFO ] [Nat]Absence check using state equation in 2502 ms returned sat
[2024-06-01 14:40:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:40:02] [INFO ] [Nat]Added 120 Read/Feed constraints in 912 ms returned sat
[2024-06-01 14:40:02] [INFO ] Deduced a trap composed of 226 places in 383 ms of which 4 ms to minimize.
[2024-06-01 14:40:04] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1936 ms
Could not prove EG (NOT p0)
Support contains 32 out of 521 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 521/521 places, 1193/1193 transitions.
Applied a total of 0 rules in 41 ms. Remains 521 /521 variables (removed 0) and now considering 1193/1193 (removed 0) transitions.
Running 1191 sub problems to find dead transitions.
[2024-06-01 14:40:04] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-06-01 14:40:04] [INFO ] Invariant cache hit.
[2024-06-01 14:40:04] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 14:40:17] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:40:17] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 0 ms to minimize.
[2024-06-01 14:40:17] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:40:17] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 0 ms to minimize.
[2024-06-01 14:40:17] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 1 ms to minimize.
[2024-06-01 14:40:18] [INFO ] Deduced a trap composed of 44 places in 923 ms of which 1 ms to minimize.
[2024-06-01 14:40:18] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-06-01 14:40:18] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 17 ms to minimize.
[2024-06-01 14:40:18] [INFO ] Deduced a trap composed of 229 places in 289 ms of which 3 ms to minimize.
[2024-06-01 14:40:19] [INFO ] Deduced a trap composed of 45 places in 395 ms of which 6 ms to minimize.
[2024-06-01 14:40:19] [INFO ] Deduced a trap composed of 224 places in 348 ms of which 6 ms to minimize.
[2024-06-01 14:40:20] [INFO ] Deduced a trap composed of 219 places in 334 ms of which 6 ms to minimize.
[2024-06-01 14:40:20] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 0 ms to minimize.
[2024-06-01 14:40:20] [INFO ] Deduced a trap composed of 111 places in 291 ms of which 3 ms to minimize.
[2024-06-01 14:40:21] [INFO ] Deduced a trap composed of 235 places in 339 ms of which 4 ms to minimize.
[2024-06-01 14:40:21] [INFO ] Deduced a trap composed of 341 places in 365 ms of which 6 ms to minimize.
[2024-06-01 14:40:22] [INFO ] Deduced a trap composed of 255 places in 400 ms of which 5 ms to minimize.
[2024-06-01 14:40:22] [INFO ] Deduced a trap composed of 230 places in 404 ms of which 8 ms to minimize.
[2024-06-01 14:40:22] [INFO ] Deduced a trap composed of 257 places in 402 ms of which 6 ms to minimize.
[2024-06-01 14:40:23] [INFO ] Deduced a trap composed of 252 places in 328 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 14:40:26] [INFO ] Deduced a trap composed of 198 places in 316 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 519/1694 variables, and 56 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/521 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1191/1191 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 21/56 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 14:40:34] [INFO ] Deduced a trap composed of 34 places in 302 ms of which 3 ms to minimize.
[2024-06-01 14:40:34] [INFO ] Deduced a trap composed of 44 places in 366 ms of which 6 ms to minimize.
[2024-06-01 14:40:35] [INFO ] Deduced a trap composed of 269 places in 292 ms of which 3 ms to minimize.
[2024-06-01 14:40:35] [INFO ] Deduced a trap composed of 257 places in 361 ms of which 7 ms to minimize.
[2024-06-01 14:40:36] [INFO ] Deduced a trap composed of 279 places in 404 ms of which 7 ms to minimize.
[2024-06-01 14:40:36] [INFO ] Deduced a trap composed of 58 places in 170 ms of which 2 ms to minimize.
[2024-06-01 14:40:36] [INFO ] Deduced a trap composed of 293 places in 303 ms of which 3 ms to minimize.
[2024-06-01 14:40:37] [INFO ] Deduced a trap composed of 274 places in 272 ms of which 3 ms to minimize.
[2024-06-01 14:40:38] [INFO ] Deduced a trap composed of 291 places in 296 ms of which 2 ms to minimize.
[2024-06-01 14:40:38] [INFO ] Deduced a trap composed of 266 places in 374 ms of which 9 ms to minimize.
[2024-06-01 14:40:38] [INFO ] Deduced a trap composed of 279 places in 292 ms of which 3 ms to minimize.
[2024-06-01 14:40:39] [INFO ] Deduced a trap composed of 265 places in 271 ms of which 3 ms to minimize.
[2024-06-01 14:40:39] [INFO ] Deduced a trap composed of 23 places in 365 ms of which 5 ms to minimize.
[2024-06-01 14:40:39] [INFO ] Deduced a trap composed of 83 places in 181 ms of which 2 ms to minimize.
[2024-06-01 14:40:43] [INFO ] Deduced a trap composed of 281 places in 373 ms of which 5 ms to minimize.
[2024-06-01 14:40:44] [INFO ] Deduced a trap composed of 279 places in 305 ms of which 16 ms to minimize.
[2024-06-01 14:40:44] [INFO ] Deduced a trap composed of 296 places in 395 ms of which 6 ms to minimize.
[2024-06-01 14:40:45] [INFO ] Deduced a trap composed of 294 places in 345 ms of which 6 ms to minimize.
[2024-06-01 14:40:45] [INFO ] Deduced a trap composed of 277 places in 391 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/1694 variables, and 75 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 20075 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/521 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1191 constraints, Known Traps: 40/40 constraints]
After SMT, in 42551ms problems are : Problem set: 0 solved, 1191 unsolved
Search for dead transitions found 0 dead transitions in 42564ms
[2024-06-01 14:40:46] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-06-01 14:40:46] [INFO ] Invariant cache hit.
[2024-06-01 14:40:47] [INFO ] Implicit Places using invariants in 855 ms returned []
[2024-06-01 14:40:47] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-06-01 14:40:47] [INFO ] Invariant cache hit.
[2024-06-01 14:40:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:40:59] [INFO ] Implicit Places using invariants and state equation in 12149 ms returned []
Implicit Place search using SMT with State Equation took 13021 ms to find 0 implicit places.
[2024-06-01 14:41:00] [INFO ] Redundant transitions in 36 ms returned []
Running 1191 sub problems to find dead transitions.
[2024-06-01 14:41:00] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-06-01 14:41:00] [INFO ] Invariant cache hit.
[2024-06-01 14:41:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 14:41:11] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 2 ms to minimize.
[2024-06-01 14:41:11] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-06-01 14:41:11] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:41:11] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2024-06-01 14:41:11] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:41:11] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 1 ms to minimize.
[2024-06-01 14:41:11] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 0 ms to minimize.
[2024-06-01 14:41:11] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:41:12] [INFO ] Deduced a trap composed of 229 places in 362 ms of which 4 ms to minimize.
[2024-06-01 14:41:12] [INFO ] Deduced a trap composed of 45 places in 307 ms of which 3 ms to minimize.
[2024-06-01 14:41:13] [INFO ] Deduced a trap composed of 224 places in 355 ms of which 4 ms to minimize.
[2024-06-01 14:41:13] [INFO ] Deduced a trap composed of 219 places in 348 ms of which 3 ms to minimize.
[2024-06-01 14:41:13] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:41:13] [INFO ] Deduced a trap composed of 111 places in 361 ms of which 7 ms to minimize.
[2024-06-01 14:41:14] [INFO ] Deduced a trap composed of 235 places in 332 ms of which 5 ms to minimize.
[2024-06-01 14:41:14] [INFO ] Deduced a trap composed of 341 places in 298 ms of which 3 ms to minimize.
[2024-06-01 14:41:15] [INFO ] Deduced a trap composed of 255 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:41:15] [INFO ] Deduced a trap composed of 230 places in 401 ms of which 3 ms to minimize.
[2024-06-01 14:41:15] [INFO ] Deduced a trap composed of 257 places in 266 ms of which 2 ms to minimize.
[2024-06-01 14:41:16] [INFO ] Deduced a trap composed of 252 places in 303 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 14:41:18] [INFO ] Deduced a trap composed of 198 places in 358 ms of which 6 ms to minimize.
[2024-06-01 14:41:19] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 2 ms to minimize.
[2024-06-01 14:41:19] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 2 ms to minimize.
[2024-06-01 14:41:27] [INFO ] Deduced a trap composed of 287 places in 396 ms of which 6 ms to minimize.
[2024-06-01 14:41:27] [INFO ] Deduced a trap composed of 273 places in 299 ms of which 3 ms to minimize.
[2024-06-01 14:41:28] [INFO ] Deduced a trap composed of 275 places in 356 ms of which 7 ms to minimize.
[2024-06-01 14:41:29] [INFO ] Deduced a trap composed of 287 places in 474 ms of which 4 ms to minimize.
[2024-06-01 14:41:29] [INFO ] Deduced a trap composed of 323 places in 398 ms of which 18 ms to minimize.
[2024-06-01 14:41:30] [INFO ] Deduced a trap composed of 273 places in 428 ms of which 3 ms to minimize.
[2024-06-01 14:41:31] [INFO ] Deduced a trap composed of 247 places in 325 ms of which 3 ms to minimize.
[2024-06-01 14:41:31] [INFO ] Deduced a trap composed of 258 places in 333 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 519/1694 variables, and 66 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/521 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1191/1191 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 31/66 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 14:41:42] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:41:42] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:41:42] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:41:42] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 0 ms to minimize.
[2024-06-01 14:41:43] [INFO ] Deduced a trap composed of 321 places in 322 ms of which 4 ms to minimize.
[2024-06-01 14:41:43] [INFO ] Deduced a trap composed of 343 places in 364 ms of which 5 ms to minimize.
[2024-06-01 14:41:45] [INFO ] Deduced a trap composed of 270 places in 343 ms of which 4 ms to minimize.
[2024-06-01 14:41:46] [INFO ] Deduced a trap composed of 287 places in 339 ms of which 5 ms to minimize.
[2024-06-01 14:41:48] [INFO ] Deduced a trap composed of 354 places in 384 ms of which 5 ms to minimize.
[2024-06-01 14:41:49] [INFO ] Deduced a trap composed of 359 places in 320 ms of which 6 ms to minimize.
[2024-06-01 14:41:49] [INFO ] Deduced a trap composed of 330 places in 360 ms of which 6 ms to minimize.
[2024-06-01 14:41:49] [INFO ] Deduced a trap composed of 344 places in 296 ms of which 3 ms to minimize.
[2024-06-01 14:41:52] [INFO ] Deduced a trap composed of 332 places in 412 ms of which 32 ms to minimize.
[2024-06-01 14:41:52] [INFO ] Deduced a trap composed of 351 places in 393 ms of which 3 ms to minimize.
[2024-06-01 14:41:52] [INFO ] Deduced a trap composed of 348 places in 289 ms of which 2 ms to minimize.
[2024-06-01 14:41:55] [INFO ] Deduced a trap composed of 258 places in 318 ms of which 4 ms to minimize.
[2024-06-01 14:41:56] [INFO ] Deduced a trap composed of 300 places in 410 ms of which 6 ms to minimize.
[2024-06-01 14:41:56] [INFO ] Deduced a trap composed of 320 places in 353 ms of which 4 ms to minimize.
[2024-06-01 14:41:57] [INFO ] Deduced a trap composed of 322 places in 382 ms of which 9 ms to minimize.
[2024-06-01 14:41:57] [INFO ] Deduced a trap composed of 309 places in 321 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/1694 variables, and 86 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/521 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1191 constraints, Known Traps: 51/51 constraints]
After SMT, in 62474ms problems are : Problem set: 0 solved, 1191 unsolved
Search for dead transitions found 0 dead transitions in 62497ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 118193 ms. Remains : 521/521 places, 1193/1193 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 97 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 179 steps (0 resets) in 7 ms. (22 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 117 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-06-01 14:42:02] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-06-01 14:42:02] [INFO ] Invariant cache hit.
[2024-06-01 14:42:03] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 14:42:03] [INFO ] [Real]Absence check using 12 positive and 30 generalized place invariants in 63 ms returned sat
[2024-06-01 14:42:05] [INFO ] [Real]Absence check using state equation in 1309 ms returned sat
[2024-06-01 14:42:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:42:05] [INFO ] [Nat]Absence check using 12 positive place invariants in 18 ms returned sat
[2024-06-01 14:42:05] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 103 ms returned sat
[2024-06-01 14:42:08] [INFO ] [Nat]Absence check using state equation in 2335 ms returned sat
[2024-06-01 14:42:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:42:09] [INFO ] [Nat]Added 120 Read/Feed constraints in 933 ms returned sat
[2024-06-01 14:42:09] [INFO ] Deduced a trap composed of 226 places in 338 ms of which 4 ms to minimize.
[2024-06-01 14:42:11] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1923 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2322 reset in 809 ms.
Product exploration explored 100000 steps with 2315 reset in 507 ms.
Support contains 32 out of 521 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 521/521 places, 1193/1193 transitions.
Applied a total of 0 rules in 45 ms. Remains 521 /521 variables (removed 0) and now considering 1193/1193 (removed 0) transitions.
Running 1191 sub problems to find dead transitions.
[2024-06-01 14:42:12] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-06-01 14:42:12] [INFO ] Invariant cache hit.
[2024-06-01 14:42:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 14:42:23] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 4 ms to minimize.
[2024-06-01 14:42:23] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:42:23] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:42:23] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:42:23] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:42:23] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:42:24] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:42:24] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 4 ms to minimize.
[2024-06-01 14:42:24] [INFO ] Deduced a trap composed of 229 places in 296 ms of which 4 ms to minimize.
[2024-06-01 14:42:25] [INFO ] Deduced a trap composed of 45 places in 287 ms of which 3 ms to minimize.
[2024-06-01 14:42:25] [INFO ] Deduced a trap composed of 224 places in 283 ms of which 3 ms to minimize.
[2024-06-01 14:42:25] [INFO ] Deduced a trap composed of 219 places in 302 ms of which 3 ms to minimize.
[2024-06-01 14:42:25] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:42:26] [INFO ] Deduced a trap composed of 111 places in 299 ms of which 4 ms to minimize.
[2024-06-01 14:42:27] [INFO ] Deduced a trap composed of 235 places in 290 ms of which 4 ms to minimize.
[2024-06-01 14:42:27] [INFO ] Deduced a trap composed of 341 places in 259 ms of which 3 ms to minimize.
[2024-06-01 14:42:27] [INFO ] Deduced a trap composed of 255 places in 244 ms of which 3 ms to minimize.
[2024-06-01 14:42:28] [INFO ] Deduced a trap composed of 230 places in 277 ms of which 2 ms to minimize.
[2024-06-01 14:42:28] [INFO ] Deduced a trap composed of 257 places in 230 ms of which 3 ms to minimize.
[2024-06-01 14:42:28] [INFO ] Deduced a trap composed of 252 places in 242 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 14:42:31] [INFO ] Deduced a trap composed of 198 places in 318 ms of which 4 ms to minimize.
[2024-06-01 14:42:34] [INFO ] Deduced a trap composed of 37 places in 211 ms of which 2 ms to minimize.
[2024-06-01 14:42:34] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 519/1694 variables, and 58 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/521 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1191/1191 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 23/58 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 14:42:43] [INFO ] Deduced a trap composed of 285 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:42:43] [INFO ] Deduced a trap composed of 42 places in 250 ms of which 3 ms to minimize.
[2024-06-01 14:42:43] [INFO ] Deduced a trap composed of 42 places in 287 ms of which 3 ms to minimize.
[2024-06-01 14:42:43] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:42:43] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:42:44] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:42:44] [INFO ] Deduced a trap composed of 262 places in 277 ms of which 3 ms to minimize.
[2024-06-01 14:42:44] [INFO ] Deduced a trap composed of 275 places in 319 ms of which 3 ms to minimize.
[2024-06-01 14:42:45] [INFO ] Deduced a trap composed of 273 places in 255 ms of which 3 ms to minimize.
[2024-06-01 14:42:45] [INFO ] Deduced a trap composed of 167 places in 296 ms of which 4 ms to minimize.
[2024-06-01 14:42:45] [INFO ] Deduced a trap composed of 293 places in 294 ms of which 3 ms to minimize.
[2024-06-01 14:42:46] [INFO ] Deduced a trap composed of 282 places in 344 ms of which 3 ms to minimize.
[2024-06-01 14:42:46] [INFO ] Deduced a trap composed of 285 places in 286 ms of which 3 ms to minimize.
[2024-06-01 14:42:46] [INFO ] Deduced a trap composed of 337 places in 300 ms of which 3 ms to minimize.
[2024-06-01 14:42:47] [INFO ] Deduced a trap composed of 306 places in 286 ms of which 4 ms to minimize.
[2024-06-01 14:42:47] [INFO ] Deduced a trap composed of 269 places in 312 ms of which 3 ms to minimize.
[2024-06-01 14:42:48] [INFO ] Deduced a trap composed of 42 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:42:48] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 3 ms to minimize.
[2024-06-01 14:42:49] [INFO ] Deduced a trap composed of 303 places in 359 ms of which 3 ms to minimize.
[2024-06-01 14:42:49] [INFO ] Deduced a trap composed of 305 places in 319 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/1694 variables, and 78 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/521 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1191 constraints, Known Traps: 43/43 constraints]
After SMT, in 42116ms problems are : Problem set: 0 solved, 1191 unsolved
Search for dead transitions found 0 dead transitions in 42152ms
[2024-06-01 14:42:54] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-06-01 14:42:54] [INFO ] Invariant cache hit.
[2024-06-01 14:42:55] [INFO ] Implicit Places using invariants in 562 ms returned []
[2024-06-01 14:42:55] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-06-01 14:42:55] [INFO ] Invariant cache hit.
[2024-06-01 14:42:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:43:05] [INFO ] Implicit Places using invariants and state equation in 10737 ms returned []
Implicit Place search using SMT with State Equation took 11302 ms to find 0 implicit places.
[2024-06-01 14:43:05] [INFO ] Redundant transitions in 44 ms returned []
Running 1191 sub problems to find dead transitions.
[2024-06-01 14:43:06] [INFO ] Flow matrix only has 1173 transitions (discarded 20 similar events)
[2024-06-01 14:43:06] [INFO ] Invariant cache hit.
[2024-06-01 14:43:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 14:43:16] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-06-01 14:43:16] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 1 ms to minimize.
[2024-06-01 14:43:16] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:43:16] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:43:16] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:43:16] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:43:16] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:43:16] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2024-06-01 14:43:17] [INFO ] Deduced a trap composed of 229 places in 381 ms of which 3 ms to minimize.
[2024-06-01 14:43:17] [INFO ] Deduced a trap composed of 45 places in 264 ms of which 3 ms to minimize.
[2024-06-01 14:43:17] [INFO ] Deduced a trap composed of 224 places in 293 ms of which 3 ms to minimize.
[2024-06-01 14:43:18] [INFO ] Deduced a trap composed of 219 places in 258 ms of which 2 ms to minimize.
[2024-06-01 14:43:18] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
[2024-06-01 14:43:18] [INFO ] Deduced a trap composed of 111 places in 313 ms of which 3 ms to minimize.
[2024-06-01 14:43:19] [INFO ] Deduced a trap composed of 235 places in 392 ms of which 3 ms to minimize.
[2024-06-01 14:43:19] [INFO ] Deduced a trap composed of 341 places in 357 ms of which 3 ms to minimize.
[2024-06-01 14:43:20] [INFO ] Deduced a trap composed of 255 places in 241 ms of which 3 ms to minimize.
[2024-06-01 14:43:20] [INFO ] Deduced a trap composed of 230 places in 326 ms of which 3 ms to minimize.
[2024-06-01 14:43:20] [INFO ] Deduced a trap composed of 257 places in 292 ms of which 4 ms to minimize.
[2024-06-01 14:43:21] [INFO ] Deduced a trap composed of 252 places in 346 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 14:43:23] [INFO ] Deduced a trap composed of 198 places in 359 ms of which 2 ms to minimize.
[2024-06-01 14:43:24] [INFO ] Deduced a trap composed of 37 places in 246 ms of which 4 ms to minimize.
[2024-06-01 14:43:24] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 3 ms to minimize.
[2024-06-01 14:43:31] [INFO ] Deduced a trap composed of 287 places in 290 ms of which 3 ms to minimize.
[2024-06-01 14:43:31] [INFO ] Deduced a trap composed of 273 places in 326 ms of which 3 ms to minimize.
[2024-06-01 14:43:32] [INFO ] Deduced a trap composed of 275 places in 348 ms of which 8 ms to minimize.
[2024-06-01 14:43:33] [INFO ] Deduced a trap composed of 287 places in 293 ms of which 4 ms to minimize.
[2024-06-01 14:43:33] [INFO ] Deduced a trap composed of 323 places in 342 ms of which 5 ms to minimize.
[2024-06-01 14:43:33] [INFO ] Deduced a trap composed of 273 places in 307 ms of which 3 ms to minimize.
[2024-06-01 14:43:34] [INFO ] Deduced a trap composed of 247 places in 309 ms of which 4 ms to minimize.
[2024-06-01 14:43:35] [INFO ] Deduced a trap composed of 258 places in 334 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 519/1694 variables, and 66 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/521 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1191/1191 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/519 variables, 31/66 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 14:43:46] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:43:46] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:43:46] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:43:46] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:43:47] [INFO ] Deduced a trap composed of 321 places in 318 ms of which 4 ms to minimize.
[2024-06-01 14:43:47] [INFO ] Deduced a trap composed of 343 places in 254 ms of which 3 ms to minimize.
[2024-06-01 14:43:48] [INFO ] Deduced a trap composed of 270 places in 269 ms of which 4 ms to minimize.
[2024-06-01 14:43:49] [INFO ] Deduced a trap composed of 287 places in 250 ms of which 3 ms to minimize.
[2024-06-01 14:43:51] [INFO ] Deduced a trap composed of 354 places in 251 ms of which 3 ms to minimize.
[2024-06-01 14:43:51] [INFO ] Deduced a trap composed of 359 places in 260 ms of which 2 ms to minimize.
[2024-06-01 14:43:51] [INFO ] Deduced a trap composed of 330 places in 239 ms of which 2 ms to minimize.
[2024-06-01 14:43:51] [INFO ] Deduced a trap composed of 344 places in 239 ms of which 3 ms to minimize.
[2024-06-01 14:43:53] [INFO ] Deduced a trap composed of 332 places in 312 ms of which 4 ms to minimize.
[2024-06-01 14:43:53] [INFO ] Deduced a trap composed of 351 places in 285 ms of which 3 ms to minimize.
[2024-06-01 14:43:54] [INFO ] Deduced a trap composed of 348 places in 286 ms of which 3 ms to minimize.
[2024-06-01 14:43:55] [INFO ] Deduced a trap composed of 258 places in 296 ms of which 4 ms to minimize.
[2024-06-01 14:43:56] [INFO ] Deduced a trap composed of 300 places in 332 ms of which 3 ms to minimize.
[2024-06-01 14:43:57] [INFO ] Deduced a trap composed of 320 places in 272 ms of which 3 ms to minimize.
[2024-06-01 14:43:57] [INFO ] Deduced a trap composed of 322 places in 285 ms of which 3 ms to minimize.
[2024-06-01 14:43:57] [INFO ] Deduced a trap composed of 309 places in 270 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 1191 unsolved
[2024-06-01 14:44:07] [INFO ] Deduced a trap composed of 43 places in 214 ms of which 5 ms to minimize.
[2024-06-01 14:44:07] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/1694 variables, and 88 constraints, problems are : Problem set: 0 solved, 1191 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/521 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1191 constraints, Known Traps: 53/53 constraints]
After SMT, in 62066ms problems are : Problem set: 0 solved, 1191 unsolved
Search for dead transitions found 0 dead transitions in 62083ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 115648 ms. Remains : 521/521 places, 1193/1193 transitions.
Treatment of property PolyORBLF-PT-S02J04T10-LTLCardinality-02 finished in 343702 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) U X(p1)))'
Support contains 11 out of 731 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 731/731 places, 1403/1403 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 721 transition count 1393
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 721 transition count 1393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 720 transition count 1392
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 720 transition count 1392
Applied a total of 22 rules in 50 ms. Remains 720 /731 variables (removed 11) and now considering 1392/1403 (removed 11) transitions.
Running 1390 sub problems to find dead transitions.
[2024-06-01 14:44:08] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 720 cols
[2024-06-01 14:44:08] [INFO ] Computed 42 invariants in 23 ms
[2024-06-01 14:44:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
SMT process timed out in 22512ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 22529ms
[2024-06-01 14:44:30] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:44:30] [INFO ] Invariant cache hit.
[2024-06-01 14:44:32] [INFO ] Implicit Places using invariants in 1198 ms returned []
[2024-06-01 14:44:32] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:44:32] [INFO ] Invariant cache hit.
[2024-06-01 14:44:33] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:44:46] [INFO ] Implicit Places using invariants and state equation in 14080 ms returned []
Implicit Place search using SMT with State Equation took 15287 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2024-06-01 14:44:46] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:44:46] [INFO ] Invariant cache hit.
[2024-06-01 14:44:46] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:45:02] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 3 ms to minimize.
[2024-06-01 14:45:02] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:45:02] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 2 ms to minimize.
[2024-06-01 14:45:02] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2024-06-01 14:45:02] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:45:03] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:45:03] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:45:03] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:45:03] [INFO ] Deduced a trap composed of 383 places in 404 ms of which 5 ms to minimize.
[2024-06-01 14:45:04] [INFO ] Deduced a trap composed of 357 places in 516 ms of which 8 ms to minimize.
[2024-06-01 14:45:04] [INFO ] Deduced a trap composed of 383 places in 512 ms of which 8 ms to minimize.
[2024-06-01 14:45:05] [INFO ] Deduced a trap composed of 64 places in 422 ms of which 6 ms to minimize.
[2024-06-01 14:45:05] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 1 ms to minimize.
[2024-06-01 14:45:06] [INFO ] Deduced a trap composed of 391 places in 466 ms of which 5 ms to minimize.
[2024-06-01 14:45:07] [INFO ] Deduced a trap composed of 495 places in 430 ms of which 4 ms to minimize.
[2024-06-01 14:45:07] [INFO ] Deduced a trap composed of 395 places in 418 ms of which 5 ms to minimize.
[2024-06-01 14:45:07] [INFO ] Deduced a trap composed of 381 places in 339 ms of which 4 ms to minimize.
[2024-06-01 14:45:08] [INFO ] Deduced a trap composed of 367 places in 315 ms of which 4 ms to minimize.
[2024-06-01 14:45:08] [INFO ] Deduced a trap composed of 233 places in 509 ms of which 8 ms to minimize.
[2024-06-01 14:45:09] [INFO ] Deduced a trap composed of 227 places in 505 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:45:14] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 3 ms to minimize.
[2024-06-01 14:45:15] [INFO ] Deduced a trap composed of 426 places in 444 ms of which 7 ms to minimize.
[2024-06-01 14:45:16] [INFO ] Deduced a trap composed of 395 places in 376 ms of which 4 ms to minimize.
[2024-06-01 14:45:16] [INFO ] Deduced a trap composed of 386 places in 395 ms of which 5 ms to minimize.
[2024-06-01 14:45:17] [INFO ] Deduced a trap composed of 399 places in 489 ms of which 7 ms to minimize.
[2024-06-01 14:45:17] [INFO ] Deduced a trap composed of 422 places in 366 ms of which 5 ms to minimize.
[2024-06-01 14:45:17] [INFO ] Deduced a trap composed of 438 places in 375 ms of which 4 ms to minimize.
[2024-06-01 14:45:18] [INFO ] Deduced a trap composed of 69 places in 171 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/2092 variables, and 68 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:45:46] [INFO ] Deduced a trap composed of 491 places in 543 ms of which 8 ms to minimize.
[2024-06-01 14:45:46] [INFO ] Deduced a trap composed of 494 places in 473 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2092 variables, and 70 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 30/30 constraints]
After SMT, in 62527ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 62552ms
Starting structural reductions in LTL mode, iteration 1 : 720/731 places, 1392/1403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100427 ms. Remains : 720/731 places, 1392/1403 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T10-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 537 ms.
Product exploration explored 100000 steps with 50000 reset in 528 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 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 24 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J04T10-LTLCardinality-04 finished in 101768 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)))))'
Support contains 3 out of 731 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 731/731 places, 1403/1403 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 731 transition count 1331
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 659 transition count 1331
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 144 place count 659 transition count 1252
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 302 place count 580 transition count 1252
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 303 place count 579 transition count 1251
Iterating global reduction 2 with 1 rules applied. Total rules applied 304 place count 579 transition count 1251
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 480 place count 491 transition count 1163
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 488 place count 483 transition count 1155
Iterating global reduction 2 with 8 rules applied. Total rules applied 496 place count 483 transition count 1155
Applied a total of 496 rules in 101 ms. Remains 483 /731 variables (removed 248) and now considering 1155/1403 (removed 248) transitions.
Running 1153 sub problems to find dead transitions.
[2024-06-01 14:45:50] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
// Phase 1: matrix 1135 rows 483 cols
[2024-06-01 14:45:50] [INFO ] Computed 42 invariants in 16 ms
[2024-06-01 14:45:50] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:46:00] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2024-06-01 14:46:00] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 1 ms to minimize.
[2024-06-01 14:46:00] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 2 ms to minimize.
[2024-06-01 14:46:00] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 0 ms to minimize.
[2024-06-01 14:46:00] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:46:00] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:46:00] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:46:01] [INFO ] Deduced a trap composed of 70 places in 341 ms of which 6 ms to minimize.
[2024-06-01 14:46:01] [INFO ] Deduced a trap composed of 96 places in 333 ms of which 5 ms to minimize.
[2024-06-01 14:46:01] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 0 ms to minimize.
[2024-06-01 14:46:02] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:46:02] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:46:02] [INFO ] Deduced a trap composed of 195 places in 313 ms of which 3 ms to minimize.
[2024-06-01 14:46:02] [INFO ] Deduced a trap composed of 185 places in 292 ms of which 4 ms to minimize.
[2024-06-01 14:46:03] [INFO ] Deduced a trap composed of 197 places in 257 ms of which 3 ms to minimize.
[2024-06-01 14:46:04] [INFO ] Deduced a trap composed of 194 places in 265 ms of which 3 ms to minimize.
[2024-06-01 14:46:04] [INFO ] Deduced a trap composed of 206 places in 385 ms of which 5 ms to minimize.
[2024-06-01 14:46:04] [INFO ] Deduced a trap composed of 197 places in 238 ms of which 3 ms to minimize.
[2024-06-01 14:46:05] [INFO ] Deduced a trap composed of 84 places in 206 ms of which 2 ms to minimize.
[2024-06-01 14:46:05] [INFO ] Deduced a trap composed of 326 places in 278 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:46:08] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 3 ms to minimize.
[2024-06-01 14:46:09] [INFO ] Deduced a trap composed of 321 places in 228 ms of which 3 ms to minimize.
[2024-06-01 14:46:09] [INFO ] Deduced a trap composed of 320 places in 293 ms of which 4 ms to minimize.
[2024-06-01 14:46:11] [INFO ] Deduced a trap composed of 307 places in 274 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/1618 variables, and 64 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 20062 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1153/1153 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/1618 variables, and 64 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1153 constraints, Known Traps: 24/24 constraints]
After SMT, in 42000ms problems are : Problem set: 0 solved, 1153 unsolved
Search for dead transitions found 0 dead transitions in 42013ms
[2024-06-01 14:46:32] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-06-01 14:46:32] [INFO ] Invariant cache hit.
[2024-06-01 14:46:32] [INFO ] Implicit Places using invariants in 536 ms returned []
[2024-06-01 14:46:32] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-06-01 14:46:32] [INFO ] Invariant cache hit.
[2024-06-01 14:46:33] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:46:48] [INFO ] Implicit Places using invariants and state equation in 15675 ms returned []
Implicit Place search using SMT with State Equation took 16227 ms to find 0 implicit places.
[2024-06-01 14:46:48] [INFO ] Redundant transitions in 15 ms returned []
Running 1153 sub problems to find dead transitions.
[2024-06-01 14:46:48] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-06-01 14:46:48] [INFO ] Invariant cache hit.
[2024-06-01 14:46:48] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:46:57] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 1 ms to minimize.
[2024-06-01 14:46:57] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:46:57] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:46:57] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 0 ms to minimize.
[2024-06-01 14:46:57] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 0 ms to minimize.
[2024-06-01 14:46:57] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 0 ms to minimize.
[2024-06-01 14:46:57] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:46:58] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:46:58] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:46:58] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 0 ms to minimize.
[2024-06-01 14:46:58] [INFO ] Deduced a trap composed of 71 places in 292 ms of which 4 ms to minimize.
[2024-06-01 14:46:59] [INFO ] Deduced a trap composed of 226 places in 280 ms of which 3 ms to minimize.
[2024-06-01 14:46:59] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 3 ms to minimize.
[2024-06-01 14:47:00] [INFO ] Deduced a trap composed of 194 places in 269 ms of which 3 ms to minimize.
[2024-06-01 14:47:00] [INFO ] Deduced a trap composed of 213 places in 275 ms of which 3 ms to minimize.
[2024-06-01 14:47:01] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 3 ms to minimize.
[2024-06-01 14:47:01] [INFO ] Deduced a trap composed of 124 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:47:02] [INFO ] Deduced a trap composed of 75 places in 288 ms of which 6 ms to minimize.
[2024-06-01 14:47:03] [INFO ] Deduced a trap composed of 180 places in 306 ms of which 4 ms to minimize.
[2024-06-01 14:47:05] [INFO ] Deduced a trap composed of 293 places in 283 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:47:13] [INFO ] Deduced a trap composed of 269 places in 369 ms of which 5 ms to minimize.
[2024-06-01 14:47:14] [INFO ] Deduced a trap composed of 217 places in 304 ms of which 3 ms to minimize.
[2024-06-01 14:47:15] [INFO ] Deduced a trap composed of 221 places in 261 ms of which 3 ms to minimize.
[2024-06-01 14:47:15] [INFO ] Deduced a trap composed of 210 places in 326 ms of which 5 ms to minimize.
[2024-06-01 14:47:16] [INFO ] Deduced a trap composed of 170 places in 297 ms of which 4 ms to minimize.
[2024-06-01 14:47:18] [INFO ] Deduced a trap composed of 211 places in 297 ms of which 3 ms to minimize.
[2024-06-01 14:47:18] [INFO ] Deduced a trap composed of 200 places in 298 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 (/ 15.0 4.0))
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 (/ 3.0 4.0))
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 (/ 3.0 4.0))
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 (/ 27.0 4.0))
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 (/ 1.0 4.0))
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 (/ 7.0 4.0))
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 (/ 3.0 4.0))
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 (/ 1.0 4.0))
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 (/ 13.0 4.0))
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 1.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 9.0)
(s420 1.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 (/ 15.0 2.0))
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 1.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/1618 variables, and 67 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1153/1153 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:47:38] [INFO ] Deduced a trap composed of 202 places in 341 ms of which 3 ms to minimize.
[2024-06-01 14:47:42] [INFO ] Deduced a trap composed of 228 places in 448 ms of which 4 ms to minimize.
[2024-06-01 14:47:42] [INFO ] Deduced a trap composed of 224 places in 318 ms of which 4 ms to minimize.
[2024-06-01 14:47:49] [INFO ] Deduced a trap composed of 157 places in 266 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/1618 variables, and 71 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1153 constraints, Known Traps: 31/31 constraints]
After SMT, in 61824ms problems are : Problem set: 0 solved, 1153 unsolved
Search for dead transitions found 0 dead transitions in 61833ms
Starting structural reductions in SI_LTL mode, iteration 1 : 483/731 places, 1155/1403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120209 ms. Remains : 483/731 places, 1155/1403 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S02J04T10-LTLCardinality-08
Product exploration explored 100000 steps with 28 reset in 639 ms.
Product exploration explored 100000 steps with 40 reset in 725 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 p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 159 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 30673 steps (16 resets) in 477 ms. (64 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 250 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 1155/1155 transitions.
Applied a total of 0 rules in 17 ms. Remains 483 /483 variables (removed 0) and now considering 1155/1155 (removed 0) transitions.
Running 1153 sub problems to find dead transitions.
[2024-06-01 14:47:52] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-06-01 14:47:52] [INFO ] Invariant cache hit.
[2024-06-01 14:47:52] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:48:03] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:48:03] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:48:04] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:48:04] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 2 ms to minimize.
[2024-06-01 14:48:04] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:48:04] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:48:04] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:48:04] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:48:04] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:48:04] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:48:05] [INFO ] Deduced a trap composed of 71 places in 393 ms of which 18 ms to minimize.
[2024-06-01 14:48:05] [INFO ] Deduced a trap composed of 226 places in 290 ms of which 4 ms to minimize.
[2024-06-01 14:48:05] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 3 ms to minimize.
[2024-06-01 14:48:06] [INFO ] Deduced a trap composed of 194 places in 265 ms of which 3 ms to minimize.
[2024-06-01 14:48:06] [INFO ] Deduced a trap composed of 213 places in 320 ms of which 3 ms to minimize.
[2024-06-01 14:48:06] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 3 ms to minimize.
[2024-06-01 14:48:07] [INFO ] Deduced a trap composed of 124 places in 182 ms of which 2 ms to minimize.
[2024-06-01 14:48:08] [INFO ] Deduced a trap composed of 75 places in 221 ms of which 3 ms to minimize.
[2024-06-01 14:48:08] [INFO ] Deduced a trap composed of 180 places in 278 ms of which 4 ms to minimize.
[2024-06-01 14:48:10] [INFO ] Deduced a trap composed of 293 places in 347 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/1618 variables, and 60 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1153/1153 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:48:28] [INFO ] Deduced a trap composed of 204 places in 311 ms of which 3 ms to minimize.
[2024-06-01 14:48:28] [INFO ] Deduced a trap composed of 223 places in 297 ms of which 3 ms to minimize.
[2024-06-01 14:48:31] [INFO ] Deduced a trap composed of 183 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:48:31] [INFO ] Deduced a trap composed of 213 places in 239 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/1618 variables, and 64 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1153 constraints, Known Traps: 24/24 constraints]
After SMT, in 41749ms problems are : Problem set: 0 solved, 1153 unsolved
Search for dead transitions found 0 dead transitions in 41761ms
[2024-06-01 14:48:34] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-06-01 14:48:34] [INFO ] Invariant cache hit.
[2024-06-01 14:48:35] [INFO ] Implicit Places using invariants in 730 ms returned []
[2024-06-01 14:48:35] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-06-01 14:48:35] [INFO ] Invariant cache hit.
[2024-06-01 14:48:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:48:48] [INFO ] Implicit Places using invariants and state equation in 13333 ms returned []
Implicit Place search using SMT with State Equation took 14065 ms to find 0 implicit places.
[2024-06-01 14:48:48] [INFO ] Redundant transitions in 15 ms returned []
Running 1153 sub problems to find dead transitions.
[2024-06-01 14:48:48] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-06-01 14:48:48] [INFO ] Invariant cache hit.
[2024-06-01 14:48:48] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:48:58] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-06-01 14:48:58] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:48:58] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:48:58] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:48:58] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:48:58] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:48:58] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:48:58] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:48:58] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:48:58] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:48:59] [INFO ] Deduced a trap composed of 71 places in 295 ms of which 3 ms to minimize.
[2024-06-01 14:48:59] [INFO ] Deduced a trap composed of 226 places in 293 ms of which 4 ms to minimize.
[2024-06-01 14:49:00] [INFO ] Deduced a trap composed of 196 places in 288 ms of which 4 ms to minimize.
[2024-06-01 14:49:00] [INFO ] Deduced a trap composed of 194 places in 260 ms of which 3 ms to minimize.
[2024-06-01 14:49:00] [INFO ] Deduced a trap composed of 213 places in 277 ms of which 3 ms to minimize.
[2024-06-01 14:49:00] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 2 ms to minimize.
[2024-06-01 14:49:01] [INFO ] Deduced a trap composed of 124 places in 185 ms of which 2 ms to minimize.
[2024-06-01 14:49:02] [INFO ] Deduced a trap composed of 75 places in 243 ms of which 3 ms to minimize.
[2024-06-01 14:49:02] [INFO ] Deduced a trap composed of 180 places in 263 ms of which 3 ms to minimize.
[2024-06-01 14:49:04] [INFO ] Deduced a trap composed of 293 places in 392 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:49:13] [INFO ] Deduced a trap composed of 269 places in 298 ms of which 4 ms to minimize.
[2024-06-01 14:49:13] [INFO ] Deduced a trap composed of 217 places in 294 ms of which 4 ms to minimize.
[2024-06-01 14:49:14] [INFO ] Deduced a trap composed of 221 places in 219 ms of which 2 ms to minimize.
[2024-06-01 14:49:14] [INFO ] Deduced a trap composed of 210 places in 248 ms of which 4 ms to minimize.
[2024-06-01 14:49:15] [INFO ] Deduced a trap composed of 170 places in 266 ms of which 4 ms to minimize.
[2024-06-01 14:49:17] [INFO ] Deduced a trap composed of 211 places in 276 ms of which 3 ms to minimize.
[2024-06-01 14:49:17] [INFO ] Deduced a trap composed of 200 places in 262 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 3.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 (/ 20.0 3.0))
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 9.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 (/ 1.0 3.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/1618 variables, and 67 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1153/1153 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:49:39] [INFO ] Deduced a trap composed of 202 places in 307 ms of which 4 ms to minimize.
[2024-06-01 14:49:43] [INFO ] Deduced a trap composed of 228 places in 305 ms of which 4 ms to minimize.
[2024-06-01 14:49:44] [INFO ] Deduced a trap composed of 224 places in 283 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/1618 variables, and 70 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1153 constraints, Known Traps: 30/30 constraints]
After SMT, in 62063ms problems are : Problem set: 0 solved, 1153 unsolved
Search for dead transitions found 0 dead transitions in 62078ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 117963 ms. Remains : 483/483 places, 1155/1155 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 : [(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 (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 169 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 34032 steps (15 resets) in 349 ms. (97 steps per ms) remains 0/4 properties
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 (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 228 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 47 reset in 471 ms.
Product exploration explored 100000 steps with 30 reset in 429 ms.
Support contains 3 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 1155/1155 transitions.
Applied a total of 0 rules in 18 ms. Remains 483 /483 variables (removed 0) and now considering 1155/1155 (removed 0) transitions.
Running 1153 sub problems to find dead transitions.
[2024-06-01 14:49:52] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-06-01 14:49:52] [INFO ] Invariant cache hit.
[2024-06-01 14:49:52] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 1 ms to minimize.
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 0 ms to minimize.
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 0 ms to minimize.
[2024-06-01 14:50:04] [INFO ] Deduced a trap composed of 71 places in 324 ms of which 4 ms to minimize.
[2024-06-01 14:50:04] [INFO ] Deduced a trap composed of 226 places in 448 ms of which 4 ms to minimize.
[2024-06-01 14:50:05] [INFO ] Deduced a trap composed of 196 places in 337 ms of which 6 ms to minimize.
[2024-06-01 14:50:05] [INFO ] Deduced a trap composed of 194 places in 278 ms of which 3 ms to minimize.
[2024-06-01 14:50:06] [INFO ] Deduced a trap composed of 213 places in 258 ms of which 3 ms to minimize.
[2024-06-01 14:50:06] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 2 ms to minimize.
[2024-06-01 14:50:07] [INFO ] Deduced a trap composed of 124 places in 192 ms of which 2 ms to minimize.
[2024-06-01 14:50:07] [INFO ] Deduced a trap composed of 75 places in 222 ms of which 2 ms to minimize.
[2024-06-01 14:50:08] [INFO ] Deduced a trap composed of 180 places in 268 ms of which 2 ms to minimize.
[2024-06-01 14:50:10] [INFO ] Deduced a trap composed of 293 places in 313 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/1618 variables, and 60 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1153/1153 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:50:28] [INFO ] Deduced a trap composed of 204 places in 321 ms of which 4 ms to minimize.
[2024-06-01 14:50:28] [INFO ] Deduced a trap composed of 223 places in 280 ms of which 4 ms to minimize.
[2024-06-01 14:50:31] [INFO ] Deduced a trap composed of 183 places in 267 ms of which 3 ms to minimize.
[2024-06-01 14:50:32] [INFO ] Deduced a trap composed of 213 places in 299 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/1618 variables, and 64 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1153 constraints, Known Traps: 24/24 constraints]
After SMT, in 42213ms problems are : Problem set: 0 solved, 1153 unsolved
Search for dead transitions found 0 dead transitions in 42221ms
[2024-06-01 14:50:34] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-06-01 14:50:34] [INFO ] Invariant cache hit.
[2024-06-01 14:50:35] [INFO ] Implicit Places using invariants in 782 ms returned []
[2024-06-01 14:50:35] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-06-01 14:50:35] [INFO ] Invariant cache hit.
[2024-06-01 14:50:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:50:48] [INFO ] Implicit Places using invariants and state equation in 12424 ms returned []
Implicit Place search using SMT with State Equation took 13210 ms to find 0 implicit places.
[2024-06-01 14:50:48] [INFO ] Redundant transitions in 44 ms returned []
Running 1153 sub problems to find dead transitions.
[2024-06-01 14:50:48] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-06-01 14:50:48] [INFO ] Invariant cache hit.
[2024-06-01 14:50:48] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:50:59] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2024-06-01 14:50:59] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:50:59] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:50:59] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 0 ms to minimize.
[2024-06-01 14:50:59] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 3 ms to minimize.
[2024-06-01 14:50:59] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:50:59] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:50:59] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:50:59] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:50:59] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:51:01] [INFO ] Deduced a trap composed of 71 places in 1232 ms of which 3 ms to minimize.
[2024-06-01 14:51:01] [INFO ] Deduced a trap composed of 226 places in 270 ms of which 2 ms to minimize.
[2024-06-01 14:51:01] [INFO ] Deduced a trap composed of 196 places in 305 ms of which 4 ms to minimize.
[2024-06-01 14:51:02] [INFO ] Deduced a trap composed of 194 places in 383 ms of which 3 ms to minimize.
[2024-06-01 14:51:02] [INFO ] Deduced a trap composed of 213 places in 256 ms of which 3 ms to minimize.
[2024-06-01 14:51:02] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 5 ms to minimize.
[2024-06-01 14:51:03] [INFO ] Deduced a trap composed of 124 places in 205 ms of which 5 ms to minimize.
[2024-06-01 14:51:04] [INFO ] Deduced a trap composed of 75 places in 255 ms of which 5 ms to minimize.
[2024-06-01 14:51:04] [INFO ] Deduced a trap composed of 180 places in 235 ms of which 3 ms to minimize.
[2024-06-01 14:51:06] [INFO ] Deduced a trap composed of 293 places in 278 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:51:17] [INFO ] Deduced a trap composed of 269 places in 325 ms of which 4 ms to minimize.
[2024-06-01 14:51:18] [INFO ] Deduced a trap composed of 217 places in 404 ms of which 5 ms to minimize.
[2024-06-01 14:51:19] [INFO ] Deduced a trap composed of 221 places in 400 ms of which 17 ms to minimize.
[2024-06-01 14:51:19] [INFO ] Deduced a trap composed of 210 places in 238 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/1618 variables, and 64 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1153/1153 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:51:45] [INFO ] Deduced a trap composed of 156 places in 320 ms of which 4 ms to minimize.
[2024-06-01 14:51:47] [INFO ] Deduced a trap composed of 210 places in 334 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/1618 variables, and 66 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1153 constraints, Known Traps: 26/26 constraints]
After SMT, in 62025ms problems are : Problem set: 0 solved, 1153 unsolved
Search for dead transitions found 0 dead transitions in 62042ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 117557 ms. Remains : 483/483 places, 1155/1155 transitions.
Treatment of property PolyORBLF-PT-S02J04T10-LTLCardinality-08 finished in 360182 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))))'
Support contains 2 out of 731 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 731/731 places, 1403/1403 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 721 transition count 1393
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 721 transition count 1393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 720 transition count 1392
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 720 transition count 1392
Applied a total of 22 rules in 36 ms. Remains 720 /731 variables (removed 11) and now considering 1392/1403 (removed 11) transitions.
Running 1390 sub problems to find dead transitions.
[2024-06-01 14:51:50] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 720 cols
[2024-06-01 14:51:50] [INFO ] Computed 42 invariants in 34 ms
[2024-06-01 14:51:50] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:52:06] [INFO ] Deduced a trap composed of 64 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:52:06] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 1 ms to minimize.
[2024-06-01 14:52:06] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:52:07] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:52:07] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:52:07] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:52:07] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 2 ms to minimize.
[2024-06-01 14:52:07] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:52:07] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:52:08] [INFO ] Deduced a trap composed of 383 places in 446 ms of which 5 ms to minimize.
[2024-06-01 14:52:08] [INFO ] Deduced a trap composed of 64 places in 154 ms of which 1 ms to minimize.
[2024-06-01 14:52:09] [INFO ] Deduced a trap composed of 490 places in 476 ms of which 3 ms to minimize.
[2024-06-01 14:52:10] [INFO ] Deduced a trap composed of 207 places in 585 ms of which 4 ms to minimize.
[2024-06-01 14:52:10] [INFO ] Deduced a trap composed of 274 places in 408 ms of which 4 ms to minimize.
[2024-06-01 14:52:11] [INFO ] Deduced a trap composed of 227 places in 362 ms of which 4 ms to minimize.
[2024-06-01 14:52:11] [INFO ] Deduced a trap composed of 151 places in 435 ms of which 4 ms to minimize.
[2024-06-01 14:52:12] [INFO ] Deduced a trap composed of 204 places in 393 ms of which 4 ms to minimize.
[2024-06-01 14:52:13] [INFO ] Deduced a trap composed of 494 places in 579 ms of which 22 ms to minimize.
SMT process timed out in 22712ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 22726ms
[2024-06-01 14:52:13] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:52:13] [INFO ] Invariant cache hit.
[2024-06-01 14:52:13] [INFO ] Implicit Places using invariants in 722 ms returned []
[2024-06-01 14:52:13] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:52:13] [INFO ] Invariant cache hit.
[2024-06-01 14:52:15] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:52:33] [INFO ] Implicit Places using invariants and state equation in 19901 ms returned []
Implicit Place search using SMT with State Equation took 20646 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2024-06-01 14:52:33] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:52:33] [INFO ] Invariant cache hit.
[2024-06-01 14:52:33] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:52:51] [INFO ] Deduced a trap composed of 64 places in 141 ms of which 4 ms to minimize.
[2024-06-01 14:52:51] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2024-06-01 14:52:51] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2024-06-01 14:52:51] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 0 ms to minimize.
[2024-06-01 14:52:51] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:52:51] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:52:51] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:52:51] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:52:52] [INFO ] Deduced a trap composed of 383 places in 429 ms of which 5 ms to minimize.
[2024-06-01 14:52:52] [INFO ] Deduced a trap composed of 357 places in 418 ms of which 5 ms to minimize.
[2024-06-01 14:52:53] [INFO ] Deduced a trap composed of 383 places in 356 ms of which 4 ms to minimize.
[2024-06-01 14:52:53] [INFO ] Deduced a trap composed of 64 places in 323 ms of which 4 ms to minimize.
[2024-06-01 14:52:53] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:52:54] [INFO ] Deduced a trap composed of 391 places in 393 ms of which 6 ms to minimize.
[2024-06-01 14:52:54] [INFO ] Deduced a trap composed of 495 places in 362 ms of which 5 ms to minimize.
[2024-06-01 14:52:55] [INFO ] Deduced a trap composed of 395 places in 302 ms of which 4 ms to minimize.
[2024-06-01 14:52:55] [INFO ] Deduced a trap composed of 381 places in 387 ms of which 5 ms to minimize.
[2024-06-01 14:52:55] [INFO ] Deduced a trap composed of 367 places in 335 ms of which 4 ms to minimize.
[2024-06-01 14:52:56] [INFO ] Deduced a trap composed of 233 places in 435 ms of which 5 ms to minimize.
[2024-06-01 14:52:57] [INFO ] Deduced a trap composed of 227 places in 369 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:52:59] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 3 ms to minimize.
[2024-06-01 14:53:01] [INFO ] Deduced a trap composed of 426 places in 432 ms of which 8 ms to minimize.
[2024-06-01 14:53:01] [INFO ] Deduced a trap composed of 395 places in 470 ms of which 6 ms to minimize.
[2024-06-01 14:53:02] [INFO ] Deduced a trap composed of 386 places in 464 ms of which 6 ms to minimize.
[2024-06-01 14:53:02] [INFO ] Deduced a trap composed of 399 places in 439 ms of which 5 ms to minimize.
[2024-06-01 14:53:03] [INFO ] Deduced a trap composed of 422 places in 349 ms of which 4 ms to minimize.
[2024-06-01 14:53:03] [INFO ] Deduced a trap composed of 438 places in 314 ms of which 3 ms to minimize.
[2024-06-01 14:53:03] [INFO ] Deduced a trap composed of 69 places in 195 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/2092 variables, and 68 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:53:30] [INFO ] Deduced a trap composed of 491 places in 385 ms of which 5 ms to minimize.
[2024-06-01 14:53:30] [INFO ] Deduced a trap composed of 494 places in 332 ms of which 4 ms to minimize.
[2024-06-01 14:53:33] [INFO ] Deduced a trap composed of 425 places in 514 ms of which 5 ms to minimize.
[2024-06-01 14:53:35] [INFO ] Deduced a trap composed of 460 places in 479 ms of which 6 ms to minimize.
SMT process timed out in 62211ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 62235ms
Starting structural reductions in LTL mode, iteration 1 : 720/731 places, 1392/1403 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105657 ms. Remains : 720/731 places, 1392/1403 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T10-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T10-LTLCardinality-11 finished in 105897 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 1 out of 731 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 731/731 places, 1403/1403 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 731 transition count 1334
Reduce places removed 69 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 139 place count 662 transition count 1333
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 661 transition count 1333
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 140 place count 661 transition count 1252
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 302 place count 580 transition count 1252
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 303 place count 579 transition count 1251
Iterating global reduction 3 with 1 rules applied. Total rules applied 304 place count 579 transition count 1251
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 480 place count 491 transition count 1163
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 488 place count 483 transition count 1155
Iterating global reduction 3 with 8 rules applied. Total rules applied 496 place count 483 transition count 1155
Applied a total of 496 rules in 221 ms. Remains 483 /731 variables (removed 248) and now considering 1155/1403 (removed 248) transitions.
Running 1153 sub problems to find dead transitions.
[2024-06-01 14:53:36] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
// Phase 1: matrix 1135 rows 483 cols
[2024-06-01 14:53:36] [INFO ] Computed 42 invariants in 30 ms
[2024-06-01 14:53:36] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:53:47] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 1 ms to minimize.
[2024-06-01 14:53:47] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:53:47] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:53:48] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:53:48] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 0 ms to minimize.
[2024-06-01 14:53:48] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:53:48] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:53:48] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:53:48] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:53:48] [INFO ] Deduced a trap composed of 198 places in 301 ms of which 4 ms to minimize.
[2024-06-01 14:53:49] [INFO ] Deduced a trap composed of 195 places in 260 ms of which 3 ms to minimize.
[2024-06-01 14:53:49] [INFO ] Deduced a trap composed of 289 places in 265 ms of which 3 ms to minimize.
[2024-06-01 14:53:49] [INFO ] Deduced a trap composed of 187 places in 318 ms of which 3 ms to minimize.
[2024-06-01 14:53:49] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 0 ms to minimize.
[2024-06-01 14:53:50] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 3 ms to minimize.
[2024-06-01 14:53:51] [INFO ] Deduced a trap composed of 50 places in 286 ms of which 3 ms to minimize.
[2024-06-01 14:53:51] [INFO ] Deduced a trap composed of 107 places in 285 ms of which 4 ms to minimize.
[2024-06-01 14:53:52] [INFO ] Deduced a trap composed of 175 places in 278 ms of which 3 ms to minimize.
[2024-06-01 14:53:54] [INFO ] Deduced a trap composed of 310 places in 212 ms of which 3 ms to minimize.
[2024-06-01 14:53:55] [INFO ] Deduced a trap composed of 310 places in 271 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/1618 variables, and 60 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1153/1153 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:54:08] [INFO ] Deduced a trap composed of 225 places in 370 ms of which 5 ms to minimize.
[2024-06-01 14:54:08] [INFO ] Deduced a trap composed of 209 places in 345 ms of which 4 ms to minimize.
[2024-06-01 14:54:09] [INFO ] Deduced a trap composed of 186 places in 345 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/1618 variables, and 63 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1153 constraints, Known Traps: 23/23 constraints]
After SMT, in 42518ms problems are : Problem set: 0 solved, 1153 unsolved
Search for dead transitions found 0 dead transitions in 42543ms
[2024-06-01 14:54:18] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-06-01 14:54:18] [INFO ] Invariant cache hit.
[2024-06-01 14:54:19] [INFO ] Implicit Places using invariants in 561 ms returned []
[2024-06-01 14:54:19] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-06-01 14:54:19] [INFO ] Invariant cache hit.
[2024-06-01 14:54:20] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:54:30] [INFO ] Implicit Places using invariants and state equation in 11065 ms returned []
Implicit Place search using SMT with State Equation took 11641 ms to find 0 implicit places.
[2024-06-01 14:54:30] [INFO ] Redundant transitions in 16 ms returned []
Running 1153 sub problems to find dead transitions.
[2024-06-01 14:54:30] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-06-01 14:54:30] [INFO ] Invariant cache hit.
[2024-06-01 14:54:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:54:42] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-06-01 14:54:42] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 1 ms to minimize.
[2024-06-01 14:54:42] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:54:42] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:54:42] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:54:42] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:54:42] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:54:42] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:54:43] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 0 ms to minimize.
[2024-06-01 14:54:43] [INFO ] Deduced a trap composed of 308 places in 272 ms of which 4 ms to minimize.
[2024-06-01 14:54:43] [INFO ] Deduced a trap composed of 67 places in 297 ms of which 3 ms to minimize.
[2024-06-01 14:54:44] [INFO ] Deduced a trap composed of 107 places in 266 ms of which 4 ms to minimize.
[2024-06-01 14:54:44] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:54:44] [INFO ] Deduced a trap composed of 184 places in 284 ms of which 4 ms to minimize.
[2024-06-01 14:54:45] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 5 ms to minimize.
[2024-06-01 14:54:45] [INFO ] Deduced a trap composed of 195 places in 307 ms of which 2 ms to minimize.
[2024-06-01 14:54:46] [INFO ] Deduced a trap composed of 86 places in 210 ms of which 4 ms to minimize.
[2024-06-01 14:54:47] [INFO ] Deduced a trap composed of 293 places in 315 ms of which 2 ms to minimize.
[2024-06-01 14:54:49] [INFO ] Deduced a trap composed of 184 places in 218 ms of which 2 ms to minimize.
[2024-06-01 14:54:49] [INFO ] Deduced a trap composed of 179 places in 209 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:54:50] [INFO ] Deduced a trap composed of 204 places in 133 ms of which 2 ms to minimize.
[2024-06-01 14:54:50] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:54:56] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 3 ms to minimize.
[2024-06-01 14:54:56] [INFO ] Deduced a trap composed of 298 places in 255 ms of which 3 ms to minimize.
[2024-06-01 14:54:59] [INFO ] Deduced a trap composed of 224 places in 345 ms of which 4 ms to minimize.
[2024-06-01 14:54:59] [INFO ] Deduced a trap composed of 226 places in 298 ms of which 3 ms to minimize.
[2024-06-01 14:55:02] [INFO ] Deduced a trap composed of 199 places in 295 ms of which 4 ms to minimize.
[2024-06-01 14:55:02] [INFO ] Deduced a trap composed of 216 places in 236 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/1618 variables, and 68 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1153/1153 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:55:26] [INFO ] Deduced a trap composed of 233 places in 370 ms of which 6 ms to minimize.
[2024-06-01 14:55:27] [INFO ] Deduced a trap composed of 182 places in 355 ms of which 5 ms to minimize.
[2024-06-01 14:55:27] [INFO ] Deduced a trap composed of 219 places in 373 ms of which 31 ms to minimize.
[2024-06-01 14:55:27] [INFO ] Deduced a trap composed of 227 places in 340 ms of which 5 ms to minimize.
[2024-06-01 14:55:28] [INFO ] Deduced a trap composed of 209 places in 336 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/1618 variables, and 73 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1153 constraints, Known Traps: 33/33 constraints]
After SMT, in 62369ms problems are : Problem set: 0 solved, 1153 unsolved
Search for dead transitions found 0 dead transitions in 62378ms
Starting structural reductions in SI_LTL mode, iteration 1 : 483/731 places, 1155/1403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116839 ms. Remains : 483/731 places, 1155/1403 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T10-LTLCardinality-14
Product exploration explored 100000 steps with 287 reset in 834 ms.
Product exploration explored 100000 steps with 290 reset in 690 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 96 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 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 153 steps (0 resets) in 5 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 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 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 1155/1155 transitions.
Applied a total of 0 rules in 25 ms. Remains 483 /483 variables (removed 0) and now considering 1155/1155 (removed 0) transitions.
Running 1153 sub problems to find dead transitions.
[2024-06-01 14:55:35] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-06-01 14:55:35] [INFO ] Invariant cache hit.
[2024-06-01 14:55:35] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:55:46] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 1 ms to minimize.
[2024-06-01 14:55:46] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 1 ms to minimize.
[2024-06-01 14:55:46] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:55:46] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:55:46] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:55:46] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:55:46] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:55:46] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:55:46] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:55:47] [INFO ] Deduced a trap composed of 308 places in 384 ms of which 6 ms to minimize.
[2024-06-01 14:55:47] [INFO ] Deduced a trap composed of 67 places in 255 ms of which 3 ms to minimize.
[2024-06-01 14:55:47] [INFO ] Deduced a trap composed of 107 places in 320 ms of which 3 ms to minimize.
[2024-06-01 14:55:47] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:55:48] [INFO ] Deduced a trap composed of 184 places in 250 ms of which 3 ms to minimize.
[2024-06-01 14:55:48] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 1 ms to minimize.
[2024-06-01 14:55:48] [INFO ] Deduced a trap composed of 195 places in 234 ms of which 2 ms to minimize.
[2024-06-01 14:55:49] [INFO ] Deduced a trap composed of 86 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:55:50] [INFO ] Deduced a trap composed of 293 places in 254 ms of which 4 ms to minimize.
[2024-06-01 14:55:51] [INFO ] Deduced a trap composed of 184 places in 308 ms of which 3 ms to minimize.
[2024-06-01 14:55:52] [INFO ] Deduced a trap composed of 179 places in 278 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:55:53] [INFO ] Deduced a trap composed of 204 places in 210 ms of which 2 ms to minimize.
[2024-06-01 14:55:53] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/1618 variables, and 62 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1153/1153 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 22/62 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:56:10] [INFO ] Deduced a trap composed of 227 places in 374 ms of which 4 ms to minimize.
[2024-06-01 14:56:10] [INFO ] Deduced a trap composed of 212 places in 332 ms of which 4 ms to minimize.
[2024-06-01 14:56:11] [INFO ] Deduced a trap composed of 214 places in 297 ms of which 3 ms to minimize.
[2024-06-01 14:56:11] [INFO ] Deduced a trap composed of 232 places in 306 ms of which 4 ms to minimize.
[2024-06-01 14:56:11] [INFO ] Deduced a trap composed of 220 places in 265 ms of which 3 ms to minimize.
[2024-06-01 14:56:12] [INFO ] Deduced a trap composed of 224 places in 265 ms of which 2 ms to minimize.
[2024-06-01 14:56:16] [INFO ] Deduced a trap composed of 74 places in 170 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/1618 variables, and 69 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1153 constraints, Known Traps: 29/29 constraints]
After SMT, in 42444ms problems are : Problem set: 0 solved, 1153 unsolved
Search for dead transitions found 0 dead transitions in 42457ms
[2024-06-01 14:56:17] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-06-01 14:56:17] [INFO ] Invariant cache hit.
[2024-06-01 14:56:18] [INFO ] Implicit Places using invariants in 625 ms returned []
[2024-06-01 14:56:18] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-06-01 14:56:18] [INFO ] Invariant cache hit.
[2024-06-01 14:56:19] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:56:28] [INFO ] Implicit Places using invariants and state equation in 10682 ms returned []
Implicit Place search using SMT with State Equation took 11308 ms to find 0 implicit places.
[2024-06-01 14:56:28] [INFO ] Redundant transitions in 15 ms returned []
Running 1153 sub problems to find dead transitions.
[2024-06-01 14:56:29] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-06-01 14:56:29] [INFO ] Invariant cache hit.
[2024-06-01 14:56:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:56:39] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:56:39] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:56:39] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:56:40] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:56:40] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:56:40] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:56:40] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:56:40] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:56:40] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:56:40] [INFO ] Deduced a trap composed of 308 places in 322 ms of which 3 ms to minimize.
[2024-06-01 14:56:41] [INFO ] Deduced a trap composed of 67 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:56:41] [INFO ] Deduced a trap composed of 107 places in 325 ms of which 3 ms to minimize.
[2024-06-01 14:56:41] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:56:42] [INFO ] Deduced a trap composed of 184 places in 340 ms of which 4 ms to minimize.
[2024-06-01 14:56:42] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 3 ms to minimize.
[2024-06-01 14:56:42] [INFO ] Deduced a trap composed of 195 places in 258 ms of which 4 ms to minimize.
[2024-06-01 14:56:43] [INFO ] Deduced a trap composed of 86 places in 238 ms of which 4 ms to minimize.
[2024-06-01 14:56:44] [INFO ] Deduced a trap composed of 293 places in 373 ms of which 6 ms to minimize.
[2024-06-01 14:56:46] [INFO ] Deduced a trap composed of 184 places in 348 ms of which 7 ms to minimize.
[2024-06-01 14:56:46] [INFO ] Deduced a trap composed of 179 places in 324 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:56:47] [INFO ] Deduced a trap composed of 204 places in 226 ms of which 3 ms to minimize.
[2024-06-01 14:56:47] [INFO ] Deduced a trap composed of 37 places in 238 ms of which 4 ms to minimize.
[2024-06-01 14:56:54] [INFO ] Deduced a trap composed of 23 places in 274 ms of which 4 ms to minimize.
[2024-06-01 14:56:54] [INFO ] Deduced a trap composed of 298 places in 281 ms of which 3 ms to minimize.
[2024-06-01 14:56:56] [INFO ] Deduced a trap composed of 224 places in 376 ms of which 5 ms to minimize.
[2024-06-01 14:56:57] [INFO ] Deduced a trap composed of 226 places in 294 ms of which 3 ms to minimize.
[2024-06-01 14:56:58] [INFO ] Deduced a trap composed of 199 places in 315 ms of which 3 ms to minimize.
[2024-06-01 14:56:58] [INFO ] Deduced a trap composed of 216 places in 361 ms of which 8 ms to minimize.
[2024-06-01 14:57:00] [INFO ] Deduced a trap composed of 237 places in 296 ms of which 3 ms to minimize.
[2024-06-01 14:57:00] [INFO ] Deduced a trap composed of 240 places in 263 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/1618 variables, and 70 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1153/1153 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 30/70 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:57:10] [INFO ] Deduced a trap composed of 186 places in 333 ms of which 3 ms to minimize.
[2024-06-01 14:57:11] [INFO ] Deduced a trap composed of 226 places in 317 ms of which 3 ms to minimize.
[2024-06-01 14:57:11] [INFO ] Deduced a trap composed of 195 places in 330 ms of which 3 ms to minimize.
[2024-06-01 14:57:21] [INFO ] Deduced a trap composed of 210 places in 333 ms of which 4 ms to minimize.
[2024-06-01 14:57:21] [INFO ] Deduced a trap composed of 218 places in 283 ms of which 4 ms to minimize.
[2024-06-01 14:57:22] [INFO ] Deduced a trap composed of 216 places in 316 ms of which 4 ms to minimize.
[2024-06-01 14:57:22] [INFO ] Deduced a trap composed of 231 places in 295 ms of which 3 ms to minimize.
[2024-06-01 14:57:22] [INFO ] Deduced a trap composed of 231 places in 271 ms of which 3 ms to minimize.
[2024-06-01 14:57:23] [INFO ] Deduced a trap composed of 240 places in 278 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/1618 variables, and 79 constraints, problems are : Problem set: 0 solved, 1153 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/483 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1153 constraints, Known Traps: 39/39 constraints]
After SMT, in 61998ms problems are : Problem set: 0 solved, 1153 unsolved
Search for dead transitions found 0 dead transitions in 62011ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 115842 ms. Remains : 483/483 places, 1155/1155 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 115 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 88 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 250 steps (0 resets) in 6 ms. (35 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 83 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 312 reset in 504 ms.
Product exploration explored 100000 steps with 325 reset in 650 ms.
Support contains 1 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 1155/1155 transitions.
Applied a total of 0 rules in 36 ms. Remains 483 /483 variables (removed 0) and now considering 1155/1155 (removed 0) transitions.
Running 1153 sub problems to find dead transitions.
[2024-06-01 14:57:32] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-06-01 14:57:32] [INFO ] Invariant cache hit.
[2024-06-01 14:57:32] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
SMT process timed out in 22560ms, After SMT, problems are : Problem set: 0 solved, 1153 unsolved
Search for dead transitions found 0 dead transitions in 22577ms
[2024-06-01 14:57:55] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-06-01 14:57:55] [INFO ] Invariant cache hit.
[2024-06-01 14:57:56] [INFO ] Implicit Places using invariants in 894 ms returned []
[2024-06-01 14:57:56] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-06-01 14:57:56] [INFO ] Invariant cache hit.
[2024-06-01 14:57:57] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:58:07] [INFO ] Implicit Places using invariants and state equation in 11649 ms returned []
Implicit Place search using SMT with State Equation took 12548 ms to find 0 implicit places.
[2024-06-01 14:58:07] [INFO ] Redundant transitions in 17 ms returned []
Running 1153 sub problems to find dead transitions.
[2024-06-01 14:58:07] [INFO ] Flow matrix only has 1135 transitions (discarded 20 similar events)
[2024-06-01 14:58:07] [INFO ] Invariant cache hit.
[2024-06-01 14:58:07] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:58:18] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-06-01 14:58:18] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:58:18] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:58:18] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 1 ms to minimize.
[2024-06-01 14:58:18] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2024-06-01 14:58:18] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:58:18] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:58:19] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 0 ms to minimize.
[2024-06-01 14:58:19] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:58:19] [INFO ] Deduced a trap composed of 308 places in 259 ms of which 3 ms to minimize.
[2024-06-01 14:58:19] [INFO ] Deduced a trap composed of 67 places in 313 ms of which 3 ms to minimize.
[2024-06-01 14:58:20] [INFO ] Deduced a trap composed of 107 places in 237 ms of which 3 ms to minimize.
[2024-06-01 14:58:20] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 0 ms to minimize.
[2024-06-01 14:58:20] [INFO ] Deduced a trap composed of 184 places in 342 ms of which 5 ms to minimize.
[2024-06-01 14:58:21] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 3 ms to minimize.
[2024-06-01 14:58:21] [INFO ] Deduced a trap composed of 195 places in 337 ms of which 3 ms to minimize.
[2024-06-01 14:58:22] [INFO ] Deduced a trap composed of 86 places in 211 ms of which 3 ms to minimize.
[2024-06-01 14:58:23] [INFO ] Deduced a trap composed of 293 places in 310 ms of which 3 ms to minimize.
[2024-06-01 14:58:24] [INFO ] Deduced a trap composed of 184 places in 259 ms of which 3 ms to minimize.
[2024-06-01 14:58:24] [INFO ] Deduced a trap composed of 179 places in 221 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1153 unsolved
[2024-06-01 14:58:26] [INFO ] Deduced a trap composed of 204 places in 183 ms of which 2 ms to minimize.
[2024-06-01 14:58:26] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 3 ms to minimize.
[2024-06-01 14:58:34] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 5 ms to minimize.
[2024-06-01 14:58:34] [INFO ] Deduced a trap composed of 298 places in 338 ms of which 5 ms to minimize.
[2024-06-01 14:58:36] [INFO ] Deduced a trap composed of 224 places in 356 ms of which 8 ms to minimize.
[2024-06-01 14:58:37] [INFO ] Deduced a trap composed of 226 places in 295 ms of which 3 ms to minimize.
[2024-06-01 14:58:38] [INFO ] Deduced a trap composed of 199 places in 317 ms of which 6 ms to minimize.
[2024-06-01 14:58:38] [INFO ] Deduced a trap composed of 216 places in 325 ms of which 6 ms to minimize.
[2024-06-01 14:58:40] [INFO ] Deduced a trap composed of 237 places in 338 ms of which 3 ms to minimize.
SMT process timed out in 32606ms, After SMT, problems are : Problem set: 0 solved, 1153 unsolved
Search for dead transitions found 0 dead transitions in 32616ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67819 ms. Remains : 483/483 places, 1155/1155 transitions.
Treatment of property PolyORBLF-PT-S02J04T10-LTLCardinality-14 finished in 304421 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))'
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)))))'
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)))'
[2024-06-01 14:58:41] [INFO ] Flatten gal took : 104 ms
[2024-06-01 14:58:41] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 14:58:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 731 places, 1403 transitions and 6082 arcs took 15 ms.
Total runtime 1431811 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-LTLCardinality-02
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-LTLCardinality-08
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-LTLCardinality-14

BK_STOP 1717254553142

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 PolyORBLF-PT-S02J04T10-LTLCardinality-02
ltl formula formula --ltl=/tmp/3430/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 731 places, 1403 transitions and 6082 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3430/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3430/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.060 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3430/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3430/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 746 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 732, there are 1405 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( 1/ 4): ~73 levels ~10000 states ~12352 transitions
pnml2lts-mc( 1/ 4): ~115 levels ~20000 states ~23904 transitions
pnml2lts-mc( 1/ 4): ~119 levels ~40000 states ~49500 transitions
pnml2lts-mc( 1/ 4): ~119 levels ~80000 states ~101832 transitions
pnml2lts-mc( 1/ 4): ~119 levels ~160000 states ~207216 transitions
pnml2lts-mc( 1/ 4): ~119 levels ~320000 states ~418492 transitions
pnml2lts-mc( 2/ 4): ~119 levels ~640000 states ~867932 transitions
pnml2lts-mc( 1/ 4): ~119 levels ~1280000 states ~2030656 transitions
pnml2lts-mc( 1/ 4): ~119 levels ~2560000 states ~4283740 transitions
pnml2lts-mc( 1/ 4): ~119 levels ~5120000 states ~8684752 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8622857
pnml2lts-mc( 0/ 4): unique states count: 8623130
pnml2lts-mc( 0/ 4): unique transitions count: 14907265
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 6284174
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8623615
pnml2lts-mc( 0/ 4): - cum. max stack depth: 476
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8623615 states 14908536 transitions, fanout: 1.729
pnml2lts-mc( 0/ 4): Total exploration time 263.340 sec (263.280 sec minimum, 263.305 sec on average)
pnml2lts-mc( 0/ 4): States per second: 32747, Transitions per second: 56613
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 129.8MB, 15.8 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 25.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1433 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 129.8MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S02J04T10-LTLCardinality-08
ltl formula formula --ltl=/tmp/3430/ltl_1_
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 731 places, 1403 transitions and 6082 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.260 real 0.060 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3430/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3430/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3430/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3430/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 745 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 732, there are 1409 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): ~2276 levels ~10000 states ~16676 transitions
pnml2lts-mc( 0/ 4): ~4610 levels ~20000 states ~33092 transitions
pnml2lts-mc( 0/ 4): ~9354 levels ~40000 states ~69512 transitions
pnml2lts-mc( 0/ 4): ~18428 levels ~80000 states ~140708 transitions
pnml2lts-mc( 0/ 4): ~36401 levels ~160000 states ~284564 transitions
pnml2lts-mc( 2/ 4): ~67826 levels ~320000 states ~634092 transitions
pnml2lts-mc( 0/ 4): ~135046 levels ~640000 states ~1179204 transitions
pnml2lts-mc( 0/ 4): ~261746 levels ~1280000 states ~2451532 transitions
pnml2lts-mc( 0/ 4): ~505480 levels ~2560000 states ~4941696 transitions
pnml2lts-mc( 2/ 4): ~969281 levels ~5120000 states ~10594028 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6579
pnml2lts-mc( 0/ 4): unique states count: 4931144
pnml2lts-mc( 0/ 4): unique transitions count: 9576431
pnml2lts-mc( 0/ 4): - self-loop count: 542
pnml2lts-mc( 0/ 4): - claim dead count: 9
pnml2lts-mc( 0/ 4): - claim found count: 1396687
pnml2lts-mc( 0/ 4): - claim success count: 4931181
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3685725
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4931183 states 9576537 transitions, fanout: 1.942
pnml2lts-mc( 0/ 4): Total exploration time 182.680 sec (182.660 sec minimum, 182.665 sec on average)
pnml2lts-mc( 0/ 4): States per second: 26994, Transitions per second: 52422
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 124.1MB, 16.5 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 23.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1433 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 124.1MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S02J04T10-LTLCardinality-14
ltl formula formula --ltl=/tmp/3430/ltl_2_
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 731 places, 1403 transitions and 6082 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.220 real 0.070 user 0.050 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3430/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3430/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3430/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3430/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 746 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 732, there are 1406 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( 3/ 4): ~2445 levels ~10000 states ~20020 transitions
pnml2lts-mc( 3/ 4): ~4839 levels ~20000 states ~38432 transitions
pnml2lts-mc( 3/ 4): ~9545 levels ~40000 states ~77980 transitions
pnml2lts-mc( 2/ 4): ~19259 levels ~80000 states ~169772 transitions
pnml2lts-mc( 2/ 4): ~36748 levels ~160000 states ~325952 transitions
pnml2lts-mc( 2/ 4): ~70179 levels ~320000 states ~653332 transitions
pnml2lts-mc( 2/ 4): ~129569 levels ~640000 states ~1258864 transitions
pnml2lts-mc( 2/ 4): ~236317 levels ~1280000 states ~2452524 transitions
pnml2lts-mc( 2/ 4): ~429240 levels ~2560000 states ~4867236 transitions
pnml2lts-mc( 2/ 4): ~902283 levels ~5120000 states ~10066316 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 11487
pnml2lts-mc( 0/ 4): unique states count: 5182767
pnml2lts-mc( 0/ 4): unique transitions count: 10149198
pnml2lts-mc( 0/ 4): - self-loop count: 513
pnml2lts-mc( 0/ 4): - claim dead count: 930
pnml2lts-mc( 0/ 4): - claim found count: 1702478
pnml2lts-mc( 0/ 4): - claim success count: 5182793
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3524180
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5182824 states 10149289 transitions, fanout: 1.958
pnml2lts-mc( 0/ 4): Total exploration time 182.050 sec (182.030 sec minimum, 182.035 sec on average)
pnml2lts-mc( 0/ 4): States per second: 28469, Transitions per second: 55750
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 125.9MB, 16.3 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 24.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1433 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 125.9MB (~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="PolyORBLF-PT-S02J04T10"
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 PolyORBLF-PT-S02J04T10, 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 r516-tajo-171654446700235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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