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.r289-tajo-171654445600292.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 greatspnxred
Input is PolyORBLF-PT-S04J06T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445600292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 19K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 11 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Apr 11 17:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Apr 11 17:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 90K Apr 11 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 427K Apr 11 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.6M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716866962163

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 03:29:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 03:29:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 03:29:23] [INFO ] Load time of PNML (sax parser for PT used): 249 ms
[2024-05-28 03:29:23] [INFO ] Transformed 618 places.
[2024-05-28 03:29:23] [INFO ] Transformed 3190 transitions.
[2024-05-28 03:29:23] [INFO ] Parsed PT model containing 618 places and 3190 transitions and 21570 arcs in 390 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
[2024-05-28 03:29:23] [INFO ] Reduced 264 identical enabling conditions.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 212 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1564
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 9 place count 609 transition count 1559
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 609 transition count 1559
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 604 transition count 1554
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 604 transition count 1554
Applied a total of 24 rules in 130 ms. Remains 604 /618 variables (removed 14) and now considering 1554/1564 (removed 10) transitions.
Running 1550 sub problems to find dead transitions.
[2024-05-28 03:29:24] [INFO ] Flow matrix only has 1530 transitions (discarded 24 similar events)
// Phase 1: matrix 1530 rows 604 cols
[2024-05-28 03:29:24] [INFO ] Computed 50 invariants in 97 ms
[2024-05-28 03:29:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 26/44 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
[2024-05-28 03:29:43] [INFO ] Deduced a trap composed of 135 places in 220 ms of which 22 ms to minimize.
[2024-05-28 03:29:43] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 2 ms to minimize.
[2024-05-28 03:29:44] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
[2024-05-28 03:29:45] [INFO ] Deduced a trap composed of 292 places in 209 ms of which 3 ms to minimize.
[2024-05-28 03:29:45] [INFO ] Deduced a trap composed of 279 places in 219 ms of which 3 ms to minimize.
[2024-05-28 03:29:46] [INFO ] Deduced a trap composed of 284 places in 230 ms of which 3 ms to minimize.
[2024-05-28 03:29:47] [INFO ] Deduced a trap composed of 300 places in 225 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 600/2134 variables, and 51 constraints, problems are : Problem set: 0 solved, 1550 unsolved in 20083 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 26/32 constraints, State Equation: 0/604 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1550/1550 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1550 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 26/44 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/600 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
[2024-05-28 03:30:02] [INFO ] Deduced a trap composed of 81 places in 48 ms of which 1 ms to minimize.
[2024-05-28 03:30:02] [INFO ] Deduced a trap composed of 81 places in 46 ms of which 1 ms to minimize.
[2024-05-28 03:30:02] [INFO ] Deduced a trap composed of 84 places in 46 ms of which 1 ms to minimize.
[2024-05-28 03:30:02] [INFO ] Deduced a trap composed of 81 places in 48 ms of which 1 ms to minimize.
[2024-05-28 03:30:03] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 1 ms to minimize.
[2024-05-28 03:30:04] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 1 ms to minimize.
[2024-05-28 03:30:05] [INFO ] Deduced a trap composed of 258 places in 314 ms of which 4 ms to minimize.
[2024-05-28 03:30:06] [INFO ] Deduced a trap composed of 102 places in 323 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/2134 variables, and 59 constraints, problems are : Problem set: 0 solved, 1550 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 26/32 constraints, State Equation: 0/604 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1550 constraints, Known Traps: 15/15 constraints]
After SMT, in 45521ms problems are : Problem set: 0 solved, 1550 unsolved
Search for dead transitions found 0 dead transitions in 45574ms
[2024-05-28 03:30:09] [INFO ] Flow matrix only has 1530 transitions (discarded 24 similar events)
[2024-05-28 03:30:09] [INFO ] Invariant cache hit.
[2024-05-28 03:30:10] [INFO ] Implicit Places using invariants in 404 ms returned [134, 199, 326, 360, 479, 546]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 412 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 598/618 places, 1554/1564 transitions.
Applied a total of 0 rules in 15 ms. Remains 598 /598 variables (removed 0) and now considering 1554/1554 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46182 ms. Remains : 598/618 places, 1554/1564 transitions.
Support contains 212 out of 598 places after structural reductions.
[2024-05-28 03:30:10] [INFO ] Flatten gal took : 192 ms
[2024-05-28 03:30:10] [INFO ] Flatten gal took : 123 ms
[2024-05-28 03:30:11] [INFO ] Input system was already deterministic with 1554 transitions.
RANDOM walk for 40000 steps (9 resets) in 1655 ms. (24 steps per ms) remains 3/25 properties
BEST_FIRST walk for 40002 steps (8 resets) in 933 ms. (42 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 337 ms. (118 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 285 ms. (139 steps per ms) remains 3/3 properties
[2024-05-28 03:30:12] [INFO ] Flow matrix only has 1530 transitions (discarded 24 similar events)
// Phase 1: matrix 1530 rows 598 cols
[2024-05-28 03:30:12] [INFO ] Computed 44 invariants in 52 ms
[2024-05-28 03:30:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 15/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp22 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 509/548 variables, 12/16 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/568 variables, 12/28 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 0/28 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp18 is UNSAT
After SMT solving in domain Real declared 596/2128 variables, and 43 constraints, problems are : Problem set: 3 solved, 0 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/598 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 607ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 6 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1553
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1552
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 61 ms. Remains 596 /598 variables (removed 2) and now considering 1552/1554 (removed 2) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 03:30:13] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 03:30:13] [INFO ] Computed 44 invariants in 43 ms
[2024-05-28 03:30:13] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 03:30:32] [INFO ] Deduced a trap composed of 3 places in 46 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 Real declared 592/2124 variables, and 30 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20058 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 12/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/31 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 6/37 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 37 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 1/1 constraints]
After SMT, in 46267ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 46291ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-05-28 03:30:59] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 03:30:59] [INFO ] Computed 44 invariants in 50 ms
[2024-05-28 03:31:00] [INFO ] Implicit Places using invariants in 706 ms returned []
[2024-05-28 03:31:00] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:31:00] [INFO ] Invariant cache hit.
[2024-05-28 03:31:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:31:16] [INFO ] Implicit Places using invariants and state equation in 16460 ms returned []
Implicit Place search using SMT with State Equation took 17174 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1462/1554 transitions.
Applied a total of 0 rules in 12 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63546 ms. Remains : 596/598 places, 1462/1554 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-00
Stuttering criterion allowed to conclude after 79503 steps with 11 reset in 415 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-00 finished in 64288 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((G(p0)||(G(p1)&&(G(p2)||(X(p2)&&F(p3)))))))'
Support contains 56 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1553
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1552
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 30 ms. Remains 596 /598 variables (removed 2) and now considering 1552/1554 (removed 2) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 03:31:17] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 03:31:17] [INFO ] Computed 44 invariants in 54 ms
[2024-05-28 03:31:17] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 03:31:35] [INFO ] Deduced a trap composed of 3 places in 42 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 Real declared 592/2124 variables, and 30 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 12/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/31 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 6/37 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-05-28 03:32:02] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 45512ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 45533ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-05-28 03:32:03] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 03:32:03] [INFO ] Computed 44 invariants in 28 ms
[2024-05-28 03:32:03] [INFO ] Implicit Places using invariants in 604 ms returned []
[2024-05-28 03:32:03] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:32:03] [INFO ] Invariant cache hit.
[2024-05-28 03:32:04] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:32:26] [INFO ] Implicit Places using invariants and state equation in 22410 ms returned []
Implicit Place search using SMT with State Equation took 23017 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1462/1554 transitions.
Applied a total of 0 rules in 17 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68604 ms. Remains : 596/598 places, 1462/1554 transitions.
Stuttering acceptance computed with spot in 639 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p1), (AND p1 (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p2) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-04
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-04 finished in 69300 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((X((F(p0) U X(p1)))&&F(p2))))'
Support contains 38 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1553
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1552
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 36 ms. Remains 596 /598 variables (removed 2) and now considering 1552/1554 (removed 2) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 03:32:26] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 03:32:26] [INFO ] Computed 44 invariants in 62 ms
[2024-05-28 03:32:26] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 03:32:44] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 30 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 12/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/31 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 6/37 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-05-28 03:33:10] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 45111ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 45134ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-05-28 03:33:12] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 03:33:12] [INFO ] Computed 44 invariants in 47 ms
[2024-05-28 03:33:12] [INFO ] Implicit Places using invariants in 818 ms returned []
[2024-05-28 03:33:12] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:33:12] [INFO ] Invariant cache hit.
[2024-05-28 03:33:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:33:29] [INFO ] Implicit Places using invariants and state equation in 16226 ms returned []
Implicit Place search using SMT with State Equation took 17046 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1462/1554 transitions.
Applied a total of 0 rules in 9 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62229 ms. Remains : 596/598 places, 1462/1554 transitions.
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-05
Product exploration explored 100000 steps with 2812 reset in 735 ms.
Product exploration explored 100000 steps with 2807 reset in 623 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 p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 158 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 214 steps (0 resets) in 10 ms. (19 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 264 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-28 03:33:31] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:33:32] [INFO ] Invariant cache hit.
[2024-05-28 03:33:32] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-28 03:33:32] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 52 ms returned sat
[2024-05-28 03:33:35] [INFO ] [Real]Absence check using state equation in 2818 ms returned sat
[2024-05-28 03:33:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:33:36] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-28 03:33:36] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 68 ms returned sat
[2024-05-28 03:33:44] [INFO ] [Nat]Absence check using state equation in 7947 ms returned sat
[2024-05-28 03:33:44] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:33:45] [INFO ] [Nat]Added 120 Read/Feed constraints in 1433 ms returned sat
[2024-05-28 03:33:46] [INFO ] Deduced a trap composed of 82 places in 230 ms of which 3 ms to minimize.
[2024-05-28 03:33:46] [INFO ] Deduced a trap composed of 82 places in 162 ms of which 3 ms to minimize.
[2024-05-28 03:33:46] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 2 ms to minimize.
[2024-05-28 03:33:47] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 2 ms to minimize.
[2024-05-28 03:33:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1208 ms
[2024-05-28 03:33:47] [INFO ] Computed and/alt/rep : 1008/3943/990 causal constraints (skipped 444 transitions) in 162 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 03:33:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
[2024-05-28 03:33:50] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:33:50] [INFO ] Invariant cache hit.
[2024-05-28 03:33:51] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2024-05-28 03:33:51] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 85 ms returned sat
[2024-05-28 03:33:53] [INFO ] [Real]Absence check using state equation in 1563 ms returned sat
[2024-05-28 03:33:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:33:53] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-28 03:33:53] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 48 ms returned sat
[2024-05-28 03:33:58] [INFO ] [Nat]Absence check using state equation in 4163 ms returned sat
[2024-05-28 03:33:58] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:33:58] [INFO ] [Nat]Added 120 Read/Feed constraints in 533 ms returned sat
[2024-05-28 03:33:59] [INFO ] Deduced a trap composed of 133 places in 406 ms of which 4 ms to minimize.
[2024-05-28 03:33:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 682 ms
[2024-05-28 03:33:59] [INFO ] Computed and/alt/rep : 1008/3943/990 causal constraints (skipped 444 transitions) in 118 ms.
Could not prove EG (NOT p1)
Support contains 38 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1462/1462 transitions.
Applied a total of 0 rules in 12 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Running 1458 sub problems to find dead transitions.
[2024-05-28 03:34:08] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:34:08] [INFO ] Invariant cache hit.
[2024-05-28 03:34:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 03:34:23] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 03:34:23] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
[2024-05-28 03:34:25] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 10.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 0.0)
(s173 2.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 1.0)
(s189 0.0)
(s190 1.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 7.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s283 0.0)
(s284 1.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 1.0)
(s294 0.0)
(s295 1.0)
(s296 1.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 1.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 1.0)
(s369 0.0)
(s370 1.0)
(s371 1.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 1.0)
(s376 1.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 0.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 10.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 1.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 1.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 1.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 1.0)
(s452 0.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
(s460 1.0)
(s461 1.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 0.0)
(s469 1.0)
(s470 1.0)
(s471 0.0)
(s472 0.0)
(s473 1.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s477 1.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 1.0)
(s492 0.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 0.0)
(s497 1.0)
(s498 1.0)
(s499 0.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 2.0)
(s504 1.0)
(s505 1.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 0.0)
(s519 1.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 1.0)
(s524 1.0)
(s525 0.0)
(s526 0.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 0.0)
(s532 1.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 1.0)
(s537 1.0)
(s538 0.0)
(s540 1.0)
(s541 1.0)
(s542 0.0)
(s543 1.0)
(s544 0.0)
(s545 0.0)
(s546 1.0)
(s547 1.0)
(s548 0.0)
(s549 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2034 variables, and 35 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 03:34:35] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 2 ms to minimize.
[2024-05-28 03:34:35] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-05-28 03:34:35] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-05-28 03:34:35] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 1 ms to minimize.
[2024-05-28 03:34:35] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 1 ms to minimize.
[2024-05-28 03:34:35] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 2 ms to minimize.
[2024-05-28 03:34:35] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 2 ms to minimize.
[2024-05-28 03:34:47] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2034 variables, and 43 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 11/11 constraints]
After SMT, in 44135ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 44160ms
[2024-05-28 03:34:52] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:34:52] [INFO ] Invariant cache hit.
[2024-05-28 03:34:53] [INFO ] Implicit Places using invariants in 799 ms returned []
[2024-05-28 03:34:53] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:34:53] [INFO ] Invariant cache hit.
[2024-05-28 03:34:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:35:09] [INFO ] Implicit Places using invariants and state equation in 16399 ms returned []
Implicit Place search using SMT with State Equation took 17199 ms to find 0 implicit places.
Running 1458 sub problems to find dead transitions.
[2024-05-28 03:35:09] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:35:09] [INFO ] Invariant cache hit.
[2024-05-28 03:35:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 03:35:25] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-05-28 03:35:26] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 1 ms to minimize.
[2024-05-28 03:35:28] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1458 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 592/2034 variables, and 35 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 03:35:47] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 2 ms to minimize.
[2024-05-28 03:35:47] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-05-28 03:35:47] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-05-28 03:35:47] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2024-05-28 03:35:47] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 1 ms to minimize.
[2024-05-28 03:35:47] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 1 ms to minimize.
[2024-05-28 03:35:48] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 1 ms to minimize.
[2024-05-28 03:36:00] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 1458 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 592/2034 variables, and 43 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 11/11 constraints]
After SMT, in 64040ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 64059ms
Finished structural reductions in LTL mode , in 1 iterations and 125439 ms. Remains : 596/596 places, 1462/1462 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 146 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 449 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 210 steps (0 resets) in 10 ms. (19 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 383 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 375 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-28 03:36:15] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:36:15] [INFO ] Invariant cache hit.
[2024-05-28 03:36:16] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-28 03:36:16] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 60 ms returned sat
[2024-05-28 03:36:20] [INFO ] [Real]Absence check using state equation in 3311 ms returned sat
[2024-05-28 03:36:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:36:21] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-28 03:36:21] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 56 ms returned sat
[2024-05-28 03:36:30] [INFO ] [Nat]Absence check using state equation in 8930 ms returned sat
[2024-05-28 03:36:30] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:36:31] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 03:36:33] [INFO ] [Nat]Added 120 Read/Feed constraints in 3077 ms returned unknown
Could not prove EG (NOT p2)
[2024-05-28 03:36:33] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:36:33] [INFO ] Invariant cache hit.
[2024-05-28 03:36:34] [INFO ] [Real]Absence check using 18 positive place invariants in 47 ms returned sat
[2024-05-28 03:36:34] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 146 ms returned sat
[2024-05-28 03:36:36] [INFO ] [Real]Absence check using state equation in 2045 ms returned sat
[2024-05-28 03:36:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:36:37] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-28 03:36:37] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 47 ms returned sat
[2024-05-28 03:36:41] [INFO ] [Nat]Absence check using state equation in 4054 ms returned sat
[2024-05-28 03:36:41] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:36:41] [INFO ] [Nat]Added 120 Read/Feed constraints in 505 ms returned sat
[2024-05-28 03:36:42] [INFO ] Deduced a trap composed of 133 places in 443 ms of which 4 ms to minimize.
[2024-05-28 03:36:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 721 ms
[2024-05-28 03:36:42] [INFO ] Computed and/alt/rep : 1008/3943/990 causal constraints (skipped 444 transitions) in 113 ms.
[2024-05-28 03:36:51] [INFO ] Added : 250 causal constraints over 50 iterations in 8873 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 399 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 2838 reset in 776 ms.
Product exploration explored 100000 steps with 2812 reset in 657 ms.
Applying partial POR strategy [false, false, true, false, true, true]
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 38 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 1462/1462 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 596 transition count 1462
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 36 place count 596 transition count 1462
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 48 place count 596 transition count 1462
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 60 place count 584 transition count 1450
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 72 place count 584 transition count 1450
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 132 places in 2 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 168 place count 584 transition count 1450
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 189 place count 563 transition count 1429
Deduced a syphon composed of 114 places in 3 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 210 place count 563 transition count 1429
Deduced a syphon composed of 114 places in 2 ms
Applied a total of 210 rules in 234 ms. Remains 563 /596 variables (removed 33) and now considering 1429/1462 (removed 33) transitions.
Running 1425 sub problems to find dead transitions.
[2024-05-28 03:36:54] [INFO ] Flow matrix only has 1405 transitions (discarded 24 similar events)
// Phase 1: matrix 1405 rows 563 cols
[2024-05-28 03:36:54] [INFO ] Computed 44 invariants in 27 ms
[2024-05-28 03:36:54] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/559 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/559 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 1425 unsolved
[2024-05-28 03:37:12] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-28 03:37:13] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 5 ms to minimize.
[2024-05-28 03:37:13] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 0 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD88 is UNSAT
[2024-05-28 03:37:14] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD236 is UNSAT
[2024-05-28 03:37:17] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
Problem TDEAD318 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD356 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 559/1968 variables, and 40 constraints, problems are : Problem set: 10 solved, 1415 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1425/1425 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 10 solved, 1415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/549 variables, 12/12 constraints. Problems are: Problem set: 10 solved, 1415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/549 variables, 11/23 constraints. Problems are: Problem set: 10 solved, 1415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/549 variables, 5/28 constraints. Problems are: Problem set: 10 solved, 1415 unsolved
[2024-05-28 03:37:28] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/549 variables, 1/29 constraints. Problems are: Problem set: 10 solved, 1415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/1968 variables, and 29 constraints, problems are : Problem set: 10 solved, 1415 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 11/27 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1425 constraints, Known Traps: 6/6 constraints]
After SMT, in 44191ms problems are : Problem set: 10 solved, 1415 unsolved
Search for dead transitions found 10 dead transitions in 44210ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 10 transitions.
[2024-05-28 03:37:38] [INFO ] Redundant transitions in 113 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 563/596 places, 1419/1462 transitions.
Graph (complete) has 3121 edges and 563 vertex of which 553 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.7 ms
Discarding 10 places :
Also discarding 0 output transitions
Deduced a syphon composed of 104 places in 2 ms
Applied a total of 1 rules in 56 ms. Remains 553 /563 variables (removed 10) and now considering 1419/1419 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 553/596 places, 1419/1462 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44631 ms. Remains : 553/596 places, 1419/1462 transitions.
Support contains 38 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1462/1462 transitions.
Applied a total of 0 rules in 19 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Running 1458 sub problems to find dead transitions.
[2024-05-28 03:37:38] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 03:37:38] [INFO ] Computed 44 invariants in 52 ms
[2024-05-28 03:37:38] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 03:37:57] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-28 03:37:57] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 1 ms to minimize.
[2024-05-28 03:37:59] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2034 variables, and 35 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 03:38:17] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2024-05-28 03:38:17] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-28 03:38:17] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2034 variables, and 38 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 6/6 constraints]
After SMT, in 44247ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 44264ms
[2024-05-28 03:38:22] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:38:22] [INFO ] Invariant cache hit.
[2024-05-28 03:38:23] [INFO ] Implicit Places using invariants in 597 ms returned []
[2024-05-28 03:38:23] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:38:23] [INFO ] Invariant cache hit.
[2024-05-28 03:38:24] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:38:39] [INFO ] Implicit Places using invariants and state equation in 16621 ms returned []
Implicit Place search using SMT with State Equation took 17222 ms to find 0 implicit places.
Running 1458 sub problems to find dead transitions.
[2024-05-28 03:38:39] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:38:39] [INFO ] Invariant cache hit.
[2024-05-28 03:38:39] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 03:38:55] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 03:38:55] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2024-05-28 03:38:58] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 9.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 1.0)
(s189 0.0)
(s190 1.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 8.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 1.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 1.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 1.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 1.0)
(s263 0.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 1.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 1.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 1.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 1.0)
(s368 1.0)
(s369 0.0)
(s370 1.0)
(s371 1.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 1.0)
(s376 1.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 0.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 9.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 1.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 1.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 1.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 1.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 1.0)
(s452 0.0)
(s453 0.0)
(s454 1.0)
(s455 1.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
(s460 1.0)
(s461 1.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 0.0)
(s469 1.0)
(s470 1.0)
(s471 0.0)
(s472 0.0)
(s473 1.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s477 1.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s487 0.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 1.0)
(s492 0.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 0.0)
(s497 1.0)
(s498 1.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 1.0)
(s503 2.0)
(s504 1.0)
(s505 1.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 0.0)
(s513 0.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 0.0)
(s519 1.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 1.0)
(s524 1.0)
(s525 0.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 0.0)
(s532 1.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 1.0)
(s537 1.0)
(s538 0.0)
(s540 1.0)
(s541 1.0)
(s542 0.0)
(s543 1.0)
(s544 0.0)
(s545 0.0)
(s546 1.0)
(s547 1.0)
(s548 0.0)
(s549 0.0)
(s550 1.0)
(s551 1.0)
(s552 2.0)
(s553 1.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 1.0)
(s559 1.0)
(s560 0.0)
(s561 1.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2034 variables, and 35 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 03:39:16] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 2 ms to minimize.
[2024-05-28 03:39:16] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-05-28 03:39:16] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-05-28 03:39:16] [INFO ] Deduced a trap composed of 82 places in 49 ms of which 1 ms to minimize.
[2024-05-28 03:39:16] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2024-05-28 03:39:17] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2024-05-28 03:39:17] [INFO ] Deduced a trap composed of 82 places in 45 ms of which 1 ms to minimize.
[2024-05-28 03:39:28] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 1458 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 592/2034 variables, and 43 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 11/11 constraints]
After SMT, in 63761ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 63781ms
Finished structural reductions in LTL mode , in 1 iterations and 125293 ms. Remains : 596/596 places, 1462/1462 transitions.
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-05 finished in 437084 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&&X(!p1)) U (G((!p0&&X(!p1)))||(X(!p1)&&p2))))'
Support contains 90 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1553
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1552
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 34 ms. Remains 596 /598 variables (removed 2) and now considering 1552/1554 (removed 2) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 03:39:43] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 03:39:44] [INFO ] Computed 44 invariants in 51 ms
[2024-05-28 03:39:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 03:40:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 30 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 12/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/31 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 6/37 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-05-28 03:40:27] [INFO ] Deduced a trap composed of 98 places in 142 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 45622ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 45640ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-05-28 03:40:29] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 03:40:29] [INFO ] Computed 44 invariants in 22 ms
[2024-05-28 03:40:30] [INFO ] Implicit Places using invariants in 568 ms returned []
[2024-05-28 03:40:30] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:40:30] [INFO ] Invariant cache hit.
[2024-05-28 03:40:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:40:43] [INFO ] Implicit Places using invariants and state equation in 13495 ms returned []
Implicit Place search using SMT with State Equation took 14068 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1462/1554 transitions.
Applied a total of 0 rules in 8 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59757 ms. Remains : 596/598 places, 1462/1554 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR p1 (AND p0 (NOT p2))), true, p1]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 1257 ms.
Product exploration explored 100000 steps with 50000 reset in 1360 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 p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (OR p2 (NOT p0))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (OR p2 (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 24 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-06 finished in 62591 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)||X(F((p1&&G(F(p2)))))))'
Support contains 8 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1553
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1552
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 58 ms. Remains 596 /598 variables (removed 2) and now considering 1552/1554 (removed 2) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 03:40:46] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 03:40:46] [INFO ] Computed 44 invariants in 50 ms
[2024-05-28 03:40:46] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 03:41:02] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 10.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 3.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 4.0)
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 2.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 2.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 3.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 0.0)
(s173 4.0)
(s174 0.0)
(s175 1.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 0.0)
(s190 1.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 3.0)
(s212 0.0)
(s213 1.0)
(s214 9.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 1.0)
(s233 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 30 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 12/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/31 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 6/37 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-05-28 03:41:29] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 45272ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 45299ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-05-28 03:41:31] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 03:41:31] [INFO ] Computed 44 invariants in 49 ms
[2024-05-28 03:41:32] [INFO ] Implicit Places using invariants in 598 ms returned []
[2024-05-28 03:41:32] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:41:32] [INFO ] Invariant cache hit.
[2024-05-28 03:41:33] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:41:48] [INFO ] Implicit Places using invariants and state equation in 15766 ms returned []
Implicit Place search using SMT with State Equation took 16372 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1462/1554 transitions.
Applied a total of 0 rules in 8 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61749 ms. Remains : 596/598 places, 1462/1554 transitions.
Stuttering acceptance computed with spot in 421 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-08
Stuttering criterion allowed to conclude after 43211 steps with 60 reset in 186 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-08 finished in 62391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 598 transition count 1512
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 85 place count 556 transition count 1511
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 555 transition count 1511
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 86 place count 555 transition count 1439
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 230 place count 483 transition count 1439
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 350 place count 423 transition count 1379
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 353 place count 420 transition count 1376
Iterating global reduction 3 with 3 rules applied. Total rules applied 356 place count 420 transition count 1376
Applied a total of 356 rules in 117 ms. Remains 420 /598 variables (removed 178) and now considering 1376/1554 (removed 178) transitions.
Running 1372 sub problems to find dead transitions.
[2024-05-28 03:41:49] [INFO ] Flow matrix only has 1352 transitions (discarded 24 similar events)
// Phase 1: matrix 1352 rows 420 cols
[2024-05-28 03:41:49] [INFO ] Computed 44 invariants in 38 ms
[2024-05-28 03:41:49] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
[2024-05-28 03:42:03] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
[2024-05-28 03:42:04] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 2 ms to minimize.
[2024-05-28 03:42:05] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1372 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 10.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 3.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 4.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 2.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 2.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 2.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 3.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 4.0)
(s122 0.0)
(s123 1.0)
(s124 1.0)
(s125 0.0)
(s126 2.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 3.0)
(s148 0.0)
(s149 9.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 4.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 2.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 2.0)
timeout
(s195 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/1772 variables, and 38 constraints, problems are : Problem set: 0 solved, 1372 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 19/28 constraints, State Equation: 0/420 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1372/1372 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
[2024-05-28 03:42:16] [INFO ] Deduced a trap composed of 35 places in 245 ms of which 2 ms to minimize.
[2024-05-28 03:42:16] [INFO ] Deduced a trap composed of 27 places in 243 ms of which 2 ms to minimize.
[2024-05-28 03:42:16] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-05-28 03:42:16] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
[2024-05-28 03:42:21] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-05-28 03:42:21] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 1 ms to minimize.
[2024-05-28 03:42:22] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-05-28 03:42:22] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/416 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
[2024-05-28 03:42:34] [INFO ] Deduced a trap composed of 27 places in 237 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/1772 variables, and 47 constraints, problems are : Problem set: 0 solved, 1372 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 19/28 constraints, State Equation: 0/420 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1372 constraints, Known Traps: 12/12 constraints]
After SMT, in 46008ms problems are : Problem set: 0 solved, 1372 unsolved
Search for dead transitions found 0 dead transitions in 46028ms
[2024-05-28 03:42:35] [INFO ] Flow matrix only has 1352 transitions (discarded 24 similar events)
[2024-05-28 03:42:35] [INFO ] Invariant cache hit.
[2024-05-28 03:42:35] [INFO ] Implicit Places using invariants in 512 ms returned []
[2024-05-28 03:42:35] [INFO ] Flow matrix only has 1352 transitions (discarded 24 similar events)
[2024-05-28 03:42:35] [INFO ] Invariant cache hit.
[2024-05-28 03:42:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:42:45] [INFO ] Implicit Places using invariants and state equation in 9516 ms returned []
Implicit Place search using SMT with State Equation took 10034 ms to find 0 implicit places.
[2024-05-28 03:42:45] [INFO ] Redundant transitions in 25 ms returned []
Running 1372 sub problems to find dead transitions.
[2024-05-28 03:42:45] [INFO ] Flow matrix only has 1352 transitions (discarded 24 similar events)
[2024-05-28 03:42:45] [INFO ] Invariant cache hit.
[2024-05-28 03:42:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
[2024-05-28 03:42:58] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-28 03:42:59] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/416 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
SMT process timed out in 35285ms, After SMT, problems are : Problem set: 0 solved, 1372 unsolved
Search for dead transitions found 0 dead transitions in 35301ms
Starting structural reductions in SI_LTL mode, iteration 1 : 420/598 places, 1376/1554 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91523 ms. Remains : 420/598 places, 1376/1554 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-09
Stuttering criterion allowed to conclude after 3845 steps with 0 reset in 39 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-09 finished in 91648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((p1&&G(p2)))))))'
Support contains 7 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1553
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1552
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 59 ms. Remains 596 /598 variables (removed 2) and now considering 1552/1554 (removed 2) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 03:43:20] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 03:43:20] [INFO ] Computed 44 invariants in 35 ms
[2024-05-28 03:43:20] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 03:43:38] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 10.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 3.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 4.0)
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 2.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 2.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 3.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 0.0)
(s173 4.0)
(s174 0.0)
(s175 1.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 0.0)
(s190 1.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 3.0)
(s212 0.0)
(s213 1.0)
(s214 9.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 1.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 4.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 0.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 0.0)
(s257 1.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 1.0)
(s263 0.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s283 0.0)
(s284 1.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 1.0)
(s296 1.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 2.0)
(s301 0.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 4.0)
(s308 1.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 0.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 0.0)
(s348 3.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 2.0)
(s353 1.0)
(s354 0.0)
(s355 4.0)
(s356 1.0)
(s357 1.0)
(s358 4.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 0.0)
(s370 1.0)
(s371 1.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 0.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 10.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 4.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 1.0)
(s425 0.0)
(s426 1.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 1.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 1.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 1.0)
(s452 2.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 0.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 3.0)
(s469 1.0)
(s470 1.0)
(s471 0.0)
(s472 0.0)
(s473 1.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s477 1.0)
(s478 0.0)
(s479 0.0)
(s480 1.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s487 0.0)
(s488 4.0)
(s489 0.0)
(s490 0.0)
(s491 1.0)
(s492 0.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 1.0)
(s503 2.0)
(s504 1.0)
(s505 1.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 4.0)
(s513 0.0)
(s514 0.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 0.0)
(s519 1.0)
(s520 1.0)
(s521 0.0)
(s522 0.0)
(s523 1.0)
(s524 1.0)
(s525 0.0)
(s526 0.0)
(s527 1.0)
(s528 1.0)
(s529 0.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 0.0)
(s534 2.0)
(s535 0.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s540 1.0)
(s541 1.0)
(s542 0.0)
(s543 1.0)
(s544 0.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 0.0)
(s549 3.0)
(s550 1.0)
(s551 1.0)
(s552 2.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 1.0)
(s559 1.0)
(s560 0.0)
(s561 1.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 0.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 0.0)
(s574 1.0)
(s575 1.0)
(s576 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 30 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 12/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/31 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 6/37 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-05-28 03:44:06] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 2 ms to minimize.
SMT process timed out in 45640ms, After SMT, problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 45666ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-05-28 03:44:06] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 03:44:06] [INFO ] Computed 44 invariants in 27 ms
[2024-05-28 03:44:06] [INFO ] Implicit Places using invariants in 568 ms returned []
[2024-05-28 03:44:06] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:44:06] [INFO ] Invariant cache hit.
[2024-05-28 03:44:07] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:44:21] [INFO ] Implicit Places using invariants and state equation in 15015 ms returned []
Implicit Place search using SMT with State Equation took 15585 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1462/1554 transitions.
Applied a total of 0 rules in 8 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61324 ms. Remains : 596/598 places, 1462/1554 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-11
Stuttering criterion allowed to conclude after 33342 steps with 0 reset in 177 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-11 finished in 61706 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(G((p0||X(G(p1))))))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Applied a total of 0 rules in 13 ms. Remains 598 /598 variables (removed 0) and now considering 1554/1554 (removed 0) transitions.
Running 1550 sub problems to find dead transitions.
[2024-05-28 03:44:22] [INFO ] Flow matrix only has 1530 transitions (discarded 24 similar events)
// Phase 1: matrix 1530 rows 598 cols
[2024-05-28 03:44:22] [INFO ] Computed 44 invariants in 58 ms
[2024-05-28 03:44:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
[2024-05-28 03:44:41] [INFO ] Deduced a trap composed of 124 places in 237 ms of which 3 ms to minimize.
[2024-05-28 03:44:41] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 3 ms to minimize.
[2024-05-28 03:44:41] [INFO ] Deduced a trap composed of 135 places in 220 ms of which 3 ms to minimize.
[2024-05-28 03:44:42] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 2 ms to minimize.
[2024-05-28 03:44:43] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 2 ms to minimize.
[2024-05-28 03:44:44] [INFO ] Deduced a trap composed of 290 places in 276 ms of which 4 ms to minimize.
[2024-05-28 03:44:45] [INFO ] Deduced a trap composed of 286 places in 300 ms of which 3 ms to minimize.
[2024-05-28 03:44:45] [INFO ] Deduced a trap composed of 283 places in 327 ms of which 7 ms to minimize.
[2024-05-28 03:44:46] [INFO ] Deduced a trap composed of 295 places in 289 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/2128 variables, and 48 constraints, problems are : Problem set: 0 solved, 1550 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 22/27 constraints, State Equation: 0/598 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1550/1550 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1550 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
[2024-05-28 03:45:00] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 1 ms to minimize.
[2024-05-28 03:45:00] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 1 ms to minimize.
[2024-05-28 03:45:01] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/2128 variables, and 51 constraints, problems are : Problem set: 0 solved, 1550 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 22/27 constraints, State Equation: 0/598 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1550 constraints, Known Traps: 12/12 constraints]
After SMT, in 45926ms problems are : Problem set: 0 solved, 1550 unsolved
Search for dead transitions found 0 dead transitions in 45947ms
[2024-05-28 03:45:08] [INFO ] Flow matrix only has 1530 transitions (discarded 24 similar events)
[2024-05-28 03:45:08] [INFO ] Invariant cache hit.
[2024-05-28 03:45:08] [INFO ] Implicit Places using invariants in 727 ms returned []
[2024-05-28 03:45:08] [INFO ] Flow matrix only has 1530 transitions (discarded 24 similar events)
[2024-05-28 03:45:08] [INFO ] Invariant cache hit.
[2024-05-28 03:45:11] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:45:22] [INFO ] Implicit Places using invariants and state equation in 14008 ms returned []
Implicit Place search using SMT with State Equation took 14739 ms to find 0 implicit places.
Running 1550 sub problems to find dead transitions.
[2024-05-28 03:45:22] [INFO ] Flow matrix only has 1530 transitions (discarded 24 similar events)
[2024-05-28 03:45:22] [INFO ] Invariant cache hit.
[2024-05-28 03:45:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
[2024-05-28 03:45:41] [INFO ] Deduced a trap composed of 124 places in 227 ms of which 3 ms to minimize.
[2024-05-28 03:45:41] [INFO ] Deduced a trap composed of 157 places in 236 ms of which 4 ms to minimize.
[2024-05-28 03:45:41] [INFO ] Deduced a trap composed of 135 places in 247 ms of which 3 ms to minimize.
[2024-05-28 03:45:42] [INFO ] Deduced a trap composed of 15 places in 208 ms of which 2 ms to minimize.
[2024-05-28 03:45:44] [INFO ] Deduced a trap composed of 291 places in 287 ms of which 4 ms to minimize.
[2024-05-28 03:45:45] [INFO ] Deduced a trap composed of 284 places in 291 ms of which 4 ms to minimize.
[2024-05-28 03:45:45] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 2 ms to minimize.
[2024-05-28 03:45:46] [INFO ] Deduced a trap composed of 303 places in 317 ms of which 4 ms to minimize.
[2024-05-28 03:45:46] [INFO ] Deduced a trap composed of 300 places in 255 ms of which 4 ms to minimize.
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 594/2128 variables, and 48 constraints, problems are : Problem set: 0 solved, 1550 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 22/27 constraints, State Equation: 0/598 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1550/1550 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1550 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
[2024-05-28 03:46:08] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 1 ms to minimize.
[2024-05-28 03:46:08] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 1 ms to minimize.
[2024-05-28 03:46:10] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 2 ms to minimize.
[2024-05-28 03:46:10] [INFO ] Deduced a trap composed of 82 places in 47 ms of which 1 ms to minimize.
[2024-05-28 03:46:17] [INFO ] Deduced a trap composed of 296 places in 321 ms of which 4 ms to minimize.
[2024-05-28 03:46:18] [INFO ] Deduced a trap composed of 290 places in 299 ms of which 4 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 594/2128 variables, and 54 constraints, problems are : Problem set: 0 solved, 1550 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 22/27 constraints, State Equation: 0/598 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1550 constraints, Known Traps: 15/15 constraints]
After SMT, in 65584ms problems are : Problem set: 0 solved, 1550 unsolved
Search for dead transitions found 0 dead transitions in 65601ms
Finished structural reductions in LTL mode , in 1 iterations and 126308 ms. Remains : 598/598 places, 1554/1554 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-13
Entered a terminal (fully accepting) state of product in 758 steps with 0 reset in 4 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-13 finished in 126484 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(F(p0)))'
Support contains 1 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1553
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1552
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 43 ms. Remains 596 /598 variables (removed 2) and now considering 1552/1554 (removed 2) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 03:46:28] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 03:46:28] [INFO ] Computed 44 invariants in 32 ms
[2024-05-28 03:46:28] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 03:46:46] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 10.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 3.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 4.0)
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 2.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 2.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 3.0)
(s97 0.0)
(s98 1.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 0.0)
(s173 4.0)
(s174 0.0)
(s175 1.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 0.0)
(s190 1.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 30 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 12/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/31 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 6/37 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-05-28 03:47:13] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 45547ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 45569ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-05-28 03:47:14] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 03:47:14] [INFO ] Computed 44 invariants in 46 ms
[2024-05-28 03:47:15] [INFO ] Implicit Places using invariants in 646 ms returned []
[2024-05-28 03:47:15] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 03:47:15] [INFO ] Invariant cache hit.
[2024-05-28 03:47:16] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:47:32] [INFO ] Implicit Places using invariants and state equation in 17484 ms returned []
Implicit Place search using SMT with State Equation took 18136 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1462/1554 transitions.
Applied a total of 0 rules in 10 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63766 ms. Remains : 596/598 places, 1462/1554 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-15
Stuttering criterion allowed to conclude after 10299 steps with 45 reset in 61 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-15 finished in 63955 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((X((F(p0) U X(p1)))&&F(p2))))'
Found a Lengthening insensitive property : PolyORBLF-PT-S04J06T06-LTLFireability-05
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 38 out of 598 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 598 transition count 1510
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 554 transition count 1510
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 88 place count 554 transition count 1462
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 184 place count 506 transition count 1462
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 292 place count 452 transition count 1408
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 295 place count 449 transition count 1405
Iterating global reduction 2 with 3 rules applied. Total rules applied 298 place count 449 transition count 1405
Applied a total of 298 rules in 114 ms. Remains 449 /598 variables (removed 149) and now considering 1405/1554 (removed 149) transitions.
Running 1401 sub problems to find dead transitions.
[2024-05-28 03:47:33] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
// Phase 1: matrix 1381 rows 449 cols
[2024-05-28 03:47:33] [INFO ] Computed 44 invariants in 44 ms
[2024-05-28 03:47:33] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 03:47:47] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 6 ms to minimize.
[2024-05-28 03:47:48] [INFO ] Deduced a trap composed of 26 places in 290 ms of which 3 ms to minimize.
[2024-05-28 03:47:48] [INFO ] Deduced a trap composed of 55 places in 291 ms of which 3 ms to minimize.
[2024-05-28 03:47:50] [INFO ] Deduced a trap composed of 58 places in 157 ms of which 1 ms to minimize.
[2024-05-28 03:47:57] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1830 variables, and 44 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 03:48:01] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
[2024-05-28 03:48:01] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 2 ms to minimize.
[2024-05-28 03:48:01] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 1 ms to minimize.
[2024-05-28 03:48:02] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 2 ms to minimize.
[2024-05-28 03:48:07] [INFO ] Deduced a trap composed of 58 places in 58 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 445/1830 variables, and 49 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 10/10 constraints]
After SMT, in 45566ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 45587ms
[2024-05-28 03:48:18] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 03:48:18] [INFO ] Invariant cache hit.
[2024-05-28 03:48:19] [INFO ] Implicit Places using invariants in 490 ms returned []
[2024-05-28 03:48:19] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 03:48:19] [INFO ] Invariant cache hit.
[2024-05-28 03:48:20] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:48:29] [INFO ] Implicit Places using invariants and state equation in 9975 ms returned []
Implicit Place search using SMT with State Equation took 10467 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-05-28 03:48:29] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 03:48:29] [INFO ] Invariant cache hit.
[2024-05-28 03:48:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 03:48:44] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 1 ms to minimize.
[2024-05-28 03:48:44] [INFO ] Deduced a trap composed of 26 places in 254 ms of which 2 ms to minimize.
[2024-05-28 03:48:44] [INFO ] Deduced a trap composed of 55 places in 224 ms of which 3 ms to minimize.
[2024-05-28 03:48:46] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 1 ms to minimize.
[2024-05-28 03:48:58] [INFO ] Deduced a trap composed of 160 places in 235 ms of which 3 ms to minimize.
[2024-05-28 03:48:58] [INFO ] Deduced a trap composed of 168 places in 308 ms of which 3 ms to minimize.
[2024-05-28 03:48:59] [INFO ] Deduced a trap composed of 156 places in 271 ms of which 3 ms to minimize.
[2024-05-28 03:48:59] [INFO ] Deduced a trap composed of 131 places in 266 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1830 variables, and 47 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 03:49:13] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 2 ms to minimize.
[2024-05-28 03:49:13] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2024-05-28 03:49:13] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 1 ms to minimize.
[2024-05-28 03:49:13] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2024-05-28 03:49:17] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 03:49:32] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
[2024-05-28 03:49:35] [INFO ] Deduced a trap composed of 164 places in 243 ms of which 3 ms to minimize.
SMT process timed out in 65611ms, After SMT, problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 65624ms
Starting structural reductions in LI_LTL mode, iteration 1 : 449/598 places, 1405/1554 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 121798 ms. Remains : 449/598 places, 1405/1554 transitions.
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-05
Product exploration explored 100000 steps with 3295 reset in 607 ms.
Product exploration explored 100000 steps with 3274 reset in 624 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 p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 130 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 164 steps (0 resets) in 8 ms. (18 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 281 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-28 03:49:37] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 03:49:37] [INFO ] Invariant cache hit.
[2024-05-28 03:49:38] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-28 03:49:38] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 84 ms returned sat
[2024-05-28 03:49:40] [INFO ] [Real]Absence check using state equation in 1581 ms returned sat
[2024-05-28 03:49:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:49:40] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-28 03:49:40] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 166 ms returned sat
[2024-05-28 03:49:45] [INFO ] [Nat]Absence check using state equation in 4094 ms returned sat
[2024-05-28 03:49:45] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:49:46] [INFO ] [Nat]Added 120 Read/Feed constraints in 1270 ms returned sat
[2024-05-28 03:49:46] [INFO ] Computed and/alt/rep : 945/4246/927 causal constraints (skipped 450 transitions) in 137 ms.
[2024-05-28 03:49:52] [INFO ] Added : 168 causal constraints over 34 iterations in 6183 ms. Result :sat
Could not prove EG (NOT p2)
[2024-05-28 03:49:52] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 03:49:52] [INFO ] Invariant cache hit.
[2024-05-28 03:49:53] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-28 03:49:53] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 62 ms returned sat
[2024-05-28 03:49:55] [INFO ] [Real]Absence check using state equation in 1854 ms returned sat
[2024-05-28 03:49:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:49:56] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-28 03:49:56] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 42 ms returned sat
[2024-05-28 03:49:57] [INFO ] [Nat]Absence check using state equation in 1847 ms returned sat
[2024-05-28 03:49:57] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:49:58] [INFO ] [Nat]Added 120 Read/Feed constraints in 675 ms returned sat
[2024-05-28 03:49:58] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2024-05-28 03:49:59] [INFO ] Deduced a trap composed of 27 places in 321 ms of which 3 ms to minimize.
[2024-05-28 03:50:00] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
[2024-05-28 03:50:00] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 1 ms to minimize.
[2024-05-28 03:50:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2152 ms
[2024-05-28 03:50:00] [INFO ] Computed and/alt/rep : 945/4246/927 causal constraints (skipped 450 transitions) in 165 ms.
[2024-05-28 03:50:09] [INFO ] Added : 282 causal constraints over 57 iterations in 8622 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 38 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 1405/1405 transitions.
Applied a total of 0 rules in 14 ms. Remains 449 /449 variables (removed 0) and now considering 1405/1405 (removed 0) transitions.
Running 1401 sub problems to find dead transitions.
[2024-05-28 03:50:09] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 03:50:09] [INFO ] Invariant cache hit.
[2024-05-28 03:50:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 03:50:23] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2024-05-28 03:50:23] [INFO ] Deduced a trap composed of 26 places in 261 ms of which 2 ms to minimize.
[2024-05-28 03:50:24] [INFO ] Deduced a trap composed of 55 places in 246 ms of which 3 ms to minimize.
[2024-05-28 03:50:25] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 9.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.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 1.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 2.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.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 1.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 2.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 6.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 1.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 2.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 2.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 5.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 2.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 4.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 1.0)
(s278 1.0)
(s279 1.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 5.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 1.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 2.0)
(s328 0.0)
(s329 2.0)
(s330 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 1.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 1.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.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)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 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 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 1.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1830 variables, and 43 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 03:50:42] [INFO ] Deduced a trap composed of 168 places in 215 ms of which 3 ms to minimize.
[2024-05-28 03:50:42] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2024-05-28 03:50:42] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2024-05-28 03:50:42] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 2 ms to minimize.
[2024-05-28 03:50:42] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-05-28 03:50:45] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2024-05-28 03:50:45] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1830 variables, and 50 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 11/11 constraints]
After SMT, in 45591ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 45612ms
[2024-05-28 03:50:55] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 03:50:55] [INFO ] Invariant cache hit.
[2024-05-28 03:50:55] [INFO ] Implicit Places using invariants in 507 ms returned []
[2024-05-28 03:50:55] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 03:50:55] [INFO ] Invariant cache hit.
[2024-05-28 03:50:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:51:05] [INFO ] Implicit Places using invariants and state equation in 10010 ms returned []
Implicit Place search using SMT with State Equation took 10518 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-05-28 03:51:05] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 03:51:05] [INFO ] Invariant cache hit.
[2024-05-28 03:51:05] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 03:51:21] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2024-05-28 03:51:21] [INFO ] Deduced a trap composed of 26 places in 255 ms of which 2 ms to minimize.
[2024-05-28 03:51:21] [INFO ] Deduced a trap composed of 55 places in 184 ms of which 2 ms to minimize.
[2024-05-28 03:51:22] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 1 ms to minimize.
[2024-05-28 03:51:34] [INFO ] Deduced a trap composed of 160 places in 270 ms of which 3 ms to minimize.
[2024-05-28 03:51:34] [INFO ] Deduced a trap composed of 168 places in 251 ms of which 3 ms to minimize.
[2024-05-28 03:51:34] [INFO ] Deduced a trap composed of 156 places in 230 ms of which 3 ms to minimize.
[2024-05-28 03:51:35] [INFO ] Deduced a trap composed of 131 places in 283 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1401 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 9.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 1.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 2.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1830 variables, and 47 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 03:51:49] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 1 ms to minimize.
[2024-05-28 03:51:49] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2024-05-28 03:51:49] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
[2024-05-28 03:51:50] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
[2024-05-28 03:51:54] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 03:52:07] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
[2024-05-28 03:52:10] [INFO ] Deduced a trap composed of 164 places in 259 ms of which 3 ms to minimize.
[2024-05-28 03:52:10] [INFO ] Deduced a trap composed of 164 places in 236 ms of which 3 ms to minimize.
[2024-05-28 03:52:11] [INFO ] Deduced a trap composed of 162 places in 245 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1830 variables, and 56 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 17/17 constraints]
After SMT, in 66592ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 66609ms
Finished structural reductions in LTL mode , in 1 iterations and 122763 ms. Remains : 449/449 places, 1405/1405 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 92 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 164 steps (0 resets) in 9 ms. (16 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 199 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-28 03:52:13] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 03:52:13] [INFO ] Invariant cache hit.
[2024-05-28 03:52:13] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-28 03:52:14] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 65 ms returned sat
[2024-05-28 03:52:15] [INFO ] [Real]Absence check using state equation in 1612 ms returned sat
[2024-05-28 03:52:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:52:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-28 03:52:16] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 220 ms returned sat
[2024-05-28 03:52:21] [INFO ] [Nat]Absence check using state equation in 4298 ms returned sat
[2024-05-28 03:52:21] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:52:21] [INFO ] [Nat]Added 120 Read/Feed constraints in 945 ms returned sat
[2024-05-28 03:52:22] [INFO ] Computed and/alt/rep : 945/4246/927 causal constraints (skipped 450 transitions) in 137 ms.
[2024-05-28 03:52:30] [INFO ] Added : 312 causal constraints over 63 iterations in 8538 ms. Result :sat
Could not prove EG (NOT p2)
[2024-05-28 03:52:30] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 03:52:30] [INFO ] Invariant cache hit.
[2024-05-28 03:52:31] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-28 03:52:31] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 86 ms returned sat
[2024-05-28 03:52:33] [INFO ] [Real]Absence check using state equation in 1655 ms returned sat
[2024-05-28 03:52:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:52:33] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-28 03:52:33] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 48 ms returned sat
[2024-05-28 03:52:35] [INFO ] [Nat]Absence check using state equation in 1636 ms returned sat
[2024-05-28 03:52:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:52:36] [INFO ] [Nat]Added 120 Read/Feed constraints in 700 ms returned sat
[2024-05-28 03:52:36] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2024-05-28 03:52:37] [INFO ] Deduced a trap composed of 27 places in 276 ms of which 3 ms to minimize.
[2024-05-28 03:52:37] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 1 ms to minimize.
[2024-05-28 03:52:37] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2024-05-28 03:52:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1660 ms
[2024-05-28 03:52:38] [INFO ] Computed and/alt/rep : 945/4246/927 causal constraints (skipped 450 transitions) in 95 ms.
[2024-05-28 03:52:44] [INFO ] Added : 282 causal constraints over 57 iterations in 6744 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 3330 reset in 719 ms.
Product exploration explored 100000 steps with 3282 reset in 708 ms.
Applying partial POR strategy [false, false, true, false, true, true]
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 38 out of 449 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 449/449 places, 1405/1405 transitions.
Applied a total of 0 rules in 42 ms. Remains 449 /449 variables (removed 0) and now considering 1405/1405 (removed 0) transitions.
Running 1401 sub problems to find dead transitions.
[2024-05-28 03:52:46] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 03:52:46] [INFO ] Invariant cache hit.
[2024-05-28 03:52:47] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 03:53:01] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2024-05-28 03:53:02] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 2 ms to minimize.
[2024-05-28 03:53:02] [INFO ] Deduced a trap composed of 55 places in 209 ms of which 3 ms to minimize.
[2024-05-28 03:53:03] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1830 variables, and 43 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 03:53:19] [INFO ] Deduced a trap composed of 168 places in 209 ms of which 2 ms to minimize.
[2024-05-28 03:53:20] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2024-05-28 03:53:20] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 1 ms to minimize.
[2024-05-28 03:53:20] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-05-28 03:53:20] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 2 ms to minimize.
[2024-05-28 03:53:22] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 1 ms to minimize.
[2024-05-28 03:53:22] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1830 variables, and 50 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 11/11 constraints]
After SMT, in 45654ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 45676ms
[2024-05-28 03:53:32] [INFO ] Redundant transitions in 72 ms returned []
Running 1401 sub problems to find dead transitions.
[2024-05-28 03:53:32] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 03:53:32] [INFO ] Invariant cache hit.
[2024-05-28 03:53:32] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 03:53:46] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-28 03:53:47] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 2 ms to minimize.
[2024-05-28 03:53:47] [INFO ] Deduced a trap composed of 55 places in 203 ms of which 3 ms to minimize.
[2024-05-28 03:53:48] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2024-05-28 03:54:00] [INFO ] Deduced a trap composed of 160 places in 313 ms of which 3 ms to minimize.
[2024-05-28 03:54:00] [INFO ] Deduced a trap composed of 168 places in 275 ms of which 2 ms to minimize.
[2024-05-28 03:54:01] [INFO ] Deduced a trap composed of 156 places in 250 ms of which 2 ms to minimize.
[2024-05-28 03:54:01] [INFO ] Deduced a trap composed of 131 places in 192 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1830 variables, and 47 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 03:54:15] [INFO ] Deduced a trap composed of 58 places in 114 ms of which 2 ms to minimize.
[2024-05-28 03:54:15] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 1 ms to minimize.
[2024-05-28 03:54:15] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
[2024-05-28 03:54:16] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2024-05-28 03:54:20] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 03:54:34] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
[2024-05-28 03:54:37] [INFO ] Deduced a trap composed of 164 places in 242 ms of which 3 ms to minimize.
[2024-05-28 03:54:37] [INFO ] Deduced a trap composed of 164 places in 245 ms of which 2 ms to minimize.
[2024-05-28 03:54:37] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1830 variables, and 56 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 17/17 constraints]
After SMT, in 65089ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 65104ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 110907 ms. Remains : 449/449 places, 1405/1405 transitions.
Support contains 38 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 1405/1405 transitions.
Applied a total of 0 rules in 5 ms. Remains 449 /449 variables (removed 0) and now considering 1405/1405 (removed 0) transitions.
Running 1401 sub problems to find dead transitions.
[2024-05-28 03:54:37] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 03:54:37] [INFO ] Invariant cache hit.
[2024-05-28 03:54:37] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 03:54:51] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2024-05-28 03:54:52] [INFO ] Deduced a trap composed of 26 places in 280 ms of which 3 ms to minimize.
[2024-05-28 03:54:52] [INFO ] Deduced a trap composed of 55 places in 221 ms of which 2 ms to minimize.
[2024-05-28 03:54:53] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1830 variables, and 43 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 03:55:09] [INFO ] Deduced a trap composed of 168 places in 210 ms of which 3 ms to minimize.
[2024-05-28 03:55:09] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 1 ms to minimize.
[2024-05-28 03:55:09] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 1 ms to minimize.
[2024-05-28 03:55:10] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
[2024-05-28 03:55:10] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2024-05-28 03:55:12] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2024-05-28 03:55:12] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1830 variables, and 50 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 11/11 constraints]
After SMT, in 44863ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 44877ms
[2024-05-28 03:55:22] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 03:55:22] [INFO ] Invariant cache hit.
[2024-05-28 03:55:23] [INFO ] Implicit Places using invariants in 453 ms returned []
[2024-05-28 03:55:23] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 03:55:23] [INFO ] Invariant cache hit.
[2024-05-28 03:55:24] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:55:32] [INFO ] Implicit Places using invariants and state equation in 9618 ms returned []
Implicit Place search using SMT with State Equation took 10073 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-05-28 03:55:32] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 03:55:32] [INFO ] Invariant cache hit.
[2024-05-28 03:55:32] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 03:55:46] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 1 ms to minimize.
[2024-05-28 03:55:47] [INFO ] Deduced a trap composed of 26 places in 300 ms of which 3 ms to minimize.
[2024-05-28 03:55:47] [INFO ] Deduced a trap composed of 55 places in 290 ms of which 3 ms to minimize.
[2024-05-28 03:55:48] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 1 ms to minimize.
[2024-05-28 03:56:00] [INFO ] Deduced a trap composed of 160 places in 290 ms of which 3 ms to minimize.
[2024-05-28 03:56:00] [INFO ] Deduced a trap composed of 168 places in 196 ms of which 2 ms to minimize.
[2024-05-28 03:56:00] [INFO ] Deduced a trap composed of 156 places in 180 ms of which 2 ms to minimize.
[2024-05-28 03:56:01] [INFO ] Deduced a trap composed of 131 places in 287 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1830 variables, and 47 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 03:56:15] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 2 ms to minimize.
[2024-05-28 03:56:15] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 1 ms to minimize.
[2024-05-28 03:56:15] [INFO ] Deduced a trap composed of 58 places in 36 ms of which 1 ms to minimize.
[2024-05-28 03:56:16] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 2 ms to minimize.
[2024-05-28 03:56:21] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 03:56:36] [INFO ] Deduced a trap composed of 57 places in 39 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 445/1830 variables, and 53 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 14/14 constraints]
After SMT, in 65093ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 65119ms
Finished structural reductions in LTL mode , in 1 iterations and 120085 ms. Remains : 449/449 places, 1405/1405 transitions.
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-05 finished in 545316 ms.
[2024-05-28 03:56:38] [INFO ] Flatten gal took : 75 ms
[2024-05-28 03:56:38] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-28 03:56:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 598 places, 1554 transitions and 7752 arcs took 14 ms.
Total runtime 1634648 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S04J06T06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 598
TRANSITIONS: 1554
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.051s, Sys 0.000s]


SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.007s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2411
MODEL NAME: /home/mcc/execution/416/model
598 places, 1554 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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 LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S04J06T06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PolyORBLF-PT-S04J06T06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445600292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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