Execution Chart

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

Trace from the execution

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

--------------------
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-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717254420597

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:07:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:07:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:07:02] [INFO ] Load time of PNML (sax parser for PT used): 291 ms
[2024-06-01 15:07:02] [INFO ] Transformed 618 places.
[2024-06-01 15:07:02] [INFO ] Transformed 3190 transitions.
[2024-06-01 15:07:02] [INFO ] Parsed PT model containing 618 places and 3190 transitions and 21570 arcs in 422 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 136 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 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 608 transition count 1558
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 608 transition count 1558
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 602 transition count 1552
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 602 transition count 1552
Applied a total of 28 rules in 118 ms. Remains 602 /618 variables (removed 16) and now considering 1552/1564 (removed 12) transitions.
Running 1548 sub problems to find dead transitions.
[2024-06-01 15:07:03] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 602 cols
[2024-06-01 15:07:03] [INFO ] Computed 50 invariants in 98 ms
[2024-06-01 15:07:03] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 15:07:23] [INFO ] Deduced a trap composed of 98 places in 488 ms of which 66 ms to minimize.
[2024-06-01 15:07:24] [INFO ] Deduced a trap composed of 134 places in 573 ms of which 4 ms to minimize.
[2024-06-01 15:07:24] [INFO ] Deduced a trap composed of 133 places in 350 ms of which 3 ms to minimize.
[2024-06-01 15:07:24] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 2 ms to minimize.
[2024-06-01 15:07:26] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 1 ms to minimize.
[2024-06-01 15:07:27] [INFO ] Deduced a trap composed of 288 places in 300 ms of which 3 ms to minimize.
[2024-06-01 15:07:28] [INFO ] Deduced a trap composed of 277 places in 247 ms of which 3 ms to minimize.
[2024-06-01 15:07:28] [INFO ] Deduced a trap composed of 282 places in 297 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/2130 variables, and 52 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20108 ms.
Refiners :[Positive P Invariants (semi-flows): 21/22 constraints, Generalized P Invariants (flows): 23/28 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/2130 variables, and 52 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 21/22 constraints, Generalized P Invariants (flows): 23/28 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 8/8 constraints]
After SMT, in 45885ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 45964ms
[2024-06-01 15:07:49] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 15:07:49] [INFO ] Invariant cache hit.
[2024-06-01 15:07:49] [INFO ] Implicit Places using invariants in 729 ms returned [135, 200, 326, 361, 478, 545]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 750 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/618 places, 1552/1564 transitions.
Applied a total of 0 rules in 14 ms. Remains 596 /596 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46898 ms. Remains : 596/618 places, 1552/1564 transitions.
Support contains 136 out of 596 places after structural reductions.
[2024-06-01 15:07:50] [INFO ] Flatten gal took : 285 ms
[2024-06-01 15:07:50] [INFO ] Flatten gal took : 232 ms
[2024-06-01 15:07:51] [INFO ] Input system was already deterministic with 1552 transitions.
Support contains 132 out of 596 places (down from 136) after GAL structural reductions.
RANDOM walk for 40000 steps (9 resets) in 2433 ms. (16 steps per ms) remains 9/27 properties
BEST_FIRST walk for 40003 steps (8 resets) in 570 ms. (70 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (9 resets) in 368 ms. (108 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (9 resets) in 497 ms. (80 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 354 ms. (112 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 358 ms. (111 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 261 ms. (152 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 364 ms. (109 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 220 ms. (181 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 156 ms. (254 steps per ms) remains 9/9 properties
[2024-06-01 15:07:53] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-06-01 15:07:53] [INFO ] Computed 44 invariants in 67 ms
[2024-06-01 15:07:53] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 1 (OVERLAPS) 292/315 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 114/429 variables, 9/14 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 15/444 variables, 5/19 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
After SMT solving in domain Real declared 596/2124 variables, and 44 constraints, problems are : Problem set: 9 solved, 0 unsolved in 545 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 688ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0 U p1))&&F(G(p2)))))'
Support contains 60 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1552/1552 transitions.
Applied a total of 0 rules in 27 ms. Remains 596 /596 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-06-01 15:07:54] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 15:07:54] [INFO ] Invariant cache hit.
[2024-06-01 15:07:54] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 15:08:20] [INFO ] Deduced a trap composed of 98 places in 233 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 36 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 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, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 15:08:23] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 2 ms to minimize.
[2024-06-01 15:08:23] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2124 variables, and 38 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 3/3 constraints]
After SMT, in 46561ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 46596ms
[2024-06-01 15:08:40] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 15:08:40] [INFO ] Invariant cache hit.
[2024-06-01 15:08:41] [INFO ] Implicit Places using invariants in 1009 ms returned []
[2024-06-01 15:08:41] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 15:08:41] [INFO ] Invariant cache hit.
[2024-06-01 15:08:42] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:08:55] [INFO ] Implicit Places using invariants and state equation in 14030 ms returned []
Implicit Place search using SMT with State Equation took 15052 ms to find 0 implicit places.
Running 1548 sub problems to find dead transitions.
[2024-06-01 15:08:56] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 15:08:56] [INFO ] Invariant cache hit.
[2024-06-01 15:08:56] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 15:09:13] [INFO ] Deduced a trap composed of 98 places in 196 ms of which 3 ms to minimize.
[2024-06-01 15:09:14] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 37 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD81 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1551 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/38 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 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 65895ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 65930ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) removed 90 transitions
Starting structural reductions in LTL mode, iteration 1 : 596/596 places, 1462/1552 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 2 iterations and 127642 ms. Remains : 596/596 places, 1462/1552 transitions.
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLCardinality-02
Stuttering criterion allowed to conclude after 1139 steps with 0 reset in 13 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLCardinality-02 finished in 128060 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)||G(p1))))'
Support contains 31 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1552/1552 transitions.
Applied a total of 0 rules in 10 ms. Remains 596 /596 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-06-01 15:10:02] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 15:10:02] [INFO ] Invariant cache hit.
[2024-06-01 15:10:02] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 15:10:28] [INFO ] Deduced a trap composed of 98 places in 186 ms of which 4 ms to minimize.
SMT process timed out in 26284ms, After SMT, problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 26306ms
[2024-06-01 15:10:28] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 15:10:28] [INFO ] Invariant cache hit.
[2024-06-01 15:10:29] [INFO ] Implicit Places using invariants in 1014 ms returned []
[2024-06-01 15:10:29] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 15:10:29] [INFO ] Invariant cache hit.
[2024-06-01 15:10:30] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:10:47] [INFO ] Implicit Places using invariants and state equation in 17523 ms returned []
Implicit Place search using SMT with State Equation took 18560 ms to find 0 implicit places.
Running 1548 sub problems to find dead transitions.
[2024-06-01 15:10:47] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 15:10:47] [INFO ] Invariant cache hit.
[2024-06-01 15:10:47] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 15:11:12] [INFO ] Deduced a trap composed of 98 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:11:13] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 37 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD81 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1551 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/38 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 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 66174ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 66189ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) removed 90 transitions
Starting structural reductions in LTL mode, iteration 1 : 596/596 places, 1462/1552 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 2 iterations and 111083 ms. Remains : 596/596 places, 1462/1552 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLCardinality-03
Product exploration explored 100000 steps with 723 reset in 760 ms.
Product exploration explored 100000 steps with 722 reset in 526 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 141 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 718 steps (0 resets) in 8 ms. (79 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 148 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 15:11:55] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-06-01 15:11:55] [INFO ] Computed 44 invariants in 53 ms
[2024-06-01 15:11:56] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-06-01 15:11:56] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 87 ms returned sat
[2024-06-01 15:11:58] [INFO ] [Real]Absence check using state equation in 2323 ms returned sat
[2024-06-01 15:11:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:11:59] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2024-06-01 15:11:59] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 90 ms returned sat
[2024-06-01 15:12:04] [INFO ] [Nat]Absence check using state equation in 4253 ms returned sat
[2024-06-01 15:12:04] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:12:05] [INFO ] [Nat]Added 120 Read/Feed constraints in 1084 ms returned sat
[2024-06-01 15:12:05] [INFO ] Deduced a trap composed of 82 places in 227 ms of which 3 ms to minimize.
[2024-06-01 15:12:05] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:12:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 641 ms
[2024-06-01 15:12:06] [INFO ] Computed and/alt/rep : 1008/3943/990 causal constraints (skipped 444 transitions) in 303 ms.
[2024-06-01 15:12:14] [INFO ] Added : 220 causal constraints over 44 iterations in 8106 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 12 out of 596 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1462/1462 transitions.
Applied a total of 0 rules in 25 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Running 1458 sub problems to find dead transitions.
[2024-06-01 15:12:14] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:12:14] [INFO ] Invariant cache hit.
[2024-06-01 15:12:14] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-06-01 15:12:34] [INFO ] Deduced a trap composed of 98 places in 173 ms of which 2 ms to minimize.
[2024-06-01 15:12:34] [INFO ] Deduced a trap composed of 3 places in 110 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 10.0)
(s6 0.0)
(s7 0.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 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.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 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 4.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 2.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 0.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 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 2.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 3.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 1.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 1.0)
(s147 0.0)
(s148 0.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 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 4.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 2.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 3.0)
(s213 0.0)
(s214 0.0)
(s215 9.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 1.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 1.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 4.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 2.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 2.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 2.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 2.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 4.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 3.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 2.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 1.0)
(s359 0.0)
(s360 4.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 1.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 1.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 8.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 4.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 1.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 2.0)
(s445 0.0)
(s446 2.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 1.0)
(s453 2.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 1.0)
(s469 3.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 1.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 1.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s488 0.0)
(s489 4.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 1.0)
(s495 0.0)
(s496 0.0)
(s497 1.0)
(s498 1.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 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 37 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2034 variables, and 38 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 2/2 constraints]
After SMT, in 44531ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 44575ms
[2024-06-01 15:12:58] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:12:58] [INFO ] Invariant cache hit.
[2024-06-01 15:12:59] [INFO ] Implicit Places using invariants in 716 ms returned []
[2024-06-01 15:12:59] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:12:59] [INFO ] Invariant cache hit.
[2024-06-01 15:13:00] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:13:12] [INFO ] Implicit Places using invariants and state equation in 13071 ms returned []
Implicit Place search using SMT with State Equation took 13804 ms to find 0 implicit places.
Running 1458 sub problems to find dead transitions.
[2024-06-01 15:13:12] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:13:12] [INFO ] Invariant cache hit.
[2024-06-01 15:13:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-06-01 15:13:28] [INFO ] Deduced a trap composed of 98 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:13:29] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1458 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 0.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 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.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 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 4.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 2.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 0.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 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 2.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 3.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 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 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 1.0)
(s147 0.0)
(s148 0.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 1.0)
(s161 0.0)
(s162 1.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 4.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 2.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 3.0)
(s213 0.0)
(s214 0.0)
(s215 9.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 1.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 1.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 1.0)
(s241 0.0)
(s242 4.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 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 37 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-06-01 15:14:14] [INFO ] Deduced a trap composed of 33 places in 325 ms of which 3 ms to minimize.
[2024-06-01 15:14:14] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 1 ms to minimize.
[2024-06-01 15:14:14] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 1 ms to minimize.
[2024-06-01 15:14:14] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 2 ms to minimize.
[2024-06-01 15:14:14] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:14:15] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2034 variables, and 44 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 8/8 constraints]
After SMT, in 65078ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 65110ms
Finished structural reductions in LTL mode , in 1 iterations and 123526 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 52 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 465 steps (0 resets) in 8 ms. (51 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 65 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 15:14:17] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:14:17] [INFO ] Invariant cache hit.
[2024-06-01 15:14:18] [INFO ] [Real]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-06-01 15:14:18] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 115 ms returned sat
[2024-06-01 15:14:20] [INFO ] [Real]Absence check using state equation in 1278 ms returned sat
[2024-06-01 15:14:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:14:21] [INFO ] [Nat]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-06-01 15:14:21] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 81 ms returned sat
[2024-06-01 15:14:25] [INFO ] [Nat]Absence check using state equation in 4551 ms returned sat
[2024-06-01 15:14:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:14:27] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:14:27] [INFO ] [Nat]Added 120 Read/Feed constraints in 2086 ms returned sat
[2024-06-01 15:14:28] [INFO ] Deduced a trap composed of 82 places in 514 ms of which 4 ms to minimize.
[2024-06-01 15:14:29] [INFO ] Deduced a trap composed of 55 places in 296 ms of which 3 ms to minimize.
[2024-06-01 15:14:29] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 1 ms to minimize.
[2024-06-01 15:14:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1975 ms
[2024-06-01 15:14:29] [INFO ] Computed and/alt/rep : 1008/3943/990 causal constraints (skipped 444 transitions) in 95 ms.
[2024-06-01 15:14:35] [INFO ] Added : 210 causal constraints over 42 iterations in 5463 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 725 reset in 431 ms.
Product exploration explored 100000 steps with 729 reset in 445 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 12 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 1462/1462 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 596 transition count 1462
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 30 place count 596 transition count 1510
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 66 place count 596 transition count 1510
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 78 place count 584 transition count 1498
Deduced a syphon composed of 54 places in 9 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 90 place count 584 transition count 1498
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 186 place count 584 transition count 1498
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 207 place count 563 transition count 1477
Deduced a syphon composed of 132 places in 2 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 228 place count 563 transition count 1477
Deduced a syphon composed of 132 places in 15 ms
Applied a total of 228 rules in 393 ms. Remains 563 /596 variables (removed 33) and now considering 1477/1462 (removed -15) transitions.
Running 1473 sub problems to find dead transitions.
[2024-06-01 15:14:36] [INFO ] Flow matrix only has 1453 transitions (discarded 24 similar events)
// Phase 1: matrix 1453 rows 563 cols
[2024-06-01 15:14:37] [INFO ] Computed 44 invariants in 42 ms
[2024-06-01 15:14:37] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/559 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/559 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 1473 unsolved
[2024-06-01 15:14:56] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:14:57] [INFO ] Deduced a trap composed of 144 places in 247 ms of which 3 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-01 15:14:57] [INFO ] Deduced a trap composed of 41 places in 280 ms of which 3 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-06-01 15:14:57] [INFO ] Deduced a trap composed of 150 places in 259 ms of which 3 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
[2024-06-01 15:14:59] [INFO ] Deduced a trap composed of 27 places in 331 ms of which 3 ms to minimize.
[2024-06-01 15:14:59] [INFO ] Deduced a trap composed of 63 places in 258 ms of which 4 ms to minimize.
[2024-06-01 15:15:00] [INFO ] Deduced a trap composed of 61 places in 435 ms of which 4 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-06-01 15:15:00] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 1 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD146 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 559/2016 variables, and 47 constraints, problems are : Problem set: 26 solved, 1447 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 22/27 constraints, State Equation: 0/563 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1473/1473 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 26 solved, 1447 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/541 variables, 12/12 constraints. Problems are: Problem set: 26 solved, 1447 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/541 variables, 12/24 constraints. Problems are: Problem set: 26 solved, 1447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/541 variables, 8/32 constraints. Problems are: Problem set: 26 solved, 1447 unsolved
[2024-06-01 15:15:02] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/541 variables, 1/33 constraints. Problems are: Problem set: 26 solved, 1447 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/2016 variables, and 33 constraints, problems are : Problem set: 26 solved, 1447 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 12/27 constraints, State Equation: 0/563 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/1473 constraints, Known Traps: 9/9 constraints]
After SMT, in 44506ms problems are : Problem set: 26 solved, 1447 unsolved
Search for dead transitions found 26 dead transitions in 44552ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 26 transitions.
[2024-06-01 15:15:21] [INFO ] Redundant transitions in 85 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 563/596 places, 1451/1462 transitions.
Graph (complete) has 3320 edges and 563 vertex of which 545 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.18 ms
Discarding 18 places :
Also discarding 0 output transitions
Deduced a syphon composed of 114 places in 2 ms
Applied a total of 1 rules in 101 ms. Remains 545 /563 variables (removed 18) and now considering 1451/1451 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 545/596 places, 1451/1462 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45149 ms. Remains : 545/596 places, 1451/1462 transitions.
Support contains 12 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 30 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Running 1458 sub problems to find dead transitions.
[2024-06-01 15:15:21] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-06-01 15:15:21] [INFO ] Computed 44 invariants in 59 ms
[2024-06-01 15:15:21] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-06-01 15:15:38] [INFO ] Deduced a trap composed of 98 places in 183 ms of which 2 ms to minimize.
[2024-06-01 15:15:39] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2034 variables, and 37 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-06-01 15:15:52] [INFO ] Deduced a trap composed of 82 places in 384 ms of which 5 ms to minimize.
[2024-06-01 15:15:52] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 3 ms to minimize.
[2024-06-01 15:15:53] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:15:53] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2034 variables, and 41 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 20077 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 6/6 constraints]
After SMT, in 44643ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 44674ms
[2024-06-01 15:16:06] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:16:06] [INFO ] Invariant cache hit.
[2024-06-01 15:16:07] [INFO ] Implicit Places using invariants in 849 ms returned []
[2024-06-01 15:16:07] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:16:07] [INFO ] Invariant cache hit.
[2024-06-01 15:16:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:16:31] [INFO ] Implicit Places using invariants and state equation in 23896 ms returned []
Implicit Place search using SMT with State Equation took 24774 ms to find 0 implicit places.
Running 1458 sub problems to find dead transitions.
[2024-06-01 15:16:31] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-06-01 15:16:31] [INFO ] Invariant cache hit.
[2024-06-01 15:16:31] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-06-01 15:16:47] [INFO ] Deduced a trap composed of 98 places in 180 ms of which 4 ms to minimize.
[2024-06-01 15:16:48] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2034 variables, and 37 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-06-01 15:17:29] [INFO ] Deduced a trap composed of 33 places in 369 ms of which 4 ms to minimize.
[2024-06-01 15:17:29] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 2 ms to minimize.
[2024-06-01 15:17:29] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:17:29] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 1 ms to minimize.
[2024-06-01 15:17:30] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 1 ms to minimize.
[2024-06-01 15:17:30] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2034 variables, and 44 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 8/8 constraints]
After SMT, in 64152ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 64170ms
Finished structural reductions in LTL mode , in 1 iterations and 133667 ms. Remains : 596/596 places, 1462/1462 transitions.
Treatment of property PolyORBLF-PT-S04J06T06-LTLCardinality-03 finished in 453367 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)||G(F(p1))))'
Support contains 48 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 1552/1552 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 596 transition count 1510
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 554 transition count 1510
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 84 place count 554 transition count 1438
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 228 place count 482 transition count 1438
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 336 place count 428 transition count 1384
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 339 place count 425 transition count 1381
Iterating global reduction 2 with 3 rules applied. Total rules applied 342 place count 425 transition count 1381
Applied a total of 342 rules in 116 ms. Remains 425 /596 variables (removed 171) and now considering 1381/1552 (removed 171) transitions.
Running 1377 sub problems to find dead transitions.
[2024-06-01 15:17:35] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
// Phase 1: matrix 1357 rows 425 cols
[2024-06-01 15:17:35] [INFO ] Computed 44 invariants in 35 ms
[2024-06-01 15:17:35] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
SMT process timed out in 25718ms, After SMT, problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 25738ms
[2024-06-01 15:18:01] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-06-01 15:18:01] [INFO ] Invariant cache hit.
[2024-06-01 15:18:02] [INFO ] Implicit Places using invariants in 631 ms returned []
[2024-06-01 15:18:02] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-06-01 15:18:02] [INFO ] Invariant cache hit.
[2024-06-01 15:18:03] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:18:13] [INFO ] Implicit Places using invariants and state equation in 11576 ms returned []
Implicit Place search using SMT with State Equation took 12210 ms to find 0 implicit places.
[2024-06-01 15:18:13] [INFO ] Redundant transitions in 169 ms returned []
Running 1377 sub problems to find dead transitions.
[2024-06-01 15:18:13] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-06-01 15:18:13] [INFO ] Invariant cache hit.
[2024-06-01 15:18:13] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-06-01 15:18:28] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 3 ms to minimize.
[2024-06-01 15:18:28] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:18:29] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 19 ms to minimize.
[2024-06-01 15:18:29] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:18:29] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:18:29] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:18:29] [INFO ] Deduced a trap composed of 151 places in 277 ms of which 3 ms to minimize.
[2024-06-01 15:18:29] [INFO ] Deduced a trap composed of 32 places in 288 ms of which 2 ms to minimize.
[2024-06-01 15:18:30] [INFO ] Deduced a trap composed of 57 places in 296 ms of which 4 ms to minimize.
[2024-06-01 15:18:30] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 0 ms to minimize.
[2024-06-01 15:18:31] [INFO ] Deduced a trap composed of 132 places in 334 ms of which 3 ms to minimize.
[2024-06-01 15:18:33] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:18:43] [INFO ] Deduced a trap composed of 242 places in 332 ms of which 3 ms to minimize.
[2024-06-01 15:18:44] [INFO ] Deduced a trap composed of 195 places in 268 ms of which 2 ms to minimize.
[2024-06-01 15:18:45] [INFO ] Deduced a trap composed of 235 places in 368 ms of which 5 ms to minimize.
[2024-06-01 15:18:45] [INFO ] Deduced a trap composed of 238 places in 284 ms of which 2 ms to minimize.
[2024-06-01 15:18:45] [INFO ] Deduced a trap composed of 211 places in 435 ms of which 5 ms to minimize.
[2024-06-01 15:18:46] [INFO ] Deduced a trap composed of 223 places in 336 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1782 variables, and 58 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1377/1377 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/1782 variables, and 58 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1377 constraints, Known Traps: 18/18 constraints]
After SMT, in 66182ms problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 66214ms
Starting structural reductions in SI_LTL mode, iteration 1 : 425/596 places, 1381/1552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104494 ms. Remains : 425/596 places, 1381/1552 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLCardinality-04
Stuttering criterion allowed to conclude after 18613 steps with 5 reset in 141 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLCardinality-04 finished in 104847 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 12 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 1552/1552 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 596 transition count 1522
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 566 transition count 1522
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 60 place count 566 transition count 1444
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 216 place count 488 transition count 1444
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 324 place count 434 transition count 1390
Applied a total of 324 rules in 131 ms. Remains 434 /596 variables (removed 162) and now considering 1390/1552 (removed 162) transitions.
Running 1386 sub problems to find dead transitions.
[2024-06-01 15:19:20] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
// Phase 1: matrix 1366 rows 434 cols
[2024-06-01 15:19:20] [INFO ] Computed 44 invariants in 49 ms
[2024-06-01 15:19:20] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-06-01 15:19:35] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 1 ms to minimize.
[2024-06-01 15:19:35] [INFO ] Deduced a trap composed of 33 places in 279 ms of which 3 ms to minimize.
[2024-06-01 15:19:35] [INFO ] Deduced a trap composed of 62 places in 222 ms of which 3 ms to minimize.
[2024-06-01 15:19:36] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 1 ms to minimize.
[2024-06-01 15:19:45] [INFO ] Deduced a trap composed of 141 places in 219 ms of which 2 ms to minimize.
[2024-06-01 15:19:46] [INFO ] Deduced a trap composed of 140 places in 234 ms of which 2 ms to minimize.
[2024-06-01 15:19:46] [INFO ] Deduced a trap composed of 138 places in 330 ms of which 2 ms to minimize.
SMT process timed out in 25921ms, After SMT, problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 25953ms
[2024-06-01 15:19:46] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
[2024-06-01 15:19:46] [INFO ] Invariant cache hit.
[2024-06-01 15:19:47] [INFO ] Implicit Places using invariants in 600 ms returned []
[2024-06-01 15:19:47] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
[2024-06-01 15:19:47] [INFO ] Invariant cache hit.
[2024-06-01 15:19:48] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:19:57] [INFO ] Implicit Places using invariants and state equation in 10757 ms returned []
Implicit Place search using SMT with State Equation took 11375 ms to find 0 implicit places.
[2024-06-01 15:19:58] [INFO ] Redundant transitions in 36 ms returned []
Running 1386 sub problems to find dead transitions.
[2024-06-01 15:19:58] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
[2024-06-01 15:19:58] [INFO ] Invariant cache hit.
[2024-06-01 15:19:58] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-06-01 15:20:26] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 1 ms to minimize.
[2024-06-01 15:20:26] [INFO ] Deduced a trap composed of 34 places in 272 ms of which 2 ms to minimize.
[2024-06-01 15:20:26] [INFO ] Deduced a trap composed of 63 places in 233 ms of which 2 ms to minimize.
[2024-06-01 15:20:27] [INFO ] Deduced a trap composed of 33 places in 307 ms of which 2 ms to minimize.
[2024-06-01 15:20:27] [INFO ] Deduced a trap composed of 61 places in 320 ms of which 7 ms to minimize.
[2024-06-01 15:20:28] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1800 variables, and 45 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1386/1386 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-06-01 15:20:39] [INFO ] Deduced a trap composed of 145 places in 377 ms of which 2 ms to minimize.
[2024-06-01 15:20:40] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 2 ms to minimize.
[2024-06-01 15:20:40] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 1 ms to minimize.
[2024-06-01 15:20:40] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:20:56] [INFO ] Deduced a trap composed of 138 places in 248 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-06-01 15:21:00] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1800 variables, and 51 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1386 constraints, Known Traps: 12/12 constraints]
After SMT, in 66307ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 66329ms
Starting structural reductions in SI_LTL mode, iteration 1 : 434/596 places, 1390/1552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103860 ms. Remains : 434/596 places, 1390/1552 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLCardinality-07
Product exploration explored 100000 steps with 11 reset in 855 ms.
Product exploration explored 100000 steps with 7 reset in 892 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40002 steps (10 resets) in 520 ms. (76 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (9 resets) in 340 ms. (117 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 142488 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 1
Probabilistic random walk after 142488 steps, saw 95803 distinct states, run finished after 3006 ms. (steps per millisecond=47 ) properties seen :0
[2024-06-01 15:21:09] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
[2024-06-01 15:21:09] [INFO ] Invariant cache hit.
[2024-06-01 15:21:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 293/305 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/373 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 432/1800 variables, and 43 constraints, problems are : Problem set: 1 solved, 0 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 454ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), (X (X p0)), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 26 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S04J06T06-LTLCardinality-07 finished in 109804 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) U (X(p1) U p2))&&p3)))'
Support contains 7 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 1552/1552 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 596 transition count 1510
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 554 transition count 1510
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 84 place count 554 transition count 1438
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 228 place count 482 transition count 1438
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 336 place count 428 transition count 1384
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 339 place count 425 transition count 1381
Iterating global reduction 2 with 3 rules applied. Total rules applied 342 place count 425 transition count 1381
Applied a total of 342 rules in 111 ms. Remains 425 /596 variables (removed 171) and now considering 1381/1552 (removed 171) transitions.
Running 1377 sub problems to find dead transitions.
[2024-06-01 15:21:10] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
// Phase 1: matrix 1357 rows 425 cols
[2024-06-01 15:21:10] [INFO ] Computed 44 invariants in 39 ms
[2024-06-01 15:21:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
SMT process timed out in 25787ms, After SMT, problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 25807ms
[2024-06-01 15:21:36] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-06-01 15:21:36] [INFO ] Invariant cache hit.
[2024-06-01 15:21:36] [INFO ] Implicit Places using invariants in 653 ms returned []
[2024-06-01 15:21:36] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-06-01 15:21:36] [INFO ] Invariant cache hit.
[2024-06-01 15:21:37] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:21:47] [INFO ] Implicit Places using invariants and state equation in 10718 ms returned []
Implicit Place search using SMT with State Equation took 11375 ms to find 0 implicit places.
[2024-06-01 15:21:47] [INFO ] Redundant transitions in 57 ms returned []
Running 1377 sub problems to find dead transitions.
[2024-06-01 15:21:47] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-06-01 15:21:47] [INFO ] Invariant cache hit.
[2024-06-01 15:21:47] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-06-01 15:22:08] [INFO ] Deduced a trap composed of 41 places in 6547 ms of which 7 ms to minimize.
[2024-06-01 15:22:08] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 1 ms to minimize.
[2024-06-01 15:22:08] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:22:08] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:22:09] [INFO ] Deduced a trap composed of 52 places in 399 ms of which 2 ms to minimize.
[2024-06-01 15:22:09] [INFO ] Deduced a trap composed of 156 places in 408 ms of which 12 ms to minimize.
[2024-06-01 15:22:09] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:22:09] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 1 ms to minimize.
[2024-06-01 15:22:09] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 1 ms to minimize.
[2024-06-01 15:22:10] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:22:10] [INFO ] Deduced a trap composed of 61 places in 357 ms of which 5 ms to minimize.
[2024-06-01 15:22:10] [INFO ] Deduced a trap composed of 27 places in 254 ms of which 2 ms to minimize.
[2024-06-01 15:22:11] [INFO ] Deduced a trap composed of 137 places in 331 ms of which 5 ms to minimize.
[2024-06-01 15:22:11] [INFO ] Deduced a trap composed of 143 places in 306 ms of which 3 ms to minimize.
[2024-06-01 15:22:12] [INFO ] Deduced a trap composed of 215 places in 413 ms of which 3 ms to minimize.
[2024-06-01 15:22:13] [INFO ] Deduced a trap composed of 253 places in 342 ms of which 2 ms to minimize.
[2024-06-01 15:22:13] [INFO ] Deduced a trap composed of 242 places in 384 ms of which 6 ms to minimize.
[2024-06-01 15:22:13] [INFO ] Deduced a trap composed of 200 places in 328 ms of which 2 ms to minimize.
[2024-06-01 15:22:14] [INFO ] Deduced a trap composed of 203 places in 308 ms of which 2 ms to minimize.
[2024-06-01 15:22:16] [INFO ] Deduced a trap composed of 194 places in 343 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1782 variables, and 60 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1377/1377 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-06-01 15:22:34] [INFO ] Deduced a trap composed of 48 places in 324 ms of which 4 ms to minimize.
[2024-06-01 15:22:36] [INFO ] Deduced a trap composed of 207 places in 342 ms of which 3 ms to minimize.
[2024-06-01 15:22:40] [INFO ] Deduced a trap composed of 242 places in 309 ms of which 4 ms to minimize.
[2024-06-01 15:22:47] [INFO ] Deduced a trap composed of 206 places in 279 ms of which 3 ms to minimize.
[2024-06-01 15:22:47] [INFO ] Deduced a trap composed of 203 places in 296 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 9)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 6)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 1)
(s191 1)
(s192 1)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 6)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 3)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 1)
(s285 4)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 1)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 1)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 timeout
0)
(s354 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/1782 variables, and 65 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1377 constraints, Known Traps: 25/25 constraints]
After SMT, in 65961ms problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 65982ms
Starting structural reductions in SI_LTL mode, iteration 1 : 425/596 places, 1381/1552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103366 ms. Remains : 425/596 places, 1381/1552 transitions.
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLCardinality-08
Product exploration explored 100000 steps with 1899 reset in 539 ms.
Product exploration explored 100000 steps with 1960 reset in 561 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 p3) (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p0) p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (OR (AND p3 (NOT p2) p0) (AND (NOT p2) p0 p1))), (X (NOT (AND p3 (NOT p2) p0))), (X (AND (NOT p2) p0)), (X (NOT (AND p3 (NOT p2) (NOT p0)))), (X (NOT p3)), (X (OR (AND (NOT p3) (NOT p2) p1) (AND p3 (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p3) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p0) p1))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR (AND p3 (NOT p2) p0) (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (NOT p3))), (X (X (OR (AND (NOT p3) (NOT p2) p1) (AND p3 (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 233 ms. Reduced automaton from 5 states, 19 edges and 4 AP (stutter insensitive) to 5 states, 21 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 395 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)))]
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (11 resets) in 836 ms. (47 steps per ms) remains 3/16 properties
BEST_FIRST walk for 40002 steps (9 resets) in 712 ms. (56 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 475 ms. (84 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 634 ms. (62 steps per ms) remains 3/3 properties
[2024-06-01 15:22:56] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-06-01 15:22:56] [INFO ] Invariant cache hit.
[2024-06-01 15:22:56] [INFO ] State equation strengthened by 120 read => feed constraints.
Problem apf3 is UNSAT
Problem apf9 is UNSAT
Problem apf14 is UNSAT
After SMT solving in domain Real declared 7/1782 variables, and 0 constraints, problems are : Problem set: 3 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 0/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p0) p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (OR (AND p3 (NOT p2) p0) (AND (NOT p2) p0 p1))), (X (NOT (AND p3 (NOT p2) p0))), (X (AND (NOT p2) p0)), (X (NOT (AND p3 (NOT p2) (NOT p0)))), (X (NOT p3)), (X (OR (AND (NOT p3) (NOT p2) p1) (AND p3 (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p3) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p0) p1))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR (AND p3 (NOT p2) p0) (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (NOT p3))), (X (X (OR (AND (NOT p3) (NOT p2) p1) (AND p3 (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p1)), (G (OR p0 p2 p3 p1)), (G (OR p0 p2 (NOT p3))), (G (AND (OR p0 p2 (NOT p3)) (OR p0 p2 (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (AND p0 (NOT p2) p3) (AND p0 (NOT p2) p1)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (NOT p0) p2 (NOT p3)))), (F (NOT (OR (NOT p0) p2 p3 p1))), (F (NOT (OR p3 p1))), (F (NOT (OR p0 p3))), (F (NOT p0)), (F (NOT (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p2) (NOT p3) p1)))), (F p2), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT p1)), (F (NOT (OR p0 p3 p1))), (F p3), (F (NOT (AND p0 (NOT p3))))]
Knowledge based reduction with 34 factoid took 954 ms. Reduced automaton from 5 states, 21 edges and 4 AP (stutter insensitive) to 4 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3))]
[2024-06-01 15:22:58] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-06-01 15:22:58] [INFO ] Invariant cache hit.
[2024-06-01 15:23:09] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-06-01 15:23:09] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 151 ms returned sat
[2024-06-01 15:23:11] [INFO ] [Real]Absence check using state equation in 2319 ms returned sat
[2024-06-01 15:23:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:23:12] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-06-01 15:23:12] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 46 ms returned sat
[2024-06-01 15:23:16] [INFO ] [Nat]Absence check using state equation in 3830 ms returned sat
[2024-06-01 15:23:16] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:23:17] [INFO ] [Nat]Added 120 Read/Feed constraints in 1309 ms returned sat
[2024-06-01 15:23:17] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:23:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2024-06-01 15:23:17] [INFO ] Computed and/alt/rep : 868/3966/850 causal constraints (skipped 503 transitions) in 143 ms.
[2024-06-01 15:23:22] [INFO ] Added : 55 causal constraints over 11 iterations in 4438 ms. Result :sat
Could not prove EG (NOT p3)
[2024-06-01 15:23:22] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-06-01 15:23:22] [INFO ] Invariant cache hit.
[2024-06-01 15:23:23] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-06-01 15:23:23] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 171 ms returned sat
[2024-06-01 15:23:24] [INFO ] [Real]Absence check using state equation in 1179 ms returned sat
[2024-06-01 15:23:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:23:25] [INFO ] [Nat]Absence check using 18 positive place invariants in 21 ms returned sat
[2024-06-01 15:23:25] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 53 ms returned sat
[2024-06-01 15:23:27] [INFO ] [Nat]Absence check using state equation in 2289 ms returned sat
[2024-06-01 15:23:27] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:23:27] [INFO ] [Nat]Added 120 Read/Feed constraints in 294 ms returned sat
[2024-06-01 15:23:28] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 2 ms to minimize.
[2024-06-01 15:23:28] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:23:29] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:23:29] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:23:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1255 ms
[2024-06-01 15:23:29] [INFO ] Computed and/alt/rep : 868/3966/850 causal constraints (skipped 503 transitions) in 141 ms.
[2024-06-01 15:23:36] [INFO ] Added : 302 causal constraints over 61 iterations in 7090 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 7 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 1381/1381 transitions.
Applied a total of 0 rules in 31 ms. Remains 425 /425 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
Running 1377 sub problems to find dead transitions.
[2024-06-01 15:23:36] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-06-01 15:23:36] [INFO ] Invariant cache hit.
[2024-06-01 15:23:36] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-06-01 15:23:59] [INFO ] Deduced a trap composed of 41 places in 257 ms of which 2 ms to minimize.
[2024-06-01 15:23:59] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 14 ms to minimize.
[2024-06-01 15:23:59] [INFO ] Deduced a trap composed of 58 places in 133 ms of which 1 ms to minimize.
[2024-06-01 15:23:59] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 0 ms to minimize.
[2024-06-01 15:24:00] [INFO ] Deduced a trap composed of 52 places in 283 ms of which 3 ms to minimize.
[2024-06-01 15:24:10] [INFO ] Deduced a trap composed of 156 places in 10386 ms of which 31 ms to minimize.
SMT process timed out in 34026ms, After SMT, problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 34041ms
[2024-06-01 15:24:10] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-06-01 15:24:10] [INFO ] Invariant cache hit.
[2024-06-01 15:24:11] [INFO ] Implicit Places using invariants in 870 ms returned []
[2024-06-01 15:24:11] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-06-01 15:24:11] [INFO ] Invariant cache hit.
[2024-06-01 15:24:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:24:24] [INFO ] Implicit Places using invariants and state equation in 12737 ms returned []
Implicit Place search using SMT with State Equation took 13625 ms to find 0 implicit places.
[2024-06-01 15:24:24] [INFO ] Redundant transitions in 46 ms returned []
Running 1377 sub problems to find dead transitions.
[2024-06-01 15:24:24] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-06-01 15:24:24] [INFO ] Invariant cache hit.
[2024-06-01 15:24:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-06-01 15:24:52] [INFO ] Deduced a trap composed of 41 places in 241 ms of which 2 ms to minimize.
[2024-06-01 15:24:53] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 2 ms to minimize.
[2024-06-01 15:24:53] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 2 ms to minimize.
[2024-06-01 15:24:53] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:24:53] [INFO ] Deduced a trap composed of 52 places in 445 ms of which 4 ms to minimize.
[2024-06-01 15:24:54] [INFO ] Deduced a trap composed of 156 places in 340 ms of which 5 ms to minimize.
[2024-06-01 15:24:54] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 1 ms to minimize.
[2024-06-01 15:24:54] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:24:54] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 1 ms to minimize.
[2024-06-01 15:24:54] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 0 ms to minimize.
[2024-06-01 15:24:55] [INFO ] Deduced a trap composed of 61 places in 353 ms of which 4 ms to minimize.
[2024-06-01 15:24:55] [INFO ] Deduced a trap composed of 27 places in 249 ms of which 2 ms to minimize.
[2024-06-01 15:24:56] [INFO ] Deduced a trap composed of 137 places in 347 ms of which 4 ms to minimize.
[2024-06-01 15:24:56] [INFO ] Deduced a trap composed of 143 places in 330 ms of which 3 ms to minimize.
[2024-06-01 15:24:57] [INFO ] Deduced a trap composed of 215 places in 382 ms of which 4 ms to minimize.
[2024-06-01 15:24:57] [INFO ] Deduced a trap composed of 253 places in 365 ms of which 3 ms to minimize.
[2024-06-01 15:24:58] [INFO ] Deduced a trap composed of 242 places in 392 ms of which 3 ms to minimize.
[2024-06-01 15:24:58] [INFO ] Deduced a trap composed of 200 places in 440 ms of which 5 ms to minimize.
[2024-06-01 15:24:59] [INFO ] Deduced a trap composed of 203 places in 437 ms of which 5 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 421/1782 variables, and 59 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1377/1377 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-06-01 15:25:14] [INFO ] Deduced a trap composed of 222 places in 251 ms of which 2 ms to minimize.
[2024-06-01 15:25:18] [INFO ] Deduced a trap composed of 241 places in 330 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/1782 variables, and 61 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1377 constraints, Known Traps: 21/21 constraints]
After SMT, in 66497ms problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 66514ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 114287 ms. Remains : 425/425 places, 1381/1381 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 p3) (NOT p2) p0 p1), (X (NOT (AND (NOT p2) p3))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)) (AND (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT p3)), (X p0), (X p1), (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)) (AND (NOT p2) p3)))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT p3))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 221 ms. Reduced automaton from 4 states, 13 edges and 4 AP (stutter insensitive) to 4 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3))]
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (9 resets) in 520 ms. (76 steps per ms) remains 1/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
[2024-06-01 15:25:31] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-06-01 15:25:31] [INFO ] Invariant cache hit.
[2024-06-01 15:25:31] [INFO ] State equation strengthened by 120 read => feed constraints.
Problem apf5 is UNSAT
After SMT solving in domain Real declared 7/1782 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 0/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 55ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) p0 p1), (X (NOT (AND (NOT p2) p3))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)) (AND (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT p3)), (X p0), (X p1), (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)) (AND (NOT p2) p3)))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT p3))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (G (OR p2 p3 p0 p1))]
False Knowledge obtained : [(F (NOT (OR p3 p0 p1))), (F (NOT (OR p2 p3 (NOT p0) p1))), (F (NOT (OR p3 p0))), (F (NOT (OR p3 (NOT p0) p1))), (F (NOT (OR (AND (NOT p2) p3) (AND (NOT p2) p0) (AND (NOT p2) p1)))), (F (NOT (AND (NOT p3) p0))), (F (NOT p1)), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR (AND (NOT p2) p3) (AND (NOT p2) p1)))), (F p2), (F (NOT p0)), (F p3)]
Knowledge based reduction with 26 factoid took 760 ms. Reduced automaton from 4 states, 13 edges and 4 AP (stutter insensitive) to 4 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3))]
[2024-06-01 15:25:32] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-06-01 15:25:32] [INFO ] Invariant cache hit.
[2024-06-01 15:25:33] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-06-01 15:25:33] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 135 ms returned sat
[2024-06-01 15:25:35] [INFO ] [Real]Absence check using state equation in 2055 ms returned sat
[2024-06-01 15:25:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:25:36] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-06-01 15:25:36] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 63 ms returned sat
[2024-06-01 15:25:40] [INFO ] [Nat]Absence check using state equation in 4021 ms returned sat
[2024-06-01 15:25:40] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:25:41] [INFO ] [Nat]Added 120 Read/Feed constraints in 1044 ms returned sat
[2024-06-01 15:25:41] [INFO ] Computed and/alt/rep : 868/3966/850 causal constraints (skipped 503 transitions) in 161 ms.
[2024-06-01 15:25:46] [INFO ] Added : 40 causal constraints over 8 iterations in 5050 ms. Result :unknown
Could not prove EG (NOT p3)
[2024-06-01 15:25:46] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-06-01 15:25:46] [INFO ] Invariant cache hit.
[2024-06-01 15:25:47] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2024-06-01 15:25:47] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 132 ms returned sat
[2024-06-01 15:25:49] [INFO ] [Real]Absence check using state equation in 1507 ms returned sat
[2024-06-01 15:25:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:25:49] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-06-01 15:25:49] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 52 ms returned sat
[2024-06-01 15:25:52] [INFO ] [Nat]Absence check using state equation in 2136 ms returned sat
[2024-06-01 15:25:52] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:25:52] [INFO ] [Nat]Added 120 Read/Feed constraints in 281 ms returned sat
[2024-06-01 15:25:52] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 2 ms to minimize.
[2024-06-01 15:25:52] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:25:53] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 1 ms to minimize.
[2024-06-01 15:25:53] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 1 ms to minimize.
[2024-06-01 15:25:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1344 ms
[2024-06-01 15:25:53] [INFO ] Computed and/alt/rep : 868/3966/850 causal constraints (skipped 503 transitions) in 121 ms.
[2024-06-01 15:26:02] [INFO ] Added : 302 causal constraints over 61 iterations in 8918 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 1942 reset in 624 ms.
Product exploration explored 100000 steps with 1807 reset in 898 ms.
Support contains 7 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 1381/1381 transitions.
Applied a total of 0 rules in 24 ms. Remains 425 /425 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
Running 1377 sub problems to find dead transitions.
[2024-06-01 15:26:04] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-06-01 15:26:04] [INFO ] Invariant cache hit.
[2024-06-01 15:26:04] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-06-01 15:26:20] [INFO ] Deduced a trap composed of 41 places in 186 ms of which 2 ms to minimize.
[2024-06-01 15:26:20] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 1 ms to minimize.
[2024-06-01 15:26:20] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2024-06-01 15:26:21] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:26:21] [INFO ] Deduced a trap composed of 52 places in 264 ms of which 3 ms to minimize.
[2024-06-01 15:26:21] [INFO ] Deduced a trap composed of 156 places in 236 ms of which 3 ms to minimize.
[2024-06-01 15:26:21] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:26:21] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 1 ms to minimize.
[2024-06-01 15:26:21] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-06-01 15:26:21] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:26:22] [INFO ] Deduced a trap composed of 61 places in 238 ms of which 3 ms to minimize.
[2024-06-01 15:26:22] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 2 ms to minimize.
[2024-06-01 15:26:23] [INFO ] Deduced a trap composed of 137 places in 286 ms of which 4 ms to minimize.
[2024-06-01 15:26:23] [INFO ] Deduced a trap composed of 143 places in 292 ms of which 2 ms to minimize.
[2024-06-01 15:26:24] [INFO ] Deduced a trap composed of 215 places in 349 ms of which 3 ms to minimize.
[2024-06-01 15:26:24] [INFO ] Deduced a trap composed of 253 places in 330 ms of which 3 ms to minimize.
[2024-06-01 15:26:25] [INFO ] Deduced a trap composed of 242 places in 307 ms of which 2 ms to minimize.
[2024-06-01 15:26:25] [INFO ] Deduced a trap composed of 200 places in 301 ms of which 3 ms to minimize.
[2024-06-01 15:26:25] [INFO ] Deduced a trap composed of 203 places in 343 ms of which 3 ms to minimize.
[2024-06-01 15:26:28] [INFO ] Deduced a trap composed of 194 places in 422 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1782 variables, and 60 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1377/1377 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-06-01 15:26:41] [INFO ] Deduced a trap composed of 48 places in 378 ms of which 4 ms to minimize.
[2024-06-01 15:26:43] [INFO ] Deduced a trap composed of 207 places in 354 ms of which 2 ms to minimize.
[2024-06-01 15:26:48] [INFO ] Deduced a trap composed of 242 places in 379 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/1782 variables, and 63 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 20077 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1377 constraints, Known Traps: 23/23 constraints]
After SMT, in 46330ms problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 46348ms
[2024-06-01 15:26:50] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-06-01 15:26:50] [INFO ] Invariant cache hit.
[2024-06-01 15:26:51] [INFO ] Implicit Places using invariants in 639 ms returned []
[2024-06-01 15:26:51] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-06-01 15:26:51] [INFO ] Invariant cache hit.
[2024-06-01 15:26:52] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:27:02] [INFO ] Implicit Places using invariants and state equation in 11273 ms returned []
Implicit Place search using SMT with State Equation took 11928 ms to find 0 implicit places.
[2024-06-01 15:27:02] [INFO ] Redundant transitions in 26 ms returned []
Running 1377 sub problems to find dead transitions.
[2024-06-01 15:27:02] [INFO ] Flow matrix only has 1357 transitions (discarded 24 similar events)
[2024-06-01 15:27:02] [INFO ] Invariant cache hit.
[2024-06-01 15:27:02] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-06-01 15:27:18] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 2 ms to minimize.
[2024-06-01 15:27:18] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 1 ms to minimize.
[2024-06-01 15:27:18] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 1 ms to minimize.
[2024-06-01 15:27:20] [INFO ] Deduced a trap composed of 53 places in 1465 ms of which 29 ms to minimize.
[2024-06-01 15:27:20] [INFO ] Deduced a trap composed of 52 places in 308 ms of which 3 ms to minimize.
[2024-06-01 15:27:21] [INFO ] Deduced a trap composed of 156 places in 320 ms of which 3 ms to minimize.
[2024-06-01 15:27:21] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 0 ms to minimize.
[2024-06-01 15:27:21] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:27:21] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-06-01 15:27:21] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:27:22] [INFO ] Deduced a trap composed of 61 places in 385 ms of which 3 ms to minimize.
[2024-06-01 15:27:22] [INFO ] Deduced a trap composed of 27 places in 273 ms of which 2 ms to minimize.
[2024-06-01 15:27:23] [INFO ] Deduced a trap composed of 137 places in 355 ms of which 3 ms to minimize.
[2024-06-01 15:27:24] [INFO ] Deduced a trap composed of 143 places in 359 ms of which 4 ms to minimize.
[2024-06-01 15:27:25] [INFO ] Deduced a trap composed of 215 places in 505 ms of which 9 ms to minimize.
[2024-06-01 15:27:25] [INFO ] Deduced a trap composed of 253 places in 397 ms of which 3 ms to minimize.
[2024-06-01 15:27:25] [INFO ] Deduced a trap composed of 242 places in 419 ms of which 3 ms to minimize.
[2024-06-01 15:27:26] [INFO ] Deduced a trap composed of 200 places in 297 ms of which 3 ms to minimize.
[2024-06-01 15:27:26] [INFO ] Deduced a trap composed of 203 places in 308 ms of which 2 ms to minimize.
[2024-06-01 15:27:28] [INFO ] Deduced a trap composed of 194 places in 304 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1377 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 421/1782 variables, and 60 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1377/1377 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1377 unsolved
[2024-06-01 15:27:48] [INFO ] Deduced a trap composed of 48 places in 303 ms of which 4 ms to minimize.
[2024-06-01 15:27:50] [INFO ] Deduced a trap composed of 207 places in 430 ms of which 8 ms to minimize.
[2024-06-01 15:27:55] [INFO ] Deduced a trap composed of 242 places in 325 ms of which 6 ms to minimize.
[2024-06-01 15:28:01] [INFO ] Deduced a trap composed of 206 places in 272 ms of which 3 ms to minimize.
[2024-06-01 15:28:02] [INFO ] Deduced a trap composed of 203 places in 252 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/1782 variables, and 65 constraints, problems are : Problem set: 0 solved, 1377 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/425 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1377 constraints, Known Traps: 25/25 constraints]
After SMT, in 65590ms problems are : Problem set: 0 solved, 1377 unsolved
Search for dead transitions found 0 dead transitions in 65605ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 123975 ms. Remains : 425/425 places, 1381/1381 transitions.
Treatment of property PolyORBLF-PT-S04J06T06-LTLCardinality-08 finished in 418155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1552/1552 transitions.
Applied a total of 0 rules in 8 ms. Remains 596 /596 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-06-01 15:28:08] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-06-01 15:28:08] [INFO ] Computed 44 invariants in 43 ms
[2024-06-01 15:28:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 15:28:29] [INFO ] Deduced a trap composed of 98 places in 181 ms of which 8 ms to minimize.
[2024-06-01 15:28:30] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 37 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20058 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2124 variables, and 37 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 46390ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 46407ms
[2024-06-01 15:28:54] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 15:28:54] [INFO ] Invariant cache hit.
[2024-06-01 15:28:55] [INFO ] Implicit Places using invariants in 1070 ms returned []
[2024-06-01 15:28:55] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 15:28:55] [INFO ] Invariant cache hit.
[2024-06-01 15:29:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:29:13] [INFO ] Implicit Places using invariants and state equation in 18052 ms returned []
Implicit Place search using SMT with State Equation took 19129 ms to find 0 implicit places.
Running 1548 sub problems to find dead transitions.
[2024-06-01 15:29:14] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 15:29:14] [INFO ] Invariant cache hit.
[2024-06-01 15:29:14] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 15:29:32] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:29:33] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 37 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD81 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1551 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/38 constraints. Problems are: Problem set: 90 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 593/2124 variables, and 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 65883ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 65900ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) removed 90 transitions
Starting structural reductions in LTL mode, iteration 1 : 596/596 places, 1462/1552 transitions.
Applied a total of 0 rules in 11 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131477 ms. Remains : 596/596 places, 1462/1552 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1431 steps with 0 reset in 9 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLCardinality-09 finished in 131706 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)))'
Support contains 2 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1552/1552 transitions.
Applied a total of 0 rules in 14 ms. Remains 596 /596 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-06-01 15:30:20] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 15:30:20] [INFO ] Invariant cache hit.
[2024-06-01 15:30:20] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
SMT process timed out in 25624ms, After SMT, problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 25651ms
[2024-06-01 15:30:45] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 15:30:45] [INFO ] Invariant cache hit.
[2024-06-01 15:30:54] [INFO ] Implicit Places using invariants in 8232 ms returned []
[2024-06-01 15:30:54] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 15:30:54] [INFO ] Invariant cache hit.
[2024-06-01 15:30:55] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:31:07] [INFO ] Implicit Places using invariants and state equation in 13934 ms returned []
Implicit Place search using SMT with State Equation took 22169 ms to find 0 implicit places.
Running 1548 sub problems to find dead transitions.
[2024-06-01 15:31:08] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-06-01 15:31:08] [INFO ] Invariant cache hit.
[2024-06-01 15:31:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 15:31:28] [INFO ] Deduced a trap composed of 98 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:31:29] [INFO ] Deduced a trap composed of 3 places in 109 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 1.0)
(s5 10.0)
(s6 0.0)
(s7 0.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 0.0)
(s19 0.0)
(s20 1.0)
(s21timeout
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 37 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD81 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1551 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/38 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 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 66879ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 66912ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) removed 90 transitions
Starting structural reductions in LTL mode, iteration 1 : 596/596 places, 1462/1552 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 2 iterations and 114768 ms. Remains : 596/596 places, 1462/1552 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLCardinality-10 finished in 114910 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 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 1552/1552 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 596 transition count 1522
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 566 transition count 1516
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 560 transition count 1516
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 72 place count 560 transition count 1438
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 228 place count 482 transition count 1438
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 300 place count 446 transition count 1402
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 303 place count 443 transition count 1399
Iterating global reduction 3 with 3 rules applied. Total rules applied 306 place count 443 transition count 1399
Applied a total of 306 rules in 117 ms. Remains 443 /596 variables (removed 153) and now considering 1399/1552 (removed 153) transitions.
Running 1395 sub problems to find dead transitions.
[2024-06-01 15:32:15] [INFO ] Flow matrix only has 1375 transitions (discarded 24 similar events)
// Phase 1: matrix 1375 rows 443 cols
[2024-06-01 15:32:15] [INFO ] Computed 44 invariants in 25 ms
[2024-06-01 15:32:15] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
[2024-06-01 15:32:30] [INFO ] Deduced a trap composed of 56 places in 268 ms of which 8 ms to minimize.
[2024-06-01 15:32:30] [INFO ] Deduced a trap composed of 15 places in 263 ms of which 2 ms to minimize.
[2024-06-01 15:32:30] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:32:31] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:32:31] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 0 ms to minimize.
[2024-06-01 15:32:31] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 0 ms to minimize.
[2024-06-01 15:32:31] [INFO ] Deduced a trap composed of 240 places in 295 ms of which 2 ms to minimize.
[2024-06-01 15:32:32] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 2 ms to minimize.
[2024-06-01 15:32:32] [INFO ] Deduced a trap composed of 27 places in 247 ms of which 2 ms to minimize.
[2024-06-01 15:32:33] [INFO ] Deduced a trap composed of 50 places in 864 ms of which 2 ms to minimize.
[2024-06-01 15:32:35] [INFO ] Deduced a trap composed of 186 places in 1002 ms of which 3 ms to minimize.
[2024-06-01 15:32:35] [INFO ] Deduced a trap composed of 150 places in 270 ms of which 3 ms to minimize.
[2024-06-01 15:32:36] [INFO ] Deduced a trap composed of 67 places in 300 ms of which 3 ms to minimize.
[2024-06-01 15:32:38] [INFO ] Deduced a trap composed of 196 places in 378 ms of which 6 ms to minimize.
[2024-06-01 15:32:38] [INFO ] Deduced a trap composed of 145 places in 288 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/1818 variables, and 55 constraints, problems are : Problem set: 0 solved, 1395 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/443 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1395/1395 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
[2024-06-01 15:32:49] [INFO ] Deduced a trap composed of 216 places in 361 ms of which 3 ms to minimize.
[2024-06-01 15:32:49] [INFO ] Deduced a trap composed of 230 places in 338 ms of which 4 ms to minimize.
[2024-06-01 15:32:50] [INFO ] Deduced a trap composed of 169 places in 299 ms of which 2 ms to minimize.
[2024-06-01 15:32:51] [INFO ] Deduced a trap composed of 216 places in 339 ms of which 4 ms to minimize.
[2024-06-01 15:32:52] [INFO ] Deduced a trap composed of 244 places in 305 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/1818 variables, and 60 constraints, problems are : Problem set: 0 solved, 1395 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/443 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1395 constraints, Known Traps: 20/20 constraints]
After SMT, in 44837ms problems are : Problem set: 0 solved, 1395 unsolved
Search for dead transitions found 0 dead transitions in 44858ms
[2024-06-01 15:33:00] [INFO ] Flow matrix only has 1375 transitions (discarded 24 similar events)
[2024-06-01 15:33:00] [INFO ] Invariant cache hit.
[2024-06-01 15:33:00] [INFO ] Implicit Places using invariants in 735 ms returned []
[2024-06-01 15:33:00] [INFO ] Flow matrix only has 1375 transitions (discarded 24 similar events)
[2024-06-01 15:33:00] [INFO ] Invariant cache hit.
[2024-06-01 15:33:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:33:09] [INFO ] Implicit Places using invariants and state equation in 9199 ms returned []
Implicit Place search using SMT with State Equation took 9950 ms to find 0 implicit places.
[2024-06-01 15:33:10] [INFO ] Redundant transitions in 36 ms returned []
Running 1395 sub problems to find dead transitions.
[2024-06-01 15:33:10] [INFO ] Flow matrix only has 1375 transitions (discarded 24 similar events)
[2024-06-01 15:33:10] [INFO ] Invariant cache hit.
[2024-06-01 15:33:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
[2024-06-01 15:33:26] [INFO ] Deduced a trap composed of 56 places in 156 ms of which 2 ms to minimize.
[2024-06-01 15:33:26] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 1 ms to minimize.
[2024-06-01 15:33:26] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:33:26] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 0 ms to minimize.
[2024-06-01 15:33:26] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:33:27] [INFO ] Deduced a trap composed of 15 places in 277 ms of which 15 ms to minimize.
[2024-06-01 15:33:27] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2024-06-01 15:33:27] [INFO ] Deduced a trap composed of 240 places in 315 ms of which 4 ms to minimize.
[2024-06-01 15:33:29] [INFO ] Deduced a trap composed of 27 places in 1675 ms of which 3 ms to minimize.
[2024-06-01 15:33:30] [INFO ] Deduced a trap composed of 38 places in 348 ms of which 4 ms to minimize.
[2024-06-01 15:33:31] [INFO ] Deduced a trap composed of 187 places in 348 ms of which 4 ms to minimize.
[2024-06-01 15:33:32] [INFO ] Deduced a trap composed of 150 places in 313 ms of which 3 ms to minimize.
[2024-06-01 15:33:32] [INFO ] Deduced a trap composed of 137 places in 386 ms of which 3 ms to minimize.
[2024-06-01 15:33:33] [INFO ] Deduced a trap composed of 69 places in 347 ms of which 3 ms to minimize.
[2024-06-01 15:33:34] [INFO ] Deduced a trap composed of 288 places in 335 ms of which 3 ms to minimize.
[2024-06-01 15:33:34] [INFO ] Deduced a trap composed of 206 places in 301 ms of which 3 ms to minimize.
[2024-06-01 15:33:35] [INFO ] Deduced a trap composed of 181 places in 303 ms of which 2 ms to minimize.
[2024-06-01 15:33:35] [INFO ] Deduced a trap composed of 246 places in 283 ms of which 3 ms to minimize.
[2024-06-01 15:33:35] [INFO ] Deduced a trap composed of 160 places in 296 ms of which 3 ms to minimize.
[2024-06-01 15:33:45] [INFO ] Deduced a trap composed of 239 places in 288 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/1818 variables, and 60 constraints, problems are : Problem set: 0 solved, 1395 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/443 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1395/1395 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
[2024-06-01 15:33:57] [INFO ] Deduced a trap composed of 169 places in 341 ms of which 3 ms to minimize.
[2024-06-01 15:33:59] [INFO ] Deduced a trap composed of 218 places in 467 ms of which 6 ms to minimize.
[2024-06-01 15:33:59] [INFO ] Deduced a trap composed of 240 places in 431 ms of which 10 ms to minimize.
[2024-06-01 15:34:02] [INFO ] Deduced a trap composed of 218 places in 502 ms of which 7 ms to minimize.
[2024-06-01 15:34:05] [INFO ] Deduced a trap composed of 220 places in 2736 ms of which 5 ms to minimize.
[2024-06-01 15:34:06] [INFO ] Deduced a trap composed of 222 places in 559 ms of which 3 ms to minimize.
[2024-06-01 15:34:06] [INFO ] Deduced a trap composed of 235 places in 448 ms of which 4 ms to minimize.
[2024-06-01 15:34:07] [INFO ] Deduced a trap composed of 232 places in 411 ms of which 5 ms to minimize.
[2024-06-01 15:34:07] [INFO ] Deduced a trap composed of 217 places in 355 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/1818 variables, and 69 constraints, problems are : Problem set: 0 solved, 1395 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/443 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1395 constraints, Known Traps: 29/29 constraints]
After SMT, in 66061ms problems are : Problem set: 0 solved, 1395 unsolved
Search for dead transitions found 0 dead transitions in 66077ms
Starting structural reductions in SI_LTL mode, iteration 1 : 443/596 places, 1399/1552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121075 ms. Remains : 443/596 places, 1399/1552 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLCardinality-14
Stuttering criterion allowed to conclude after 253 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLCardinality-14 finished in 121171 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)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(p0) U (X(p1) U p2))&&p3)))'
[2024-06-01 15:34:16] [INFO ] Flatten gal took : 81 ms
[2024-06-01 15:34:16] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 15:34:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 596 places, 1552 transitions and 7748 arcs took 12 ms.
Total runtime 1634465 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S04J06T06-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717256058412

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBLF-PT-S04J06T06-LTLCardinality-03
ltl formula formula --ltl=/tmp/2151/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 596 places, 1552 transitions and 7748 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.370 real 0.070 user 0.110 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2151/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2151/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2151/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2151/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 617 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 597, there are 1557 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~324!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 123
pnml2lts-mc( 0/ 4): unique states count: 1108
pnml2lts-mc( 0/ 4): unique transitions count: 2437
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 46
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1117
pnml2lts-mc( 0/ 4): - cum. max stack depth: 994
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1117 states 2481 transitions, fanout: 2.221
pnml2lts-mc( 0/ 4): Total exploration time 0.100 sec (0.090 sec minimum, 0.098 sec on average)
pnml2lts-mc( 0/ 4): States per second: 11170, Transitions per second: 24810
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 46.6 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1582 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S04J06T06-LTLCardinality-08
ltl formula formula --ltl=/tmp/2151/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 596 places, 1552 transitions and 7748 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2151/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2151/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2151/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.350 real 0.060 user 0.080 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2151/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 616 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 597, there are 1566 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~702!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 480
pnml2lts-mc( 0/ 4): unique states count: 2924
pnml2lts-mc( 0/ 4): unique transitions count: 12621
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1368
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 2928
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2448
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2928 states 12641 transitions, fanout: 4.317
pnml2lts-mc( 0/ 4): Total exploration time 0.240 sec (0.220 sec minimum, 0.227 sec on average)
pnml2lts-mc( 0/ 4): States per second: 12200, Transitions per second: 52671
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 32.2 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1582 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S04J06T06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-PT-S04J06T06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446800291"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;