About the Execution of LTSMin+red for PolyORBNT-PT-S05J60
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6180.455 | 1543500.00 | 2491210.00 | 303.20 | FTTTFFF?FFFFFTTF | normal |
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-171654447200467.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBNT-PT-S05J60, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447200467
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 27K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 47K Apr 12 09:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 242K Apr 12 09:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106K Apr 12 10:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 436K Apr 12 10:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.5M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-00
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-01
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-02
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-03
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-04
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-05
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-06
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-07
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-08
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-09
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-10
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-11
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-12
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-13
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-14
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717260445293
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J60
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:47:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:47:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:47:27] [INFO ] Load time of PNML (sax parser for PT used): 216 ms
[2024-06-01 16:47:27] [INFO ] Transformed 909 places.
[2024-06-01 16:47:27] [INFO ] Transformed 1970 transitions.
[2024-06-01 16:47:27] [INFO ] Parsed PT model containing 909 places and 1970 transitions and 12584 arcs in 354 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 519 out of 909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1315
Applied a total of 5 rules in 84 ms. Remains 904 /909 variables (removed 5) and now considering 1315/1315 (removed 0) transitions.
Running 1309 sub problems to find dead transitions.
[2024-06-01 16:47:27] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 904 cols
[2024-06-01 16:47:27] [INFO ] Computed 137 invariants in 105 ms
[2024-06-01 16:47:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1309 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 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20096 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints]
After SMT, in 43594ms problems are : Problem set: 0 solved, 1309 unsolved
Search for dead transitions found 0 dead transitions in 43640ms
[2024-06-01 16:48:11] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-06-01 16:48:11] [INFO ] Invariant cache hit.
[2024-06-01 16:48:11] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-06-01 16:48:11] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-06-01 16:48:11] [INFO ] Invariant cache hit.
[2024-06-01 16:48:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:48:15] [INFO ] Implicit Places using invariants and state equation in 3384 ms returned []
Implicit Place search using SMT with State Equation took 3907 ms to find 0 implicit places.
Running 1309 sub problems to find dead transitions.
[2024-06-01 16:48:15] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-06-01 16:48:15] [INFO ] Invariant cache hit.
[2024-06-01 16:48:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Problem TDEAD267 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1016 is UNSAT
At refinement iteration 3 (OVERLAPS) 6/904 variables, 6/137 constraints. Problems are: Problem set: 47 solved, 1262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 904/2215 variables, and 137 constraints, problems are : Problem set: 47 solved, 1262 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints]
After SMT, in 63081ms problems are : Problem set: 47 solved, 1262 unsolved
Search for dead transitions found 47 dead transitions in 63095ms
Found 47 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 47 transitions
Dead transitions reduction (with SMT) removed 47 transitions
Starting structural reductions in LTL mode, iteration 1 : 904/909 places, 1268/1315 transitions.
Applied a total of 0 rules in 48 ms. Remains 904 /904 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110844 ms. Remains : 904/909 places, 1268/1315 transitions.
Support contains 519 out of 904 places after structural reductions.
[2024-06-01 16:49:18] [INFO ] Flatten gal took : 179 ms
[2024-06-01 16:49:18] [INFO ] Flatten gal took : 121 ms
[2024-06-01 16:49:19] [INFO ] Input system was already deterministic with 1268 transitions.
Support contains 518 out of 904 places (down from 519) after GAL structural reductions.
RANDOM walk for 40000 steps (2718 resets) in 1925 ms. (20 steps per ms) remains 9/25 properties
BEST_FIRST walk for 40003 steps (522 resets) in 249 ms. (160 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (504 resets) in 318 ms. (125 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (493 resets) in 203 ms. (196 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (989 resets) in 361 ms. (110 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (517 resets) in 361 ms. (110 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (56 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (458 resets) in 209 ms. (190 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (475 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1212 resets) in 182 ms. (218 steps per ms) remains 9/9 properties
[2024-06-01 16:49:20] [INFO ] Flow matrix only has 1264 transitions (discarded 4 similar events)
// Phase 1: matrix 1264 rows 904 cols
[2024-06-01 16:49:20] [INFO ] Computed 137 invariants in 90 ms
[2024-06-01 16:49:20] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 1 (OVERLAPS) 726/798 variables, 110/110 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/798 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 3 (OVERLAPS) 103/901 variables, 25/135 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 0/135 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/903 variables, 2/137 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/903 variables, 0/137 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1264/2167 variables, 903/1040 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2167 variables, 1/1041 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2167 variables, 0/1041 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/2168 variables, 1/1042 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2168 variables, 0/1042 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2168 variables, 0/1042 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2168/2168 variables, and 1042 constraints, problems are : Problem set: 7 solved, 2 unsolved in 1424 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 904/904 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 194/199 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 286/485 variables, 48/51 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 0/51 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 230/715 variables, 46/97 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/715 variables, 0/97 constraints. Problems are: Problem set: 7 solved, 2 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 7 (OVERLAPS) 173/888 variables, 25/122 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/888 variables, 0/122 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/903 variables, 15/137 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/903 variables, 0/137 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1264/2167 variables, 903/1040 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2167 variables, 1/1041 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2167 variables, 0/1041 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2168 variables, 1/1042 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2168 variables, 1/1043 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2168 variables, 0/1043 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2168 variables, 0/1043 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2168/2168 variables, and 1043 constraints, problems are : Problem set: 8 solved, 1 unsolved in 1844 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 904/904 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 3425ms problems are : Problem set: 8 solved, 1 unsolved
Finished Parikh walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 8 ms.
Successfully simplified 8 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-11 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' '!(X(X(F(p0))))'
Support contains 4 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1268/1268 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1267
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1267
Applied a total of 2 rules in 104 ms. Remains 903 /904 variables (removed 1) and now considering 1267/1268 (removed 1) transitions.
Running 1261 sub problems to find dead transitions.
[2024-06-01 16:49:24] [INFO ] Flow matrix only has 1263 transitions (discarded 4 similar events)
// Phase 1: matrix 1263 rows 903 cols
[2024-06-01 16:49:24] [INFO ] Computed 137 invariants in 27 ms
[2024-06-01 16:49:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2166 variables, and 131 constraints, problems are : Problem set: 0 solved, 1261 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1261/1261 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 903/2166 variables, and 137 constraints, problems are : Problem set: 0 solved, 1261 unsolved in 20092 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1261 constraints, Known Traps: 0/0 constraints]
After SMT, in 43798ms problems are : Problem set: 0 solved, 1261 unsolved
Search for dead transitions found 0 dead transitions in 43819ms
[2024-06-01 16:50:08] [INFO ] Flow matrix only has 1263 transitions (discarded 4 similar events)
[2024-06-01 16:50:08] [INFO ] Invariant cache hit.
[2024-06-01 16:50:10] [INFO ] Implicit Places using invariants in 1931 ms returned []
[2024-06-01 16:50:10] [INFO ] Flow matrix only has 1263 transitions (discarded 4 similar events)
[2024-06-01 16:50:10] [INFO ] Invariant cache hit.
[2024-06-01 16:50:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:50:25] [INFO ] Implicit Places using invariants and state equation in 15235 ms returned []
Implicit Place search using SMT with State Equation took 17173 ms to find 0 implicit places.
Running 1261 sub problems to find dead transitions.
[2024-06-01 16:50:25] [INFO ] Flow matrix only has 1263 transitions (discarded 4 similar events)
[2024-06-01 16:50:25] [INFO ] Invariant cache hit.
[2024-06-01 16:50:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/2166 variables, and 137 constraints, problems are : Problem set: 0 solved, 1261 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1261/1261 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
Problem TDEAD984 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1266 is UNSAT
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 48 solved, 1213 unsolved
[2024-06-01 16:51:23] [INFO ] Deduced a trap composed of 24 places in 667 ms of which 93 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 903/2166 variables, and 138 constraints, problems are : Problem set: 48 solved, 1213 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1261 constraints, Known Traps: 1/1 constraints]
After SMT, in 63088ms problems are : Problem set: 48 solved, 1213 unsolved
Search for dead transitions found 48 dead transitions in 63103ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1219/1268 transitions.
Applied a total of 0 rules in 28 ms. Remains 903 /903 variables (removed 0) and now considering 1219/1219 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124236 ms. Remains : 903/904 places, 1219/1268 transitions.
Stuttering acceptance computed with spot in 343 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 447 ms.
Product exploration explored 100000 steps with 33333 reset in 383 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 24 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-01 finished in 125514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1) U (F((p2 U p3))&&p2)))'
Support contains 125 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1268/1268 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1267
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1267
Applied a total of 2 rules in 32 ms. Remains 903 /904 variables (removed 1) and now considering 1267/1268 (removed 1) transitions.
Running 1261 sub problems to find dead transitions.
[2024-06-01 16:51:29] [INFO ] Flow matrix only has 1263 transitions (discarded 4 similar events)
[2024-06-01 16:51:29] [INFO ] Invariant cache hit.
[2024-06-01 16:51:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2166 variables, and 131 constraints, problems are : Problem set: 0 solved, 1261 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1261/1261 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 903/2166 variables, and 137 constraints, problems are : Problem set: 0 solved, 1261 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1261 constraints, Known Traps: 0/0 constraints]
After SMT, in 43373ms problems are : Problem set: 0 solved, 1261 unsolved
Search for dead transitions found 0 dead transitions in 43384ms
[2024-06-01 16:52:13] [INFO ] Flow matrix only has 1263 transitions (discarded 4 similar events)
[2024-06-01 16:52:13] [INFO ] Invariant cache hit.
[2024-06-01 16:52:14] [INFO ] Implicit Places using invariants in 1241 ms returned []
[2024-06-01 16:52:14] [INFO ] Flow matrix only has 1263 transitions (discarded 4 similar events)
[2024-06-01 16:52:14] [INFO ] Invariant cache hit.
[2024-06-01 16:52:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:52:31] [INFO ] Implicit Places using invariants and state equation in 16765 ms returned []
Implicit Place search using SMT with State Equation took 18008 ms to find 0 implicit places.
Running 1261 sub problems to find dead transitions.
[2024-06-01 16:52:31] [INFO ] Flow matrix only has 1263 transitions (discarded 4 similar events)
[2024-06-01 16:52:31] [INFO ] Invariant cache hit.
[2024-06-01 16:52:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
Problem TDEAD984 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1266 is UNSAT
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 48 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/2166 variables, and 137 constraints, problems are : Problem set: 48 solved, 1213 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1261/1261 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 48 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 48 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 48 solved, 1213 unsolved
[2024-06-01 16:53:07] [INFO ] Deduced a trap composed of 137 places in 221 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 1/132 constraints. Problems are: Problem set: 48 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2166 variables, and 132 constraints, problems are : Problem set: 48 solved, 1213 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1261 constraints, Known Traps: 1/1 constraints]
After SMT, in 62966ms problems are : Problem set: 48 solved, 1213 unsolved
Search for dead transitions found 48 dead transitions in 62978ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1219/1268 transitions.
Applied a total of 0 rules in 18 ms. Remains 903 /903 variables (removed 0) and now considering 1219/1219 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124426 ms. Remains : 903/904 places, 1219/1268 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p3), true]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-04
Stuttering criterion allowed to conclude after 55 steps with 2 reset in 28 ms.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-04 finished in 124705 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 2 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1268/1268 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 904 transition count 1202
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 838 transition count 1202
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 838 transition count 1137
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 773 transition count 1137
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 772 transition count 1136
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 772 transition count 1136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 770 transition count 1134
Applied a total of 268 rules in 239 ms. Remains 770 /904 variables (removed 134) and now considering 1134/1268 (removed 134) transitions.
Running 1128 sub problems to find dead transitions.
[2024-06-01 16:53:34] [INFO ] Flow matrix only has 1130 transitions (discarded 4 similar events)
// Phase 1: matrix 1130 rows 770 cols
[2024-06-01 16:53:34] [INFO ] Computed 137 invariants in 28 ms
[2024-06-01 16:53:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1900 variables, and 132 constraints, problems are : Problem set: 0 solved, 1128 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1128/1128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
[2024-06-01 16:54:01] [INFO ] Deduced a trap composed of 133 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:54:07] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:54:07] [INFO ] Deduced a trap composed of 248 places in 416 ms of which 5 ms to minimize.
[2024-06-01 16:54:08] [INFO ] Deduced a trap composed of 242 places in 288 ms of which 4 ms to minimize.
[2024-06-01 16:54:08] [INFO ] Deduced a trap composed of 243 places in 285 ms of which 4 ms to minimize.
[2024-06-01 16:54:10] [INFO ] Deduced a trap composed of 349 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:54:11] [INFO ] Deduced a trap composed of 320 places in 221 ms of which 4 ms to minimize.
[2024-06-01 16:54:11] [INFO ] Deduced a trap composed of 197 places in 366 ms of which 5 ms to minimize.
[2024-06-01 16:54:15] [INFO ] Deduced a trap composed of 302 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:54:15] [INFO ] Deduced a trap composed of 311 places in 292 ms of which 4 ms to minimize.
[2024-06-01 16:54:15] [INFO ] Deduced a trap composed of 356 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:54:16] [INFO ] Deduced a trap composed of 355 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:54:16] [INFO ] Deduced a trap composed of 329 places in 254 ms of which 4 ms to minimize.
[2024-06-01 16:54:16] [INFO ] Deduced a trap composed of 318 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:54:16] [INFO ] Deduced a trap composed of 321 places in 256 ms of which 3 ms to minimize.
[2024-06-01 16:54:17] [INFO ] Deduced a trap composed of 318 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:54:17] [INFO ] Deduced a trap composed of 341 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:54:17] [INFO ] Deduced a trap composed of 334 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:54:17] [INFO ] Deduced a trap composed of 319 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:54:18] [INFO ] Deduced a trap composed of 312 places in 245 ms of which 4 ms to minimize.
SMT process timed out in 43459ms, After SMT, problems are : Problem set: 0 solved, 1128 unsolved
Search for dead transitions found 0 dead transitions in 43474ms
[2024-06-01 16:54:18] [INFO ] Flow matrix only has 1130 transitions (discarded 4 similar events)
[2024-06-01 16:54:18] [INFO ] Invariant cache hit.
[2024-06-01 16:54:19] [INFO ] Implicit Places using invariants in 1028 ms returned []
[2024-06-01 16:54:19] [INFO ] Flow matrix only has 1130 transitions (discarded 4 similar events)
[2024-06-01 16:54:19] [INFO ] Invariant cache hit.
[2024-06-01 16:54:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:54:34] [INFO ] Implicit Places using invariants and state equation in 15059 ms returned []
Implicit Place search using SMT with State Equation took 16091 ms to find 0 implicit places.
[2024-06-01 16:54:34] [INFO ] Redundant transitions in 63 ms returned []
Running 1128 sub problems to find dead transitions.
[2024-06-01 16:54:34] [INFO ] Flow matrix only has 1130 transitions (discarded 4 similar events)
[2024-06-01 16:54:34] [INFO ] Invariant cache hit.
[2024-06-01 16:54:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.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 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.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 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 9.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 1.0)
(s350 0.0)
(s351 1.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 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 1.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 1.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 1.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 1.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 1.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 1.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 1.0)
(s576 0.0)
(s577 1.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 1.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 1.0)
(s606 9.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 1.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 1.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 1.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 1.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 1.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 1.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 1.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 2.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 1.0)
(s720 1.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 1.0)
(s736 0.0)
(s737 1.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/770 variables, 5/137 constraints. Problems are: Problem set: 48 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 770/1900 variables, and 137 constraints, problems are : Problem set: 48 solved, 1080 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1128/1128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 48 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 48 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 20/132 constraints. Problems are: Problem set: 48 solved, 1080 unsolved
[2024-06-01 16:55:08] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:55:10] [INFO ] Deduced a trap composed of 257 places in 403 ms of which 9 ms to minimize.
[2024-06-01 16:55:12] [INFO ] Deduced a trap composed of 237 places in 240 ms of which 4 ms to minimize.
[2024-06-01 16:55:14] [INFO ] Deduced a trap composed of 242 places in 356 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 4/136 constraints. Problems are: Problem set: 48 solved, 1080 unsolved
[2024-06-01 16:55:29] [INFO ] Deduced a trap composed of 238 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:55:29] [INFO ] Deduced a trap composed of 236 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:55:29] [INFO ] Deduced a trap composed of 233 places in 287 ms of which 4 ms to minimize.
[2024-06-01 16:55:30] [INFO ] Deduced a trap composed of 227 places in 342 ms of which 5 ms to minimize.
[2024-06-01 16:55:31] [INFO ] Deduced a trap composed of 228 places in 302 ms of which 4 ms to minimize.
[2024-06-01 16:55:31] [INFO ] Deduced a trap composed of 319 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:55:32] [INFO ] Deduced a trap composed of 313 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:55:32] [INFO ] Deduced a trap composed of 336 places in 276 ms of which 5 ms to minimize.
[2024-06-01 16:55:33] [INFO ] Deduced a trap composed of 223 places in 362 ms of which 11 ms to minimize.
[2024-06-01 16:55:33] [INFO ] Deduced a trap composed of 236 places in 349 ms of which 6 ms to minimize.
[2024-06-01 16:55:34] [INFO ] Deduced a trap composed of 230 places in 331 ms of which 5 ms to minimize.
[2024-06-01 16:55:34] [INFO ] Deduced a trap composed of 219 places in 299 ms of which 4 ms to minimize.
[2024-06-01 16:55:35] [INFO ] Deduced a trap composed of 224 places in 337 ms of which 4 ms to minimize.
[2024-06-01 16:55:35] [INFO ] Deduced a trap composed of 328 places in 295 ms of which 17 ms to minimize.
[2024-06-01 16:55:36] [INFO ] Deduced a trap composed of 312 places in 296 ms of which 4 ms to minimize.
[2024-06-01 16:55:36] [INFO ] Deduced a trap composed of 253 places in 325 ms of which 4 ms to minimize.
[2024-06-01 16:55:37] [INFO ] Deduced a trap composed of 233 places in 328 ms of which 4 ms to minimize.
[2024-06-01 16:55:37] [INFO ] Deduced a trap composed of 226 places in 360 ms of which 5 ms to minimize.
SMT process timed out in 63454ms, After SMT, problems are : Problem set: 48 solved, 1080 unsolved
Search for dead transitions found 48 dead transitions in 63464ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 770/904 places, 1086/1268 transitions.
Applied a total of 0 rules in 66 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-06-01 16:55:37] [INFO ] Redundant transitions in 25 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 123464 ms. Remains : 770/904 places, 1086/1268 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-06
Stuttering criterion allowed to conclude after 37 steps with 2 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-06 finished in 123588 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 8 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1268/1268 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 904 transition count 1203
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 839 transition count 1203
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 130 place count 839 transition count 1138
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 260 place count 774 transition count 1138
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 261 place count 773 transition count 1137
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 773 transition count 1137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 264 place count 772 transition count 1136
Applied a total of 264 rules in 155 ms. Remains 772 /904 variables (removed 132) and now considering 1136/1268 (removed 132) transitions.
Running 1130 sub problems to find dead transitions.
[2024-06-01 16:55:38] [INFO ] Flow matrix only has 1132 transitions (discarded 4 similar events)
// Phase 1: matrix 1132 rows 772 cols
[2024-06-01 16:55:38] [INFO ] Computed 137 invariants in 58 ms
[2024-06-01 16:55:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2024-06-01 16:55:58] [INFO ] Deduced a trap composed of 257 places in 274 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1904 variables, and 133 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1130/1130 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2024-06-01 16:56:02] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:56:03] [INFO ] Deduced a trap composed of 311 places in 287 ms of which 5 ms to minimize.
[2024-06-01 16:56:03] [INFO ] Deduced a trap composed of 388 places in 275 ms of which 3 ms to minimize.
[2024-06-01 16:56:04] [INFO ] Deduced a trap composed of 340 places in 270 ms of which 3 ms to minimize.
[2024-06-01 16:56:04] [INFO ] Deduced a trap composed of 313 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:56:05] [INFO ] Deduced a trap composed of 355 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:56:05] [INFO ] Deduced a trap composed of 245 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:56:06] [INFO ] Deduced a trap composed of 245 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:56:06] [INFO ] Deduced a trap composed of 241 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:56:08] [INFO ] Deduced a trap composed of 238 places in 283 ms of which 4 ms to minimize.
[2024-06-01 16:56:08] [INFO ] Deduced a trap composed of 139 places in 268 ms of which 13 ms to minimize.
[2024-06-01 16:56:08] [INFO ] Deduced a trap composed of 251 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:56:09] [INFO ] Deduced a trap composed of 135 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:56:09] [INFO ] Deduced a trap composed of 336 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:56:10] [INFO ] Deduced a trap composed of 256 places in 394 ms of which 5 ms to minimize.
[2024-06-01 16:56:12] [INFO ] Deduced a trap composed of 261 places in 384 ms of which 5 ms to minimize.
[2024-06-01 16:56:14] [INFO ] Deduced a trap composed of 358 places in 341 ms of which 5 ms to minimize.
[2024-06-01 16:56:15] [INFO ] Deduced a trap composed of 266 places in 413 ms of which 6 ms to minimize.
[2024-06-01 16:56:15] [INFO ] Deduced a trap composed of 258 places in 396 ms of which 5 ms to minimize.
[2024-06-01 16:56:16] [INFO ] Deduced a trap composed of 258 places in 372 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/1904 variables, and 153 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1130 constraints, Known Traps: 21/21 constraints]
After SMT, in 42836ms problems are : Problem set: 0 solved, 1130 unsolved
Search for dead transitions found 0 dead transitions in 42846ms
[2024-06-01 16:56:21] [INFO ] Flow matrix only has 1132 transitions (discarded 4 similar events)
[2024-06-01 16:56:21] [INFO ] Invariant cache hit.
[2024-06-01 16:56:22] [INFO ] Implicit Places using invariants in 1349 ms returned []
[2024-06-01 16:56:22] [INFO ] Flow matrix only has 1132 transitions (discarded 4 similar events)
[2024-06-01 16:56:22] [INFO ] Invariant cache hit.
[2024-06-01 16:56:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:56:36] [INFO ] Implicit Places using invariants and state equation in 14405 ms returned []
Implicit Place search using SMT with State Equation took 15759 ms to find 0 implicit places.
[2024-06-01 16:56:36] [INFO ] Redundant transitions in 38 ms returned []
Running 1130 sub problems to find dead transitions.
[2024-06-01 16:56:36] [INFO ] Flow matrix only has 1132 transitions (discarded 4 similar events)
[2024-06-01 16:56:36] [INFO ] Invariant cache hit.
[2024-06-01 16:56:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2024-06-01 16:56:57] [INFO ] Deduced a trap composed of 257 places in 401 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1904 variables, and 133 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1130/1130 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2024-06-01 16:57:21] [INFO ] Deduced a trap composed of 355 places in 322 ms of which 4 ms to minimize.
[2024-06-01 16:57:22] [INFO ] Deduced a trap composed of 357 places in 355 ms of which 5 ms to minimize.
[2024-06-01 16:57:22] [INFO ] Deduced a trap composed of 319 places in 349 ms of which 5 ms to minimize.
[2024-06-01 16:57:23] [INFO ] Deduced a trap composed of 306 places in 345 ms of which 5 ms to minimize.
[2024-06-01 16:57:23] [INFO ] Deduced a trap composed of 313 places in 300 ms of which 4 ms to minimize.
[2024-06-01 16:57:23] [INFO ] Deduced a trap composed of 320 places in 286 ms of which 4 ms to minimize.
[2024-06-01 16:57:24] [INFO ] Deduced a trap composed of 368 places in 340 ms of which 5 ms to minimize.
[2024-06-01 16:57:24] [INFO ] Deduced a trap composed of 327 places in 281 ms of which 4 ms to minimize.
[2024-06-01 16:57:25] [INFO ] Deduced a trap composed of 366 places in 285 ms of which 4 ms to minimize.
[2024-06-01 16:57:25] [INFO ] Deduced a trap composed of 387 places in 313 ms of which 6 ms to minimize.
[2024-06-01 16:57:25] [INFO ] Deduced a trap composed of 320 places in 422 ms of which 6 ms to minimize.
[2024-06-01 16:57:26] [INFO ] Deduced a trap composed of 367 places in 371 ms of which 5 ms to minimize.
[2024-06-01 16:57:27] [INFO ] Deduced a trap composed of 333 places in 389 ms of which 5 ms to minimize.
[2024-06-01 16:57:27] [INFO ] Deduced a trap composed of 302 places in 406 ms of which 5 ms to minimize.
[2024-06-01 16:57:28] [INFO ] Deduced a trap composed of 308 places in 427 ms of which 6 ms to minimize.
[2024-06-01 16:57:29] [INFO ] Deduced a trap composed of 378 places in 412 ms of which 6 ms to minimize.
[2024-06-01 16:57:33] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 1 ms to minimize.
[2024-06-01 16:57:36] [INFO ] Deduced a trap composed of 360 places in 376 ms of which 5 ms to minimize.
[2024-06-01 16:57:36] [INFO ] Deduced a trap composed of 344 places in 381 ms of which 5 ms to minimize.
[2024-06-01 16:57:37] [INFO ] Deduced a trap composed of 354 places in 357 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/1904 variables, and 153 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1130 constraints, Known Traps: 21/21 constraints]
After SMT, in 63091ms problems are : Problem set: 0 solved, 1130 unsolved
Search for dead transitions found 0 dead transitions in 63111ms
Starting structural reductions in SI_LTL mode, iteration 1 : 772/904 places, 1136/1268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121928 ms. Remains : 772/904 places, 1136/1268 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-07
Product exploration explored 100000 steps with 9088 reset in 942 ms.
Product exploration explored 100000 steps with 9148 reset in 951 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 p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 129 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 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2059 resets) in 790 ms. (50 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (1428 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
[2024-06-01 16:57:42] [INFO ] Flow matrix only has 1132 transitions (discarded 4 similar events)
[2024-06-01 16:57:42] [INFO ] Invariant cache hit.
[2024-06-01 16:57:42] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 534/542 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/542 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 210/752 variables, 111/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/752 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/772 variables, 18/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/772 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1132/1904 variables, 772/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1904 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1904 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1904 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1904/1904 variables, and 910 constraints, problems are : Problem set: 0 solved, 1 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 772/772 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 534/542 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:57:43] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/542 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/542 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 210/752 variables, 111/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/752 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 772/1904 variables, and 138 constraints, problems are : Problem set: 1 solved, 0 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1399ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 239 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 6 out of 772 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 772/772 places, 1136/1136 transitions.
Applied a total of 0 rules in 42 ms. Remains 772 /772 variables (removed 0) and now considering 1136/1136 (removed 0) transitions.
Running 1130 sub problems to find dead transitions.
[2024-06-01 16:57:44] [INFO ] Flow matrix only has 1132 transitions (discarded 4 similar events)
[2024-06-01 16:57:44] [INFO ] Invariant cache hit.
[2024-06-01 16:57:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2024-06-01 16:58:03] [INFO ] Deduced a trap composed of 257 places in 241 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1904 variables, and 133 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1130/1130 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2024-06-01 16:58:19] [INFO ] Deduced a trap composed of 355 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:58:19] [INFO ] Deduced a trap composed of 357 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:58:20] [INFO ] Deduced a trap composed of 319 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:58:20] [INFO ] Deduced a trap composed of 306 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:58:20] [INFO ] Deduced a trap composed of 313 places in 305 ms of which 4 ms to minimize.
[2024-06-01 16:58:21] [INFO ] Deduced a trap composed of 320 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:58:21] [INFO ] Deduced a trap composed of 368 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:58:21] [INFO ] Deduced a trap composed of 327 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:58:21] [INFO ] Deduced a trap composed of 366 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:58:22] [INFO ] Deduced a trap composed of 387 places in 277 ms of which 4 ms to minimize.
[2024-06-01 16:58:22] [INFO ] Deduced a trap composed of 320 places in 299 ms of which 3 ms to minimize.
[2024-06-01 16:58:23] [INFO ] Deduced a trap composed of 367 places in 294 ms of which 4 ms to minimize.
[2024-06-01 16:58:23] [INFO ] Deduced a trap composed of 333 places in 353 ms of which 4 ms to minimize.
[2024-06-01 16:58:24] [INFO ] Deduced a trap composed of 302 places in 311 ms of which 4 ms to minimize.
[2024-06-01 16:58:24] [INFO ] Deduced a trap composed of 308 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:58:25] [INFO ] Deduced a trap composed of 378 places in 309 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/1904 variables, and 149 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1130 constraints, Known Traps: 17/17 constraints]
After SMT, in 42990ms problems are : Problem set: 0 solved, 1130 unsolved
Search for dead transitions found 0 dead transitions in 43001ms
[2024-06-01 16:58:27] [INFO ] Flow matrix only has 1132 transitions (discarded 4 similar events)
[2024-06-01 16:58:27] [INFO ] Invariant cache hit.
[2024-06-01 16:58:28] [INFO ] Implicit Places using invariants in 1206 ms returned []
[2024-06-01 16:58:28] [INFO ] Flow matrix only has 1132 transitions (discarded 4 similar events)
[2024-06-01 16:58:28] [INFO ] Invariant cache hit.
[2024-06-01 16:58:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:58:43] [INFO ] Implicit Places using invariants and state equation in 15259 ms returned []
Implicit Place search using SMT with State Equation took 16479 ms to find 0 implicit places.
[2024-06-01 16:58:43] [INFO ] Redundant transitions in 14 ms returned []
Running 1130 sub problems to find dead transitions.
[2024-06-01 16:58:43] [INFO ] Flow matrix only has 1132 transitions (discarded 4 similar events)
[2024-06-01 16:58:43] [INFO ] Invariant cache hit.
[2024-06-01 16:58:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2024-06-01 16:59:05] [INFO ] Deduced a trap composed of 257 places in 260 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1904 variables, and 133 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1130/1130 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1130 unsolved
[2024-06-01 16:59:28] [INFO ] Deduced a trap composed of 355 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:59:29] [INFO ] Deduced a trap composed of 357 places in 280 ms of which 4 ms to minimize.
[2024-06-01 16:59:29] [INFO ] Deduced a trap composed of 319 places in 300 ms of which 4 ms to minimize.
[2024-06-01 16:59:29] [INFO ] Deduced a trap composed of 306 places in 283 ms of which 4 ms to minimize.
[2024-06-01 16:59:30] [INFO ] Deduced a trap composed of 313 places in 281 ms of which 4 ms to minimize.
[2024-06-01 16:59:30] [INFO ] Deduced a trap composed of 320 places in 343 ms of which 4 ms to minimize.
[2024-06-01 16:59:30] [INFO ] Deduced a trap composed of 368 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:59:31] [INFO ] Deduced a trap composed of 327 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:59:31] [INFO ] Deduced a trap composed of 366 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:59:31] [INFO ] Deduced a trap composed of 387 places in 292 ms of which 4 ms to minimize.
[2024-06-01 16:59:32] [INFO ] Deduced a trap composed of 320 places in 312 ms of which 4 ms to minimize.
[2024-06-01 16:59:32] [INFO ] Deduced a trap composed of 367 places in 328 ms of which 4 ms to minimize.
[2024-06-01 16:59:33] [INFO ] Deduced a trap composed of 333 places in 342 ms of which 5 ms to minimize.
[2024-06-01 16:59:33] [INFO ] Deduced a trap composed of 302 places in 340 ms of which 4 ms to minimize.
[2024-06-01 16:59:34] [INFO ] Deduced a trap composed of 308 places in 278 ms of which 3 ms to minimize.
[2024-06-01 16:59:35] [INFO ] Deduced a trap composed of 378 places in 351 ms of which 5 ms to minimize.
[2024-06-01 16:59:38] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/1904 variables, and 150 constraints, problems are : Problem set: 0 solved, 1130 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1130 constraints, Known Traps: 18/18 constraints]
After SMT, in 62969ms problems are : Problem set: 0 solved, 1130 unsolved
Search for dead transitions found 0 dead transitions in 62978ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 122528 ms. Remains : 772/772 places, 1136/1136 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 133 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 85 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 25 steps (0 resets) in 5 ms. (4 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 162 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 48 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9169 reset in 829 ms.
Product exploration explored 100000 steps with 9092 reset in 1118 ms.
Support contains 6 out of 772 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 772/772 places, 1136/1136 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 771 transition count 1135
Applied a total of 2 rules in 136 ms. Remains 771 /772 variables (removed 1) and now considering 1135/1136 (removed 1) transitions.
Running 1129 sub problems to find dead transitions.
[2024-06-01 16:59:49] [INFO ] Flow matrix only has 1131 transitions (discarded 4 similar events)
// Phase 1: matrix 1131 rows 771 cols
[2024-06-01 16:59:49] [INFO ] Computed 137 invariants in 62 ms
[2024-06-01 16:59:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1129 unsolved
[2024-06-01 17:00:10] [INFO ] Deduced a trap composed of 14 places in 287 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1902 variables, and 133 constraints, problems are : Problem set: 0 solved, 1129 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1129/1129 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1129 unsolved
[2024-06-01 17:00:15] [INFO ] Deduced a trap composed of 187 places in 287 ms of which 4 ms to minimize.
[2024-06-01 17:00:15] [INFO ] Deduced a trap composed of 362 places in 303 ms of which 4 ms to minimize.
[2024-06-01 17:00:16] [INFO ] Deduced a trap composed of 254 places in 305 ms of which 4 ms to minimize.
[2024-06-01 17:00:16] [INFO ] Deduced a trap composed of 239 places in 346 ms of which 4 ms to minimize.
[2024-06-01 17:00:16] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 1 ms to minimize.
[2024-06-01 17:00:18] [INFO ] Deduced a trap composed of 229 places in 305 ms of which 4 ms to minimize.
[2024-06-01 17:00:21] [INFO ] Deduced a trap composed of 344 places in 302 ms of which 4 ms to minimize.
[2024-06-01 17:00:23] [INFO ] Deduced a trap composed of 138 places in 288 ms of which 4 ms to minimize.
[2024-06-01 17:00:23] [INFO ] Deduced a trap composed of 134 places in 283 ms of which 4 ms to minimize.
[2024-06-01 17:00:26] [INFO ] Deduced a trap composed of 237 places in 304 ms of which 4 ms to minimize.
[2024-06-01 17:00:27] [INFO ] Deduced a trap composed of 179 places in 313 ms of which 4 ms to minimize.
[2024-06-01 17:00:27] [INFO ] Deduced a trap composed of 239 places in 300 ms of which 4 ms to minimize.
[2024-06-01 17:00:27] [INFO ] Deduced a trap composed of 239 places in 290 ms of which 4 ms to minimize.
[2024-06-01 17:00:28] [INFO ] Deduced a trap composed of 239 places in 288 ms of which 4 ms to minimize.
[2024-06-01 17:00:28] [INFO ] Deduced a trap composed of 179 places in 283 ms of which 4 ms to minimize.
[2024-06-01 17:00:30] [INFO ] Deduced a trap composed of 305 places in 258 ms of which 4 ms to minimize.
[2024-06-01 17:00:31] [INFO ] Deduced a trap composed of 317 places in 319 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1902 variables, and 150 constraints, problems are : Problem set: 0 solved, 1129 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1129 constraints, Known Traps: 18/18 constraints]
After SMT, in 43505ms problems are : Problem set: 0 solved, 1129 unsolved
Search for dead transitions found 0 dead transitions in 43518ms
[2024-06-01 17:00:33] [INFO ] Flow matrix only has 1131 transitions (discarded 4 similar events)
[2024-06-01 17:00:33] [INFO ] Invariant cache hit.
[2024-06-01 17:00:34] [INFO ] Implicit Places using invariants in 1038 ms returned []
[2024-06-01 17:00:34] [INFO ] Flow matrix only has 1131 transitions (discarded 4 similar events)
[2024-06-01 17:00:34] [INFO ] Invariant cache hit.
[2024-06-01 17:00:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:00:48] [INFO ] Implicit Places using invariants and state equation in 14020 ms returned []
Implicit Place search using SMT with State Equation took 15073 ms to find 0 implicit places.
[2024-06-01 17:00:48] [INFO ] Redundant transitions in 16 ms returned []
Running 1129 sub problems to find dead transitions.
[2024-06-01 17:00:48] [INFO ] Flow matrix only has 1131 transitions (discarded 4 similar events)
[2024-06-01 17:00:48] [INFO ] Invariant cache hit.
[2024-06-01 17:00:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1129 unsolved
[2024-06-01 17:01:09] [INFO ] Deduced a trap composed of 244 places in 339 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1129 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 1.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 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 (/ 1.0 2.0))
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.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 3.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 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 8.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 (/ 1.0 2.0))
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 2.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 (/ 1.0 2.0))
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 (/ 1.0 2.0))
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 1.0)
(s351 0.0)
(s352 1.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 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 4.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 1.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 4.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 4.0)
(s459 0.0)
(s460 1.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 1.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 1.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 1.0)
(s577 0.0)
(s578 1.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 (/ 1.0 2.0))
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 1.0)
(s607 9.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 (/ 1.0 2.0))
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 1.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1902 variables, and 133 constraints, problems are : Problem set: 0 solved, 1129 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1129/1129 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1129 unsolved
[2024-06-01 17:01:22] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-06-01 17:01:23] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 15 ms to minimize.
[2024-06-01 17:01:24] [INFO ] Deduced a trap composed of 345 places in 284 ms of which 3 ms to minimize.
[2024-06-01 17:01:25] [INFO ] Deduced a trap composed of 250 places in 272 ms of which 4 ms to minimize.
[2024-06-01 17:01:25] [INFO ] Deduced a trap composed of 254 places in 280 ms of which 4 ms to minimize.
[2024-06-01 17:01:25] [INFO ] Deduced a trap composed of 262 places in 284 ms of which 4 ms to minimize.
[2024-06-01 17:01:27] [INFO ] Deduced a trap composed of 135 places in 261 ms of which 3 ms to minimize.
[2024-06-01 17:01:28] [INFO ] Deduced a trap composed of 238 places in 280 ms of which 3 ms to minimize.
[2024-06-01 17:01:28] [INFO ] Deduced a trap composed of 251 places in 275 ms of which 4 ms to minimize.
[2024-06-01 17:01:28] [INFO ] Deduced a trap composed of 250 places in 279 ms of which 3 ms to minimize.
[2024-06-01 17:01:28] [INFO ] Deduced a trap composed of 255 places in 289 ms of which 4 ms to minimize.
[2024-06-01 17:01:29] [INFO ] Deduced a trap composed of 240 places in 268 ms of which 3 ms to minimize.
[2024-06-01 17:01:29] [INFO ] Deduced a trap composed of 235 places in 261 ms of which 4 ms to minimize.
[2024-06-01 17:01:31] [INFO ] Deduced a trap composed of 297 places in 255 ms of which 4 ms to minimize.
[2024-06-01 17:01:36] [INFO ] Deduced a trap composed of 258 places in 351 ms of which 4 ms to minimize.
[2024-06-01 17:01:37] [INFO ] Deduced a trap composed of 161 places in 301 ms of which 3 ms to minimize.
[2024-06-01 17:01:37] [INFO ] Deduced a trap composed of 177 places in 306 ms of which 4 ms to minimize.
[2024-06-01 17:01:38] [INFO ] Deduced a trap composed of 251 places in 291 ms of which 4 ms to minimize.
[2024-06-01 17:01:38] [INFO ] Deduced a trap composed of 240 places in 283 ms of which 4 ms to minimize.
[2024-06-01 17:01:39] [INFO ] Deduced a trap composed of 250 places in 273 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1129 unsolved
[2024-06-01 17:01:49] [INFO ] Deduced a trap composed of 252 places in 333 ms of which 5 ms to minimize.
[2024-06-01 17:01:49] [INFO ] Deduced a trap composed of 184 places in 332 ms of which 4 ms to minimize.
[2024-06-01 17:01:49] [INFO ] Deduced a trap composed of 179 places in 283 ms of which 4 ms to minimize.
[2024-06-01 17:01:50] [INFO ] Deduced a trap composed of 199 places in 262 ms of which 4 ms to minimize.
[2024-06-01 17:01:51] [INFO ] Deduced a trap composed of 252 places in 277 ms of which 4 ms to minimize.
SMT process timed out in 63490ms, After SMT, problems are : Problem set: 0 solved, 1129 unsolved
Search for dead transitions found 0 dead transitions in 63500ms
Starting structural reductions in SI_LTL mode, iteration 1 : 771/772 places, 1135/1136 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122259 ms. Remains : 771/772 places, 1135/1136 transitions.
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-07 finished in 373850 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((!p0 U p1)||X(F(p1)))))'
Support contains 1 out of 904 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1268/1268 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 904 transition count 1203
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 131 place count 839 transition count 1202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 838 transition count 1202
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 132 place count 838 transition count 1138
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 260 place count 774 transition count 1138
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 261 place count 773 transition count 1137
Iterating global reduction 3 with 1 rules applied. Total rules applied 262 place count 773 transition count 1137
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 266 place count 771 transition count 1135
Applied a total of 266 rules in 228 ms. Remains 771 /904 variables (removed 133) and now considering 1135/1268 (removed 133) transitions.
Running 1129 sub problems to find dead transitions.
[2024-06-01 17:01:52] [INFO ] Flow matrix only has 1131 transitions (discarded 4 similar events)
// Phase 1: matrix 1131 rows 771 cols
[2024-06-01 17:01:52] [INFO ] Computed 137 invariants in 16 ms
[2024-06-01 17:01:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1129 unsolved
SMT process timed out in 22984ms, After SMT, problems are : Problem set: 0 solved, 1129 unsolved
Search for dead transitions found 0 dead transitions in 22993ms
[2024-06-01 17:02:15] [INFO ] Flow matrix only has 1131 transitions (discarded 4 similar events)
[2024-06-01 17:02:15] [INFO ] Invariant cache hit.
[2024-06-01 17:02:16] [INFO ] Implicit Places using invariants in 1066 ms returned []
[2024-06-01 17:02:16] [INFO ] Flow matrix only has 1131 transitions (discarded 4 similar events)
[2024-06-01 17:02:16] [INFO ] Invariant cache hit.
[2024-06-01 17:02:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:02:29] [INFO ] Implicit Places using invariants and state equation in 12826 ms returned []
Implicit Place search using SMT with State Equation took 13918 ms to find 0 implicit places.
[2024-06-01 17:02:29] [INFO ] Redundant transitions in 38 ms returned []
Running 1129 sub problems to find dead transitions.
[2024-06-01 17:02:29] [INFO ] Flow matrix only has 1131 transitions (discarded 4 similar events)
[2024-06-01 17:02:29] [INFO ] Invariant cache hit.
[2024-06-01 17:02:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1129 unsolved
[2024-06-01 17:02:51] [INFO ] Deduced a trap composed of 14 places in 265 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1902 variables, and 133 constraints, problems are : Problem set: 0 solved, 1129 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1129/1129 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1129 unsolved
[2024-06-01 17:03:04] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 1 ms to minimize.
[2024-06-01 17:03:09] [INFO ] Deduced a trap composed of 213 places in 291 ms of which 4 ms to minimize.
[2024-06-01 17:03:13] [INFO ] Deduced a trap composed of 278 places in 265 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 1129 unsolved
[2024-06-01 17:03:18] [INFO ] Deduced a trap composed of 317 places in 239 ms of which 3 ms to minimize.
[2024-06-01 17:03:19] [INFO ] Deduced a trap composed of 316 places in 235 ms of which 4 ms to minimize.
[2024-06-01 17:03:19] [INFO ] Deduced a trap composed of 136 places in 300 ms of which 4 ms to minimize.
[2024-06-01 17:03:19] [INFO ] Deduced a trap composed of 135 places in 273 ms of which 3 ms to minimize.
[2024-06-01 17:03:20] [INFO ] Deduced a trap composed of 339 places in 259 ms of which 4 ms to minimize.
[2024-06-01 17:03:20] [INFO ] Deduced a trap composed of 228 places in 273 ms of which 3 ms to minimize.
[2024-06-01 17:03:21] [INFO ] Deduced a trap composed of 361 places in 284 ms of which 4 ms to minimize.
[2024-06-01 17:03:21] [INFO ] Deduced a trap composed of 235 places in 238 ms of which 4 ms to minimize.
[2024-06-01 17:03:22] [INFO ] Deduced a trap composed of 314 places in 322 ms of which 4 ms to minimize.
[2024-06-01 17:03:22] [INFO ] Deduced a trap composed of 222 places in 271 ms of which 4 ms to minimize.
[2024-06-01 17:03:22] [INFO ] Deduced a trap composed of 324 places in 253 ms of which 4 ms to minimize.
[2024-06-01 17:03:23] [INFO ] Deduced a trap composed of 193 places in 288 ms of which 3 ms to minimize.
[2024-06-01 17:03:24] [INFO ] Deduced a trap composed of 296 places in 850 ms of which 3 ms to minimize.
[2024-06-01 17:03:24] [INFO ] Deduced a trap composed of 242 places in 257 ms of which 4 ms to minimize.
[2024-06-01 17:03:25] [INFO ] Deduced a trap composed of 239 places in 258 ms of which 3 ms to minimize.
[2024-06-01 17:03:25] [INFO ] Deduced a trap composed of 238 places in 258 ms of which 3 ms to minimize.
[2024-06-01 17:03:25] [INFO ] Deduced a trap composed of 322 places in 283 ms of which 4 ms to minimize.
[2024-06-01 17:03:26] [INFO ] Deduced a trap composed of 235 places in 313 ms of which 4 ms to minimize.
[2024-06-01 17:03:26] [INFO ] Deduced a trap composed of 306 places in 336 ms of which 6 ms to minimize.
[2024-06-01 17:03:26] [INFO ] Deduced a trap composed of 234 places in 301 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/766 variables, 20/156 constraints. Problems are: Problem set: 0 solved, 1129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1902 variables, and 156 constraints, problems are : Problem set: 0 solved, 1129 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1129 constraints, Known Traps: 24/24 constraints]
After SMT, in 63141ms problems are : Problem set: 0 solved, 1129 unsolved
Search for dead transitions found 0 dead transitions in 63164ms
Starting structural reductions in SI_LTL mode, iteration 1 : 771/904 places, 1135/1268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100364 ms. Remains : 771/904 places, 1135/1268 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-08
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-08 finished in 100485 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(p0&&G((p1&&X(X(G(p2)))))))))'
Support contains 5 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1268/1268 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1267
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1267
Applied a total of 2 rules in 31 ms. Remains 903 /904 variables (removed 1) and now considering 1267/1268 (removed 1) transitions.
Running 1261 sub problems to find dead transitions.
[2024-06-01 17:03:32] [INFO ] Flow matrix only has 1263 transitions (discarded 4 similar events)
// Phase 1: matrix 1263 rows 903 cols
[2024-06-01 17:03:32] [INFO ] Computed 137 invariants in 28 ms
[2024-06-01 17:03:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2166 variables, and 131 constraints, problems are : Problem set: 0 solved, 1261 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1261/1261 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 903/2166 variables, and 137 constraints, problems are : Problem set: 0 solved, 1261 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1261 constraints, Known Traps: 0/0 constraints]
After SMT, in 43073ms problems are : Problem set: 0 solved, 1261 unsolved
Search for dead transitions found 0 dead transitions in 43084ms
[2024-06-01 17:04:15] [INFO ] Flow matrix only has 1263 transitions (discarded 4 similar events)
[2024-06-01 17:04:15] [INFO ] Invariant cache hit.
[2024-06-01 17:04:16] [INFO ] Implicit Places using invariants in 1380 ms returned []
[2024-06-01 17:04:16] [INFO ] Flow matrix only has 1263 transitions (discarded 4 similar events)
[2024-06-01 17:04:16] [INFO ] Invariant cache hit.
[2024-06-01 17:04:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:04:33] [INFO ] Implicit Places using invariants and state equation in 16606 ms returned []
Implicit Place search using SMT with State Equation took 18010 ms to find 0 implicit places.
Running 1261 sub problems to find dead transitions.
[2024-06-01 17:04:33] [INFO ] Flow matrix only has 1263 transitions (discarded 4 similar events)
[2024-06-01 17:04:33] [INFO ] Invariant cache hit.
[2024-06-01 17:04:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
Problem TDEAD984 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1266 is UNSAT
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 48 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/2166 variables, and 137 constraints, problems are : Problem set: 48 solved, 1213 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1261/1261 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 48 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 48 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 48 solved, 1213 unsolved
[2024-06-01 17:05:10] [INFO ] Deduced a trap composed of 137 places in 145 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 1/132 constraints. Problems are: Problem set: 48 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2166 variables, and 132 constraints, problems are : Problem set: 48 solved, 1213 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1261 constraints, Known Traps: 1/1 constraints]
After SMT, in 63175ms problems are : Problem set: 48 solved, 1213 unsolved
Search for dead transitions found 48 dead transitions in 63196ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1219/1268 transitions.
Applied a total of 0 rules in 17 ms. Remains 903 /903 variables (removed 0) and now considering 1219/1219 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124348 ms. Remains : 903/904 places, 1219/1268 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 58 steps with 3 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-09 finished in 124475 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 2 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1268/1268 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 904 transition count 1202
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 838 transition count 1202
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 838 transition count 1137
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 773 transition count 1137
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 772 transition count 1136
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 772 transition count 1136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 770 transition count 1134
Applied a total of 268 rules in 97 ms. Remains 770 /904 variables (removed 134) and now considering 1134/1268 (removed 134) transitions.
Running 1128 sub problems to find dead transitions.
[2024-06-01 17:05:36] [INFO ] Flow matrix only has 1130 transitions (discarded 4 similar events)
// Phase 1: matrix 1130 rows 770 cols
[2024-06-01 17:05:36] [INFO ] Computed 137 invariants in 17 ms
[2024-06-01 17:05:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1900 variables, and 132 constraints, problems are : Problem set: 0 solved, 1128 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1128/1128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
[2024-06-01 17:06:02] [INFO ] Deduced a trap composed of 133 places in 249 ms of which 3 ms to minimize.
[2024-06-01 17:06:07] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 2 ms to minimize.
[2024-06-01 17:06:07] [INFO ] Deduced a trap composed of 248 places in 298 ms of which 4 ms to minimize.
[2024-06-01 17:06:08] [INFO ] Deduced a trap composed of 242 places in 313 ms of which 5 ms to minimize.
[2024-06-01 17:06:08] [INFO ] Deduced a trap composed of 243 places in 294 ms of which 4 ms to minimize.
[2024-06-01 17:06:10] [INFO ] Deduced a trap composed of 349 places in 289 ms of which 4 ms to minimize.
[2024-06-01 17:06:11] [INFO ] Deduced a trap composed of 320 places in 255 ms of which 3 ms to minimize.
[2024-06-01 17:06:12] [INFO ] Deduced a trap composed of 197 places in 294 ms of which 3 ms to minimize.
[2024-06-01 17:06:15] [INFO ] Deduced a trap composed of 302 places in 273 ms of which 4 ms to minimize.
[2024-06-01 17:06:16] [INFO ] Deduced a trap composed of 311 places in 277 ms of which 4 ms to minimize.
[2024-06-01 17:06:16] [INFO ] Deduced a trap composed of 356 places in 268 ms of which 4 ms to minimize.
[2024-06-01 17:06:16] [INFO ] Deduced a trap composed of 355 places in 294 ms of which 3 ms to minimize.
[2024-06-01 17:06:17] [INFO ] Deduced a trap composed of 329 places in 280 ms of which 4 ms to minimize.
[2024-06-01 17:06:17] [INFO ] Deduced a trap composed of 318 places in 270 ms of which 4 ms to minimize.
[2024-06-01 17:06:17] [INFO ] Deduced a trap composed of 321 places in 267 ms of which 4 ms to minimize.
[2024-06-01 17:06:18] [INFO ] Deduced a trap composed of 318 places in 284 ms of which 4 ms to minimize.
[2024-06-01 17:06:18] [INFO ] Deduced a trap composed of 341 places in 426 ms of which 19 ms to minimize.
[2024-06-01 17:06:18] [INFO ] Deduced a trap composed of 334 places in 473 ms of which 26 ms to minimize.
[2024-06-01 17:06:19] [INFO ] Deduced a trap composed of 319 places in 462 ms of which 4 ms to minimize.
[2024-06-01 17:06:19] [INFO ] Deduced a trap composed of 312 places in 276 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1900 variables, and 152 constraints, problems are : Problem set: 0 solved, 1128 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1128 constraints, Known Traps: 20/20 constraints]
After SMT, in 42879ms problems are : Problem set: 0 solved, 1128 unsolved
Search for dead transitions found 0 dead transitions in 42889ms
[2024-06-01 17:06:19] [INFO ] Flow matrix only has 1130 transitions (discarded 4 similar events)
[2024-06-01 17:06:19] [INFO ] Invariant cache hit.
[2024-06-01 17:06:21] [INFO ] Implicit Places using invariants in 1213 ms returned []
[2024-06-01 17:06:21] [INFO ] Flow matrix only has 1130 transitions (discarded 4 similar events)
[2024-06-01 17:06:21] [INFO ] Invariant cache hit.
[2024-06-01 17:06:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:06:34] [INFO ] Implicit Places using invariants and state equation in 13029 ms returned []
Implicit Place search using SMT with State Equation took 14255 ms to find 0 implicit places.
[2024-06-01 17:06:34] [INFO ] Redundant transitions in 14 ms returned []
Running 1128 sub problems to find dead transitions.
[2024-06-01 17:06:34] [INFO ] Flow matrix only has 1130 transitions (discarded 4 similar events)
[2024-06-01 17:06:34] [INFO ] Invariant cache hit.
[2024-06-01 17:06:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/770 variables, 5/137 constraints. Problems are: Problem set: 48 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 770/1900 variables, and 137 constraints, problems are : Problem set: 48 solved, 1080 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1128/1128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 48 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 48 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 20/132 constraints. Problems are: Problem set: 48 solved, 1080 unsolved
[2024-06-01 17:07:08] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 2 ms to minimize.
[2024-06-01 17:07:10] [INFO ] Deduced a trap composed of 257 places in 258 ms of which 4 ms to minimize.
[2024-06-01 17:07:11] [INFO ] Deduced a trap composed of 237 places in 385 ms of which 6 ms to minimize.
[2024-06-01 17:07:13] [INFO ] Deduced a trap composed of 242 places in 269 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 4/136 constraints. Problems are: Problem set: 48 solved, 1080 unsolved
[2024-06-01 17:07:28] [INFO ] Deduced a trap composed of 238 places in 363 ms of which 5 ms to minimize.
[2024-06-01 17:07:28] [INFO ] Deduced a trap composed of 236 places in 314 ms of which 5 ms to minimize.
[2024-06-01 17:07:28] [INFO ] Deduced a trap composed of 233 places in 302 ms of which 4 ms to minimize.
[2024-06-01 17:07:29] [INFO ] Deduced a trap composed of 227 places in 321 ms of which 5 ms to minimize.
[2024-06-01 17:07:29] [INFO ] Deduced a trap composed of 228 places in 285 ms of which 4 ms to minimize.
[2024-06-01 17:07:30] [INFO ] Deduced a trap composed of 319 places in 323 ms of which 4 ms to minimize.
[2024-06-01 17:07:30] [INFO ] Deduced a trap composed of 313 places in 405 ms of which 5 ms to minimize.
[2024-06-01 17:07:31] [INFO ] Deduced a trap composed of 336 places in 353 ms of which 5 ms to minimize.
[2024-06-01 17:07:32] [INFO ] Deduced a trap composed of 223 places in 396 ms of which 5 ms to minimize.
[2024-06-01 17:07:33] [INFO ] Deduced a trap composed of 236 places in 391 ms of which 5 ms to minimize.
[2024-06-01 17:07:33] [INFO ] Deduced a trap composed of 230 places in 380 ms of which 5 ms to minimize.
[2024-06-01 17:07:34] [INFO ] Deduced a trap composed of 219 places in 316 ms of which 4 ms to minimize.
[2024-06-01 17:07:34] [INFO ] Deduced a trap composed of 224 places in 282 ms of which 4 ms to minimize.
[2024-06-01 17:07:34] [INFO ] Deduced a trap composed of 328 places in 331 ms of which 4 ms to minimize.
[2024-06-01 17:07:35] [INFO ] Deduced a trap composed of 312 places in 277 ms of which 4 ms to minimize.
[2024-06-01 17:07:35] [INFO ] Deduced a trap composed of 253 places in 328 ms of which 4 ms to minimize.
[2024-06-01 17:07:36] [INFO ] Deduced a trap composed of 233 places in 446 ms of which 18 ms to minimize.
[2024-06-01 17:07:37] [INFO ] Deduced a trap composed of 226 places in 300 ms of which 4 ms to minimize.
SMT process timed out in 62917ms, After SMT, problems are : Problem set: 48 solved, 1080 unsolved
Search for dead transitions found 48 dead transitions in 62926ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 770/904 places, 1086/1268 transitions.
Applied a total of 0 rules in 34 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-06-01 17:07:37] [INFO ] Redundant transitions in 20 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 120255 ms. Remains : 770/904 places, 1086/1268 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-12
Stuttering criterion allowed to conclude after 14 steps with 1 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-12 finished in 120330 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(F(p0))))'
Support contains 1 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1268/1268 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1267
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1267
Applied a total of 2 rules in 31 ms. Remains 903 /904 variables (removed 1) and now considering 1267/1268 (removed 1) transitions.
Running 1261 sub problems to find dead transitions.
[2024-06-01 17:07:37] [INFO ] Flow matrix only has 1263 transitions (discarded 4 similar events)
// Phase 1: matrix 1263 rows 903 cols
[2024-06-01 17:07:37] [INFO ] Computed 137 invariants in 21 ms
[2024-06-01 17:07:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2166 variables, and 131 constraints, problems are : Problem set: 0 solved, 1261 unsolved in 20079 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1261/1261 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 903/2166 variables, and 137 constraints, problems are : Problem set: 0 solved, 1261 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1261 constraints, Known Traps: 0/0 constraints]
After SMT, in 42877ms problems are : Problem set: 0 solved, 1261 unsolved
Search for dead transitions found 0 dead transitions in 42889ms
[2024-06-01 17:08:20] [INFO ] Flow matrix only has 1263 transitions (discarded 4 similar events)
[2024-06-01 17:08:20] [INFO ] Invariant cache hit.
[2024-06-01 17:08:21] [INFO ] Implicit Places using invariants in 1505 ms returned []
[2024-06-01 17:08:21] [INFO ] Flow matrix only has 1263 transitions (discarded 4 similar events)
[2024-06-01 17:08:21] [INFO ] Invariant cache hit.
[2024-06-01 17:08:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:08:39] [INFO ] Implicit Places using invariants and state equation in 18056 ms returned []
Implicit Place search using SMT with State Equation took 19574 ms to find 0 implicit places.
Running 1261 sub problems to find dead transitions.
[2024-06-01 17:08:39] [INFO ] Flow matrix only has 1263 transitions (discarded 4 similar events)
[2024-06-01 17:08:39] [INFO ] Invariant cache hit.
[2024-06-01 17:08:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1261 unsolved
Problem TDEAD984 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1266 is UNSAT
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 48 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/2166 variables, and 137 constraints, problems are : Problem set: 48 solved, 1213 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1261/1261 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 48 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 48 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 48 solved, 1213 unsolved
[2024-06-01 17:09:16] [INFO ] Deduced a trap composed of 137 places in 151 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 1/132 constraints. Problems are: Problem set: 48 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2166 variables, and 132 constraints, problems are : Problem set: 48 solved, 1213 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1261 constraints, Known Traps: 1/1 constraints]
After SMT, in 62939ms problems are : Problem set: 48 solved, 1213 unsolved
Search for dead transitions found 48 dead transitions in 62958ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1219/1268 transitions.
Applied a total of 0 rules in 19 ms. Remains 903 /903 variables (removed 0) and now considering 1219/1219 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 125479 ms. Remains : 903/904 places, 1219/1268 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-13
Product exploration explored 100000 steps with 33333 reset in 340 ms.
Product exploration explored 100000 steps with 33333 reset in 434 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 27 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-13 finished in 126431 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)))))'
[2024-06-01 17:09:43] [INFO ] Flatten gal took : 94 ms
[2024-06-01 17:09:43] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 17:09:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 904 places, 1268 transitions and 6152 arcs took 13 ms.
Total runtime 1337028 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : PolyORBNT-PT-S05J60-LTLCardinality-07
BK_STOP 1717261988793
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBNT-PT-S05J60-LTLCardinality-07
ltl formula formula --ltl=/tmp/1736/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 904 places, 1268 transitions and 6152 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.050 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1736/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1736/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1736/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1736/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 922 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 905, there are 1274 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): ~29 levels ~10000 states ~14376 transitions
pnml2lts-mc( 1/ 4): ~29 levels ~20000 states ~24672 transitions
pnml2lts-mc( 1/ 4): ~29 levels ~40000 states ~44336 transitions
pnml2lts-mc( 2/ 4): ~29 levels ~80000 states ~85236 transitions
pnml2lts-mc( 2/ 4): ~29 levels ~160000 states ~167420 transitions
pnml2lts-mc( 2/ 4): ~29 levels ~320000 states ~331056 transitions
pnml2lts-mc( 2/ 4): ~29 levels ~640000 states ~660824 transitions
pnml2lts-mc( 2/ 4): ~29 levels ~1280000 states ~1331100 transitions
pnml2lts-mc( 3/ 4): ~29 levels ~2560000 states ~2719592 transitions
pnml2lts-mc( 0/ 4): ~29 levels ~5120000 states ~5612596 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4650707
pnml2lts-mc( 0/ 4): unique states count: 4650788
pnml2lts-mc( 0/ 4): unique transitions count: 5111373
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 456828
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4650802
pnml2lts-mc( 0/ 4): - cum. max stack depth: 116
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4650802 states 5111750 transitions, fanout: 1.099
pnml2lts-mc( 0/ 4): Total exploration time 203.550 sec (203.200 sec minimum, 203.375 sec on average)
pnml2lts-mc( 0/ 4): States per second: 22848, Transitions per second: 25113
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 99.5MB, 22.4 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 13.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 1298 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 99.5MB (~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="PolyORBNT-PT-S05J60"
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 PolyORBNT-PT-S05J60, 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-171654447200467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J60.tgz
mv PolyORBNT-PT-S05J60 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 '
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 ;