Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 17K Apr 11 17:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 11 17:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K Apr 11 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 157K Apr 11 17:01 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.4K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 11 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 207K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K 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.5M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716863651929

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 02:34:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 02:34:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:34:13] [INFO ] Load time of PNML (sax parser for PT used): 222 ms
[2024-05-28 02:34:13] [INFO ] Transformed 554 places.
[2024-05-28 02:34:13] [INFO ] Transformed 2998 transitions.
[2024-05-28 02:34:13] [INFO ] Parsed PT model containing 554 places and 2998 transitions and 20754 arcs in 359 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 195 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 550 transition count 1372
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 546 transition count 1368
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 546 transition count 1368
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 543 transition count 1365
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 543 transition count 1365
Applied a total of 18 rules in 100 ms. Remains 543 /554 variables (removed 11) and now considering 1365/1372 (removed 7) transitions.
Running 1361 sub problems to find dead transitions.
[2024-05-28 02:34:13] [INFO ] Flow matrix only has 1341 transitions (discarded 24 similar events)
// Phase 1: matrix 1341 rows 543 cols
[2024-05-28 02:34:13] [INFO ] Computed 46 invariants in 79 ms
[2024-05-28 02:34:14] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1361 unsolved
[2024-05-28 02:34:29] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 12 ms to minimize.
[2024-05-28 02:34:29] [INFO ] Deduced a trap composed of 74 places in 130 ms of which 3 ms to minimize.
[2024-05-28 02:34:29] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
[2024-05-28 02:34:29] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 1 ms to minimize.
[2024-05-28 02:34:29] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
[2024-05-28 02:34:30] [INFO ] Deduced a trap composed of 93 places in 154 ms of which 2 ms to minimize.
[2024-05-28 02:34:30] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 1 ms to minimize.
[2024-05-28 02:34:30] [INFO ] Deduced a trap composed of 265 places in 248 ms of which 4 ms to minimize.
[2024-05-28 02:34:30] [INFO ] Deduced a trap composed of 291 places in 264 ms of which 3 ms to minimize.
[2024-05-28 02:34:31] [INFO ] Deduced a trap composed of 15 places in 269 ms of which 3 ms to minimize.
[2024-05-28 02:34:31] [INFO ] Deduced a trap composed of 322 places in 259 ms of which 3 ms to minimize.
[2024-05-28 02:34:31] [INFO ] Deduced a trap composed of 309 places in 263 ms of which 3 ms to minimize.
[2024-05-28 02:34:32] [INFO ] Deduced a trap composed of 315 places in 263 ms of which 3 ms to minimize.
[2024-05-28 02:34:32] [INFO ] Deduced a trap composed of 284 places in 264 ms of which 3 ms to minimize.
[2024-05-28 02:34:32] [INFO ] Deduced a trap composed of 265 places in 241 ms of which 3 ms to minimize.
[2024-05-28 02:34:33] [INFO ] Deduced a trap composed of 177 places in 239 ms of which 2 ms to minimize.
[2024-05-28 02:34:33] [INFO ] Deduced a trap composed of 144 places in 232 ms of which 3 ms to minimize.
[2024-05-28 02:34:33] [INFO ] Deduced a trap composed of 288 places in 242 ms of which 3 ms to minimize.
[2024-05-28 02:34:34] [INFO ] Deduced a trap composed of 278 places in 286 ms of which 3 ms to minimize.
[2024-05-28 02:34:34] [INFO ] Deduced a trap composed of 283 places in 242 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/539 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1361 unsolved
[2024-05-28 02:34:36] [INFO ] Deduced a trap composed of 296 places in 307 ms of which 4 ms to minimize.
[2024-05-28 02:34:37] [INFO ] Deduced a trap composed of 291 places in 313 ms of which 4 ms to minimize.
[2024-05-28 02:34:37] [INFO ] Deduced a trap composed of 274 places in 256 ms of which 4 ms to minimize.
[2024-05-28 02:34:37] [INFO ] Deduced a trap composed of 264 places in 363 ms of which 4 ms to minimize.
[2024-05-28 02:34:38] [INFO ] Deduced a trap composed of 259 places in 299 ms of which 3 ms to minimize.
[2024-05-28 02:34:38] [INFO ] Deduced a trap composed of 89 places in 200 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 539/1884 variables, and 66 constraints, problems are : Problem set: 0 solved, 1361 unsolved in 20082 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/32 constraints, State Equation: 0/543 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1361/1361 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1361 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/539 variables, 26/66 constraints. Problems are: Problem set: 0 solved, 1361 unsolved
[2024-05-28 02:34:51] [INFO ] Deduced a trap composed of 241 places in 350 ms of which 5 ms to minimize.
[2024-05-28 02:34:52] [INFO ] Deduced a trap composed of 304 places in 304 ms of which 3 ms to minimize.
[2024-05-28 02:34:53] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-28 02:34:53] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-28 02:34:54] [INFO ] Deduced a trap composed of 63 places in 301 ms of which 3 ms to minimize.
[2024-05-28 02:34:57] [INFO ] Deduced a trap composed of 312 places in 243 ms of which 3 ms to minimize.
[2024-05-28 02:34:57] [INFO ] Deduced a trap composed of 315 places in 295 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 539/1884 variables, and 73 constraints, problems are : Problem set: 0 solved, 1361 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/32 constraints, State Equation: 0/543 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1361 constraints, Known Traps: 33/33 constraints]
After SMT, in 44949ms problems are : Problem set: 0 solved, 1361 unsolved
Search for dead transitions found 0 dead transitions in 44997ms
[2024-05-28 02:34:58] [INFO ] Flow matrix only has 1341 transitions (discarded 24 similar events)
[2024-05-28 02:34:58] [INFO ] Invariant cache hit.
[2024-05-28 02:34:59] [INFO ] Implicit Places using invariants in 397 ms returned [89, 244, 274, 360, 382, 479]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 416 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 537/554 places, 1365/1372 transitions.
Applied a total of 0 rules in 16 ms. Remains 537 /537 variables (removed 0) and now considering 1365/1365 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45577 ms. Remains : 537/554 places, 1365/1372 transitions.
Support contains 195 out of 537 places after structural reductions.
[2024-05-28 02:34:59] [INFO ] Flatten gal took : 169 ms
[2024-05-28 02:34:59] [INFO ] Flatten gal took : 93 ms
[2024-05-28 02:35:00] [INFO ] Input system was already deterministic with 1365 transitions.
Support contains 185 out of 537 places (down from 195) after GAL structural reductions.
RANDOM walk for 40000 steps (9 resets) in 1754 ms. (22 steps per ms) remains 12/31 properties
BEST_FIRST walk for 40003 steps (8 resets) in 571 ms. (69 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (9 resets) in 298 ms. (133 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (9 resets) in 234 ms. (170 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 199 ms. (200 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 326 ms. (122 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 229 ms. (173 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 235 ms. (169 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (8 resets) in 213 ms. (186 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 201 ms. (198 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 336 ms. (118 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (9 resets) in 156 ms. (254 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 180 ms. (221 steps per ms) remains 12/12 properties
[2024-05-28 02:35:01] [INFO ] Flow matrix only has 1341 transitions (discarded 24 similar events)
// Phase 1: matrix 1341 rows 537 cols
[2024-05-28 02:35:01] [INFO ] Computed 40 invariants in 42 ms
[2024-05-28 02:35:01] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 2 (OVERLAPS) 300/361 variables, 7/8 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 44/405 variables, 6/14 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 6 (OVERLAPS) 129/534 variables, 24/38 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/38 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/535 variables, 1/39 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 0/39 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1341/1876 variables, 535/574 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1876 variables, 120/694 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1876 variables, 0/694 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/1878 variables, 2/696 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1878 variables, 1/697 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1878 variables, 0/697 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1878 variables, 0/697 constraints. Problems are: Problem set: 10 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1878/1878 variables, and 697 constraints, problems are : Problem set: 10 solved, 2 unsolved in 1401 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 537/537 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 262/300 variables, 4/4 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 0/4 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 46/346 variables, 8/12 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/12 constraints. Problems are: Problem set: 10 solved, 2 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 5 (OVERLAPS) 187/533 variables, 25/37 constraints. Problems are: Problem set: 11 solved, 1 unsolved
[2024-05-28 02:35:03] [INFO ] Deduced a trap composed of 75 places in 294 ms of which 4 ms to minimize.
[2024-05-28 02:35:03] [INFO ] Deduced a trap composed of 190 places in 304 ms of which 15 ms to minimize.
[2024-05-28 02:35:04] [INFO ] Deduced a trap composed of 103 places in 284 ms of which 3 ms to minimize.
Problem AtomicPropp30 is UNSAT
After SMT solving in domain Int declared 533/1878 variables, and 40 constraints, problems are : Problem set: 12 solved, 0 unsolved in 1125 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/537 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/12 constraints, Known Traps: 3/3 constraints]
After SMT, in 2636ms problems are : Problem set: 12 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 12 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(G(p1))))))'
Support contains 31 out of 537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 1365/1365 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 534 transition count 1362
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 534 transition count 1362
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 532 transition count 1360
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 532 transition count 1360
Applied a total of 10 rules in 37 ms. Remains 532 /537 variables (removed 5) and now considering 1360/1365 (removed 5) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-28 02:35:04] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-05-28 02:35:04] [INFO ] Computed 40 invariants in 26 ms
[2024-05-28 02:35:04] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:35:20] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 2 ms to minimize.
[2024-05-28 02:35:21] [INFO ] Deduced a trap composed of 139 places in 241 ms of which 3 ms to minimize.
[2024-05-28 02:35:21] [INFO ] Deduced a trap composed of 304 places in 242 ms of which 3 ms to minimize.
[2024-05-28 02:35:22] [INFO ] Deduced a trap composed of 278 places in 217 ms of which 16 ms to minimize.
[2024-05-28 02:35:22] [INFO ] Deduced a trap composed of 258 places in 216 ms of which 3 ms to minimize.
[2024-05-28 02:35:22] [INFO ] Deduced a trap composed of 286 places in 198 ms of which 3 ms to minimize.
[2024-05-28 02:35:23] [INFO ] Deduced a trap composed of 299 places in 231 ms of which 3 ms to minimize.
[2024-05-28 02:35:23] [INFO ] Deduced a trap composed of 253 places in 211 ms of which 2 ms to minimize.
[2024-05-28 02:35:23] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 2 ms to minimize.
[2024-05-28 02:35:24] [INFO ] Deduced a trap composed of 82 places in 156 ms of which 2 ms to minimize.
[2024-05-28 02:35:24] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2024-05-28 02:35:26] [INFO ] Deduced a trap composed of 289 places in 255 ms of which 3 ms to minimize.
[2024-05-28 02:35:26] [INFO ] Deduced a trap composed of 348 places in 220 ms of which 3 ms to minimize.
[2024-05-28 02:35:26] [INFO ] Deduced a trap composed of 291 places in 220 ms of which 6 ms to minimize.
[2024-05-28 02:35:27] [INFO ] Deduced a trap composed of 42 places in 223 ms of which 4 ms to minimize.
[2024-05-28 02:35:28] [INFO ] Deduced a trap composed of 321 places in 301 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 43 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:35:37] [INFO ] Deduced a trap composed of 344 places in 290 ms of which 3 ms to minimize.
[2024-05-28 02:35:44] [INFO ] Deduced a trap composed of 5 places in 336 ms of which 3 ms to minimize.
[2024-05-28 02:35:45] [INFO ] Deduced a trap composed of 3 places in 262 ms of which 3 ms to minimize.
[2024-05-28 02:35:45] [INFO ] Deduced a trap composed of 5 places in 290 ms of which 7 ms to minimize.
[2024-05-28 02:35:45] [INFO ] Deduced a trap composed of 74 places in 285 ms of which 3 ms to minimize.
[2024-05-28 02:35:45] [INFO ] Deduced a trap composed of 28 places in 264 ms of which 3 ms to minimize.
[2024-05-28 02:35:46] [INFO ] Deduced a trap composed of 28 places in 262 ms of which 3 ms to minimize.
[2024-05-28 02:35:46] [INFO ] Deduced a trap composed of 303 places in 263 ms of which 3 ms to minimize.
[2024-05-28 02:35:46] [INFO ] Deduced a trap composed of 75 places in 261 ms of which 3 ms to minimize.
[2024-05-28 02:35:47] [INFO ] Deduced a trap composed of 74 places in 255 ms of which 2 ms to minimize.
[2024-05-28 02:35:47] [INFO ] Deduced a trap composed of 75 places in 40 ms of which 0 ms to minimize.
[2024-05-28 02:35:47] [INFO ] Deduced a trap composed of 317 places in 248 ms of which 3 ms to minimize.
[2024-05-28 02:35:47] [INFO ] Deduced a trap composed of 74 places in 41 ms of which 1 ms to minimize.
[2024-05-28 02:35:48] [INFO ] Deduced a trap composed of 342 places in 334 ms of which 3 ms to minimize.
[2024-05-28 02:35:48] [INFO ] Deduced a trap composed of 314 places in 307 ms of which 4 ms to minimize.
[2024-05-28 02:35:49] [INFO ] Deduced a trap composed of 310 places in 283 ms of which 3 ms to minimize.
[2024-05-28 02:35:49] [INFO ] Deduced a trap composed of 337 places in 260 ms of which 3 ms to minimize.
SMT process timed out in 44753ms, After SMT, problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 44770ms
[2024-05-28 02:35:49] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 02:35:49] [INFO ] Invariant cache hit.
[2024-05-28 02:35:49] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-28 02:35:49] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 02:35:49] [INFO ] Invariant cache hit.
[2024-05-28 02:35:50] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:35:59] [INFO ] Implicit Places using invariants and state equation in 9403 ms returned []
Implicit Place search using SMT with State Equation took 9849 ms to find 0 implicit places.
Running 1356 sub problems to find dead transitions.
[2024-05-28 02:35:59] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 02:35:59] [INFO ] Invariant cache hit.
[2024-05-28 02:35:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:36:15] [INFO ] Deduced a trap composed of 142 places in 282 ms of which 4 ms to minimize.
[2024-05-28 02:36:16] [INFO ] Deduced a trap composed of 304 places in 261 ms of which 3 ms to minimize.
[2024-05-28 02:36:16] [INFO ] Deduced a trap composed of 323 places in 241 ms of which 3 ms to minimize.
[2024-05-28 02:36:16] [INFO ] Deduced a trap composed of 262 places in 195 ms of which 3 ms to minimize.
[2024-05-28 02:36:17] [INFO ] Deduced a trap composed of 280 places in 196 ms of which 2 ms to minimize.
[2024-05-28 02:36:17] [INFO ] Deduced a trap composed of 286 places in 253 ms of which 3 ms to minimize.
[2024-05-28 02:36:17] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 2 ms to minimize.
[2024-05-28 02:36:18] [INFO ] Deduced a trap composed of 283 places in 260 ms of which 3 ms to minimize.
[2024-05-28 02:36:18] [INFO ] Deduced a trap composed of 267 places in 228 ms of which 3 ms to minimize.
[2024-05-28 02:36:18] [INFO ] Deduced a trap composed of 70 places in 144 ms of which 2 ms to minimize.
[2024-05-28 02:36:18] [INFO ] Deduced a trap composed of 86 places in 172 ms of which 2 ms to minimize.
[2024-05-28 02:36:19] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 1 ms to minimize.
[2024-05-28 02:36:19] [INFO ] Deduced a trap composed of 19 places in 239 ms of which 2 ms to minimize.
[2024-05-28 02:36:19] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 2 ms to minimize.
[2024-05-28 02:36:22] [INFO ] Deduced a trap composed of 291 places in 250 ms of which 3 ms to minimize.
[2024-05-28 02:36:22] [INFO ] Deduced a trap composed of 42 places in 291 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 43 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:36:44] [INFO ] Deduced a trap composed of 3 places in 342 ms of which 4 ms to minimize.
[2024-05-28 02:36:44] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 3 ms to minimize.
[2024-05-28 02:36:44] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 3 ms to minimize.
[2024-05-28 02:36:45] [INFO ] Deduced a trap composed of 74 places in 284 ms of which 3 ms to minimize.
[2024-05-28 02:36:45] [INFO ] Deduced a trap composed of 28 places in 257 ms of which 3 ms to minimize.
[2024-05-28 02:36:45] [INFO ] Deduced a trap composed of 74 places in 265 ms of which 2 ms to minimize.
[2024-05-28 02:36:45] [INFO ] Deduced a trap composed of 301 places in 253 ms of which 3 ms to minimize.
[2024-05-28 02:36:46] [INFO ] Deduced a trap composed of 28 places in 262 ms of which 3 ms to minimize.
[2024-05-28 02:36:46] [INFO ] Deduced a trap composed of 74 places in 254 ms of which 3 ms to minimize.
[2024-05-28 02:36:46] [INFO ] Deduced a trap composed of 74 places in 259 ms of which 3 ms to minimize.
[2024-05-28 02:36:46] [INFO ] Deduced a trap composed of 341 places in 260 ms of which 3 ms to minimize.
[2024-05-28 02:36:47] [INFO ] Deduced a trap composed of 350 places in 263 ms of which 3 ms to minimize.
[2024-05-28 02:36:47] [INFO ] Deduced a trap composed of 338 places in 254 ms of which 3 ms to minimize.
[2024-05-28 02:36:47] [INFO ] Deduced a trap composed of 325 places in 259 ms of which 3 ms to minimize.
[2024-05-28 02:36:48] [INFO ] Deduced a trap composed of 292 places in 278 ms of which 3 ms to minimize.
[2024-05-28 02:36:48] [INFO ] Deduced a trap composed of 75 places in 38 ms of which 1 ms to minimize.
[2024-05-28 02:36:51] [INFO ] Deduced a trap composed of 357 places in 369 ms of which 4 ms to minimize.
[2024-05-28 02:36:51] [INFO ] Deduced a trap composed of 98 places in 324 ms of which 4 ms to minimize.
[2024-05-28 02:36:52] [INFO ] Deduced a trap composed of 352 places in 345 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 62 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 35/35 constraints]
After SMT, in 64553ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 64579ms
Starting structural reductions in LTL mode, iteration 1 : 532/537 places, 1360/1365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119247 ms. Remains : 532/537 places, 1360/1365 transitions.
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLCardinality-01
Product exploration explored 100000 steps with 6 reset in 604 ms.
Stack based approach found an accepted trace after 6545 steps with 1 reset with depth 5544 and stack size 5544 in 31 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLCardinality-01 finished in 120200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((p1 U p2)))))'
Support contains 38 out of 537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 1365/1365 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 534 transition count 1362
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 534 transition count 1362
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 532 transition count 1360
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 532 transition count 1360
Applied a total of 10 rules in 36 ms. Remains 532 /537 variables (removed 5) and now considering 1360/1365 (removed 5) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-28 02:37:04] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 02:37:04] [INFO ] Invariant cache hit.
[2024-05-28 02:37:04] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:37:21] [INFO ] Deduced a trap composed of 142 places in 289 ms of which 3 ms to minimize.
[2024-05-28 02:37:21] [INFO ] Deduced a trap composed of 304 places in 291 ms of which 3 ms to minimize.
[2024-05-28 02:37:22] [INFO ] Deduced a trap composed of 323 places in 279 ms of which 3 ms to minimize.
[2024-05-28 02:37:22] [INFO ] Deduced a trap composed of 262 places in 248 ms of which 3 ms to minimize.
[2024-05-28 02:37:22] [INFO ] Deduced a trap composed of 280 places in 218 ms of which 3 ms to minimize.
[2024-05-28 02:37:23] [INFO ] Deduced a trap composed of 286 places in 201 ms of which 3 ms to minimize.
[2024-05-28 02:37:23] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 1 ms to minimize.
[2024-05-28 02:37:23] [INFO ] Deduced a trap composed of 283 places in 246 ms of which 3 ms to minimize.
[2024-05-28 02:37:24] [INFO ] Deduced a trap composed of 267 places in 217 ms of which 2 ms to minimize.
[2024-05-28 02:37:24] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 1 ms to minimize.
[2024-05-28 02:37:24] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 2 ms to minimize.
[2024-05-28 02:37:24] [INFO ] Deduced a trap composed of 82 places in 132 ms of which 2 ms to minimize.
[2024-05-28 02:37:24] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 1 ms to minimize.
[2024-05-28 02:37:24] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 1 ms to minimize.
[2024-05-28 02:37:26] [INFO ] Deduced a trap composed of 291 places in 197 ms of which 2 ms to minimize.
[2024-05-28 02:37:27] [INFO ] Deduced a trap composed of 42 places in 253 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 43 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:37:40] [INFO ] Deduced a trap composed of 3 places in 287 ms of which 3 ms to minimize.
[2024-05-28 02:37:40] [INFO ] Deduced a trap composed of 5 places in 269 ms of which 4 ms to minimize.
[2024-05-28 02:37:40] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 3 ms to minimize.
[2024-05-28 02:37:41] [INFO ] Deduced a trap composed of 74 places in 267 ms of which 3 ms to minimize.
[2024-05-28 02:37:41] [INFO ] Deduced a trap composed of 28 places in 277 ms of which 3 ms to minimize.
[2024-05-28 02:37:41] [INFO ] Deduced a trap composed of 74 places in 272 ms of which 3 ms to minimize.
[2024-05-28 02:37:42] [INFO ] Deduced a trap composed of 301 places in 290 ms of which 3 ms to minimize.
[2024-05-28 02:37:42] [INFO ] Deduced a trap composed of 28 places in 273 ms of which 3 ms to minimize.
[2024-05-28 02:37:42] [INFO ] Deduced a trap composed of 74 places in 270 ms of which 4 ms to minimize.
[2024-05-28 02:37:42] [INFO ] Deduced a trap composed of 74 places in 271 ms of which 3 ms to minimize.
[2024-05-28 02:37:43] [INFO ] Deduced a trap composed of 341 places in 268 ms of which 3 ms to minimize.
[2024-05-28 02:37:43] [INFO ] Deduced a trap composed of 350 places in 283 ms of which 3 ms to minimize.
[2024-05-28 02:37:43] [INFO ] Deduced a trap composed of 338 places in 274 ms of which 3 ms to minimize.
[2024-05-28 02:37:44] [INFO ] Deduced a trap composed of 325 places in 264 ms of which 3 ms to minimize.
[2024-05-28 02:37:44] [INFO ] Deduced a trap composed of 292 places in 268 ms of which 3 ms to minimize.
[2024-05-28 02:37:44] [INFO ] Deduced a trap composed of 75 places in 44 ms of which 0 ms to minimize.
[2024-05-28 02:37:47] [INFO ] Deduced a trap composed of 357 places in 327 ms of which 3 ms to minimize.
[2024-05-28 02:37:47] [INFO ] Deduced a trap composed of 98 places in 244 ms of which 3 ms to minimize.
[2024-05-28 02:37:48] [INFO ] Deduced a trap composed of 352 places in 261 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 62 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 35/35 constraints]
After SMT, in 44605ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 44618ms
[2024-05-28 02:37:49] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 02:37:49] [INFO ] Invariant cache hit.
[2024-05-28 02:37:49] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-05-28 02:37:49] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 02:37:49] [INFO ] Invariant cache hit.
[2024-05-28 02:37:50] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:38:00] [INFO ] Implicit Places using invariants and state equation in 10529 ms returned []
Implicit Place search using SMT with State Equation took 11010 ms to find 0 implicit places.
Running 1356 sub problems to find dead transitions.
[2024-05-28 02:38:00] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 02:38:00] [INFO ] Invariant cache hit.
[2024-05-28 02:38:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:38:15] [INFO ] Deduced a trap composed of 142 places in 219 ms of which 3 ms to minimize.
[2024-05-28 02:38:15] [INFO ] Deduced a trap composed of 304 places in 233 ms of which 2 ms to minimize.
[2024-05-28 02:38:16] [INFO ] Deduced a trap composed of 323 places in 242 ms of which 3 ms to minimize.
[2024-05-28 02:38:16] [INFO ] Deduced a trap composed of 262 places in 236 ms of which 4 ms to minimize.
[2024-05-28 02:38:16] [INFO ] Deduced a trap composed of 280 places in 238 ms of which 4 ms to minimize.
[2024-05-28 02:38:17] [INFO ] Deduced a trap composed of 286 places in 248 ms of which 4 ms to minimize.
[2024-05-28 02:38:17] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 2 ms to minimize.
[2024-05-28 02:38:18] [INFO ] Deduced a trap composed of 283 places in 242 ms of which 3 ms to minimize.
[2024-05-28 02:38:18] [INFO ] Deduced a trap composed of 267 places in 210 ms of which 3 ms to minimize.
[2024-05-28 02:38:18] [INFO ] Deduced a trap composed of 70 places in 130 ms of which 1 ms to minimize.
[2024-05-28 02:38:18] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 1 ms to minimize.
[2024-05-28 02:38:18] [INFO ] Deduced a trap composed of 82 places in 129 ms of which 1 ms to minimize.
[2024-05-28 02:38:18] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 1 ms to minimize.
[2024-05-28 02:38:19] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2024-05-28 02:38:21] [INFO ] Deduced a trap composed of 291 places in 200 ms of which 2 ms to minimize.
[2024-05-28 02:38:21] [INFO ] Deduced a trap composed of 42 places in 235 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 43 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:38:44] [INFO ] Deduced a trap composed of 3 places in 287 ms of which 3 ms to minimize.
[2024-05-28 02:38:44] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 3 ms to minimize.
[2024-05-28 02:38:45] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 3 ms to minimize.
[2024-05-28 02:38:45] [INFO ] Deduced a trap composed of 74 places in 257 ms of which 3 ms to minimize.
[2024-05-28 02:38:45] [INFO ] Deduced a trap composed of 28 places in 256 ms of which 3 ms to minimize.
[2024-05-28 02:38:46] [INFO ] Deduced a trap composed of 74 places in 320 ms of which 4 ms to minimize.
[2024-05-28 02:38:46] [INFO ] Deduced a trap composed of 301 places in 305 ms of which 4 ms to minimize.
[2024-05-28 02:38:46] [INFO ] Deduced a trap composed of 28 places in 282 ms of which 3 ms to minimize.
[2024-05-28 02:38:46] [INFO ] Deduced a trap composed of 74 places in 253 ms of which 3 ms to minimize.
[2024-05-28 02:38:47] [INFO ] Deduced a trap composed of 74 places in 256 ms of which 3 ms to minimize.
[2024-05-28 02:38:47] [INFO ] Deduced a trap composed of 341 places in 251 ms of which 3 ms to minimize.
[2024-05-28 02:38:47] [INFO ] Deduced a trap composed of 350 places in 253 ms of which 3 ms to minimize.
[2024-05-28 02:38:47] [INFO ] Deduced a trap composed of 338 places in 251 ms of which 2 ms to minimize.
[2024-05-28 02:38:48] [INFO ] Deduced a trap composed of 325 places in 256 ms of which 3 ms to minimize.
[2024-05-28 02:38:48] [INFO ] Deduced a trap composed of 292 places in 251 ms of which 3 ms to minimize.
[2024-05-28 02:38:48] [INFO ] Deduced a trap composed of 75 places in 38 ms of which 1 ms to minimize.
[2024-05-28 02:38:52] [INFO ] Deduced a trap composed of 357 places in 356 ms of which 3 ms to minimize.
[2024-05-28 02:38:52] [INFO ] Deduced a trap composed of 98 places in 310 ms of which 4 ms to minimize.
[2024-05-28 02:38:53] [INFO ] Deduced a trap composed of 352 places in 360 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 62 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 35/35 constraints]
After SMT, in 64377ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 64392ms
Starting structural reductions in LTL mode, iteration 1 : 532/537 places, 1360/1365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120064 ms. Remains : 532/537 places, 1360/1365 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 808 ms.
Product exploration explored 100000 steps with 50000 reset in 624 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (X (X (OR p2 p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 35 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S04J04T06-LTLCardinality-05 finished in 121745 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 1365/1365 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 537 transition count 1327
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 499 transition count 1327
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 61 Pre rules applied. Total rules applied 76 place count 499 transition count 1266
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 198 place count 438 transition count 1266
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 199 place count 437 transition count 1265
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 437 transition count 1265
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 320 place count 377 transition count 1205
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 322 place count 375 transition count 1203
Iterating global reduction 2 with 2 rules applied. Total rules applied 324 place count 375 transition count 1203
Applied a total of 324 rules in 258 ms. Remains 375 /537 variables (removed 162) and now considering 1203/1365 (removed 162) transitions.
Running 1199 sub problems to find dead transitions.
[2024-05-28 02:39:06] [INFO ] Flow matrix only has 1179 transitions (discarded 24 similar events)
// Phase 1: matrix 1179 rows 375 cols
[2024-05-28 02:39:06] [INFO ] Computed 40 invariants in 22 ms
[2024-05-28 02:39:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 02:39:18] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-05-28 02:39:18] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-05-28 02:39:18] [INFO ] Deduced a trap composed of 49 places in 282 ms of which 3 ms to minimize.
[2024-05-28 02:39:18] [INFO ] Deduced a trap composed of 48 places in 277 ms of which 3 ms to minimize.
[2024-05-28 02:39:19] [INFO ] Deduced a trap composed of 158 places in 257 ms of which 2 ms to minimize.
[2024-05-28 02:39:19] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 2 ms to minimize.
[2024-05-28 02:39:19] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 2 ms to minimize.
[2024-05-28 02:39:19] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 0 ms to minimize.
[2024-05-28 02:39:19] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 1 ms to minimize.
[2024-05-28 02:39:20] [INFO ] Deduced a trap composed of 154 places in 199 ms of which 3 ms to minimize.
[2024-05-28 02:39:20] [INFO ] Deduced a trap composed of 46 places in 179 ms of which 2 ms to minimize.
[2024-05-28 02:39:21] [INFO ] Deduced a trap composed of 127 places in 219 ms of which 3 ms to minimize.
[2024-05-28 02:39:22] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 2 ms to minimize.
[2024-05-28 02:39:28] [INFO ] Deduced a trap composed of 193 places in 234 ms of which 3 ms to minimize.
[2024-05-28 02:39:29] [INFO ] Deduced a trap composed of 185 places in 254 ms of which 3 ms to minimize.
[2024-05-28 02:39:29] [INFO ] Deduced a trap composed of 189 places in 215 ms of which 2 ms to minimize.
[2024-05-28 02:39:30] [INFO ] Deduced a trap composed of 147 places in 194 ms of which 2 ms to minimize.
[2024-05-28 02:39:30] [INFO ] Deduced a trap composed of 198 places in 179 ms of which 2 ms to minimize.
[2024-05-28 02:39:30] [INFO ] Deduced a trap composed of 184 places in 213 ms of which 2 ms to minimize.
[2024-05-28 02:39:31] [INFO ] Deduced a trap composed of 176 places in 242 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 371/1554 variables, and 56 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/375 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 02:39:36] [INFO ] Deduced a trap composed of 184 places in 254 ms of which 2 ms to minimize.
[2024-05-28 02:39:36] [INFO ] Deduced a trap composed of 174 places in 214 ms of which 2 ms to minimize.
[2024-05-28 02:39:51] [INFO ] Deduced a trap composed of 122 places in 265 ms of which 3 ms to minimize.
[2024-05-28 02:39:51] [INFO ] Deduced a trap composed of 34 places in 246 ms of which 3 ms to minimize.
SMT process timed out in 44866ms, After SMT, problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 44879ms
[2024-05-28 02:39:51] [INFO ] Flow matrix only has 1179 transitions (discarded 24 similar events)
[2024-05-28 02:39:51] [INFO ] Invariant cache hit.
[2024-05-28 02:39:52] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-28 02:39:52] [INFO ] Flow matrix only has 1179 transitions (discarded 24 similar events)
[2024-05-28 02:39:52] [INFO ] Invariant cache hit.
[2024-05-28 02:39:52] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:40:00] [INFO ] Implicit Places using invariants and state equation in 8390 ms returned []
Implicit Place search using SMT with State Equation took 8829 ms to find 0 implicit places.
[2024-05-28 02:40:00] [INFO ] Redundant transitions in 99 ms returned []
Running 1199 sub problems to find dead transitions.
[2024-05-28 02:40:00] [INFO ] Flow matrix only has 1179 transitions (discarded 24 similar events)
[2024-05-28 02:40:00] [INFO ] Invariant cache hit.
[2024-05-28 02:40:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 02:40:11] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 2 ms to minimize.
[2024-05-28 02:40:11] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-05-28 02:40:11] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 1 ms to minimize.
[2024-05-28 02:40:12] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
[2024-05-28 02:40:12] [INFO ] Deduced a trap composed of 49 places in 238 ms of which 2 ms to minimize.
[2024-05-28 02:40:12] [INFO ] Deduced a trap composed of 167 places in 230 ms of which 2 ms to minimize.
[2024-05-28 02:40:12] [INFO ] Deduced a trap composed of 15 places in 239 ms of which 2 ms to minimize.
[2024-05-28 02:40:12] [INFO ] Deduced a trap composed of 181 places in 202 ms of which 2 ms to minimize.
[2024-05-28 02:40:13] [INFO ] Deduced a trap composed of 165 places in 226 ms of which 2 ms to minimize.
[2024-05-28 02:40:13] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 0 ms to minimize.
[2024-05-28 02:40:13] [INFO ] Deduced a trap composed of 145 places in 179 ms of which 2 ms to minimize.
[2024-05-28 02:40:14] [INFO ] Deduced a trap composed of 64 places in 190 ms of which 2 ms to minimize.
[2024-05-28 02:40:14] [INFO ] Deduced a trap composed of 127 places in 220 ms of which 3 ms to minimize.
[2024-05-28 02:40:15] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 2 ms to minimize.
[2024-05-28 02:40:19] [INFO ] Deduced a trap composed of 169 places in 220 ms of which 2 ms to minimize.
[2024-05-28 02:40:19] [INFO ] Deduced a trap composed of 176 places in 162 ms of which 2 ms to minimize.
[2024-05-28 02:40:22] [INFO ] Deduced a trap composed of 185 places in 236 ms of which 3 ms to minimize.
[2024-05-28 02:40:23] [INFO ] Deduced a trap composed of 171 places in 217 ms of which 2 ms to minimize.
[2024-05-28 02:40:24] [INFO ] Deduced a trap composed of 41 places in 232 ms of which 3 ms to minimize.
[2024-05-28 02:40:24] [INFO ] Deduced a trap composed of 103 places in 198 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 371/1554 variables, and 56 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/375 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/371 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 02:40:53] [INFO ] Deduced a trap composed of 159 places in 235 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 02:41:02] [INFO ] Deduced a trap composed of 175 places in 311 ms of which 3 ms to minimize.
[2024-05-28 02:41:02] [INFO ] Deduced a trap composed of 172 places in 243 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/1554 variables, and 59 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/375 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 23/23 constraints]
After SMT, in 64463ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 64479ms
Starting structural reductions in SI_LTL mode, iteration 1 : 375/537 places, 1203/1365 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118559 ms. Remains : 375/537 places, 1203/1365 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLCardinality-09
Stuttering criterion allowed to conclude after 11013 steps with 1 reset in 47 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLCardinality-09 finished in 118719 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(G(p1))))))'
Support contains 3 out of 537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 1365/1365 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 534 transition count 1362
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 534 transition count 1362
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 532 transition count 1360
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 532 transition count 1360
Applied a total of 10 rules in 48 ms. Remains 532 /537 variables (removed 5) and now considering 1360/1365 (removed 5) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-28 02:41:05] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-05-28 02:41:05] [INFO ] Computed 40 invariants in 50 ms
[2024-05-28 02:41:05] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:41:20] [INFO ] Deduced a trap composed of 39 places in 206 ms of which 2 ms to minimize.
[2024-05-28 02:41:21] [INFO ] Deduced a trap composed of 139 places in 267 ms of which 3 ms to minimize.
[2024-05-28 02:41:21] [INFO ] Deduced a trap composed of 304 places in 266 ms of which 2 ms to minimize.
[2024-05-28 02:41:22] [INFO ] Deduced a trap composed of 278 places in 257 ms of which 3 ms to minimize.
[2024-05-28 02:41:22] [INFO ] Deduced a trap composed of 258 places in 230 ms of which 3 ms to minimize.
[2024-05-28 02:41:22] [INFO ] Deduced a trap composed of 286 places in 244 ms of which 3 ms to minimize.
[2024-05-28 02:41:23] [INFO ] Deduced a trap composed of 299 places in 290 ms of which 3 ms to minimize.
[2024-05-28 02:41:23] [INFO ] Deduced a trap composed of 253 places in 257 ms of which 4 ms to minimize.
[2024-05-28 02:41:23] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 2 ms to minimize.
[2024-05-28 02:41:24] [INFO ] Deduced a trap composed of 82 places in 159 ms of which 2 ms to minimize.
[2024-05-28 02:41:24] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 2 ms to minimize.
[2024-05-28 02:41:26] [INFO ] Deduced a trap composed of 289 places in 237 ms of which 3 ms to minimize.
[2024-05-28 02:41:27] [INFO ] Deduced a trap composed of 348 places in 210 ms of which 3 ms to minimize.
[2024-05-28 02:41:27] [INFO ] Deduced a trap composed of 291 places in 219 ms of which 4 ms to minimize.
[2024-05-28 02:41:27] [INFO ] Deduced a trap composed of 42 places in 288 ms of which 3 ms to minimize.
[2024-05-28 02:41:29] [INFO ] Deduced a trap composed of 321 places in 229 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 43 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:41:38] [INFO ] Deduced a trap composed of 344 places in 305 ms of which 4 ms to minimize.
[2024-05-28 02:41:46] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 3 ms to minimize.
[2024-05-28 02:41:46] [INFO ] Deduced a trap composed of 3 places in 259 ms of which 3 ms to minimize.
[2024-05-28 02:41:47] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 3 ms to minimize.
[2024-05-28 02:41:47] [INFO ] Deduced a trap composed of 74 places in 257 ms of which 3 ms to minimize.
[2024-05-28 02:41:47] [INFO ] Deduced a trap composed of 28 places in 264 ms of which 3 ms to minimize.
[2024-05-28 02:41:47] [INFO ] Deduced a trap composed of 28 places in 254 ms of which 3 ms to minimize.
[2024-05-28 02:41:48] [INFO ] Deduced a trap composed of 303 places in 261 ms of which 3 ms to minimize.
[2024-05-28 02:41:48] [INFO ] Deduced a trap composed of 75 places in 259 ms of which 3 ms to minimize.
[2024-05-28 02:41:48] [INFO ] Deduced a trap composed of 74 places in 255 ms of which 2 ms to minimize.
[2024-05-28 02:41:48] [INFO ] Deduced a trap composed of 75 places in 39 ms of which 0 ms to minimize.
[2024-05-28 02:41:49] [INFO ] Deduced a trap composed of 317 places in 261 ms of which 3 ms to minimize.
[2024-05-28 02:41:49] [INFO ] Deduced a trap composed of 74 places in 42 ms of which 0 ms to minimize.
[2024-05-28 02:41:50] [INFO ] Deduced a trap composed of 342 places in 265 ms of which 3 ms to minimize.
SMT process timed out in 44805ms, After SMT, problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 44821ms
[2024-05-28 02:41:50] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 02:41:50] [INFO ] Invariant cache hit.
[2024-05-28 02:41:50] [INFO ] Implicit Places using invariants in 468 ms returned []
[2024-05-28 02:41:50] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 02:41:50] [INFO ] Invariant cache hit.
[2024-05-28 02:41:51] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:42:01] [INFO ] Implicit Places using invariants and state equation in 11052 ms returned []
Implicit Place search using SMT with State Equation took 11521 ms to find 0 implicit places.
Running 1356 sub problems to find dead transitions.
[2024-05-28 02:42:01] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 02:42:01] [INFO ] Invariant cache hit.
[2024-05-28 02:42:01] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:42:17] [INFO ] Deduced a trap composed of 142 places in 245 ms of which 3 ms to minimize.
[2024-05-28 02:42:18] [INFO ] Deduced a trap composed of 304 places in 257 ms of which 2 ms to minimize.
[2024-05-28 02:42:18] [INFO ] Deduced a trap composed of 323 places in 195 ms of which 3 ms to minimize.
[2024-05-28 02:42:18] [INFO ] Deduced a trap composed of 262 places in 193 ms of which 3 ms to minimize.
[2024-05-28 02:42:19] [INFO ] Deduced a trap composed of 280 places in 189 ms of which 3 ms to minimize.
[2024-05-28 02:42:19] [INFO ] Deduced a trap composed of 286 places in 243 ms of which 3 ms to minimize.
[2024-05-28 02:42:19] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 2 ms to minimize.
[2024-05-28 02:42:20] [INFO ] Deduced a trap composed of 283 places in 273 ms of which 3 ms to minimize.
[2024-05-28 02:42:20] [INFO ] Deduced a trap composed of 267 places in 235 ms of which 3 ms to minimize.
[2024-05-28 02:42:20] [INFO ] Deduced a trap composed of 70 places in 181 ms of which 1 ms to minimize.
[2024-05-28 02:42:21] [INFO ] Deduced a trap composed of 86 places in 157 ms of which 2 ms to minimize.
[2024-05-28 02:42:21] [INFO ] Deduced a trap composed of 82 places in 141 ms of which 1 ms to minimize.
[2024-05-28 02:42:21] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 1 ms to minimize.
[2024-05-28 02:42:21] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2024-05-28 02:42:23] [INFO ] Deduced a trap composed of 291 places in 235 ms of which 3 ms to minimize.
[2024-05-28 02:42:24] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 43 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:42:47] [INFO ] Deduced a trap composed of 3 places in 277 ms of which 3 ms to minimize.
[2024-05-28 02:42:47] [INFO ] Deduced a trap composed of 5 places in 312 ms of which 4 ms to minimize.
[2024-05-28 02:42:47] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 3 ms to minimize.
[2024-05-28 02:42:48] [INFO ] Deduced a trap composed of 74 places in 306 ms of which 4 ms to minimize.
[2024-05-28 02:42:48] [INFO ] Deduced a trap composed of 28 places in 264 ms of which 4 ms to minimize.
[2024-05-28 02:42:48] [INFO ] Deduced a trap composed of 74 places in 257 ms of which 3 ms to minimize.
[2024-05-28 02:42:49] [INFO ] Deduced a trap composed of 301 places in 272 ms of which 3 ms to minimize.
[2024-05-28 02:42:49] [INFO ] Deduced a trap composed of 28 places in 262 ms of which 3 ms to minimize.
[2024-05-28 02:42:49] [INFO ] Deduced a trap composed of 74 places in 316 ms of which 3 ms to minimize.
[2024-05-28 02:42:49] [INFO ] Deduced a trap composed of 74 places in 257 ms of which 3 ms to minimize.
[2024-05-28 02:42:50] [INFO ] Deduced a trap composed of 341 places in 261 ms of which 3 ms to minimize.
[2024-05-28 02:42:50] [INFO ] Deduced a trap composed of 350 places in 251 ms of which 3 ms to minimize.
[2024-05-28 02:42:50] [INFO ] Deduced a trap composed of 338 places in 249 ms of which 3 ms to minimize.
[2024-05-28 02:42:51] [INFO ] Deduced a trap composed of 325 places in 248 ms of which 3 ms to minimize.
[2024-05-28 02:42:51] [INFO ] Deduced a trap composed of 292 places in 249 ms of which 3 ms to minimize.
[2024-05-28 02:42:51] [INFO ] Deduced a trap composed of 75 places in 40 ms of which 1 ms to minimize.
[2024-05-28 02:42:53] [INFO ] Deduced a trap composed of 357 places in 326 ms of which 4 ms to minimize.
[2024-05-28 02:42:54] [INFO ] Deduced a trap composed of 98 places in 319 ms of which 4 ms to minimize.
[2024-05-28 02:42:54] [INFO ] Deduced a trap composed of 352 places in 354 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 62 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/25 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 35/35 constraints]
After SMT, in 64643ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 64658ms
Starting structural reductions in LTL mode, iteration 1 : 532/537 places, 1360/1365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121055 ms. Remains : 532/537 places, 1360/1365 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLCardinality-11 finished in 121241 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 4 out of 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 1365/1365 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 537 transition count 1326
Reduce places removed 39 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 46 rules applied. Total rules applied 85 place count 498 transition count 1319
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 92 place count 491 transition count 1319
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 92 place count 491 transition count 1259
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 212 place count 431 transition count 1259
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 332 place count 371 transition count 1199
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 334 place count 369 transition count 1197
Iterating global reduction 3 with 2 rules applied. Total rules applied 336 place count 369 transition count 1197
Applied a total of 336 rules in 122 ms. Remains 369 /537 variables (removed 168) and now considering 1197/1365 (removed 168) transitions.
Running 1193 sub problems to find dead transitions.
[2024-05-28 02:43:06] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
// Phase 1: matrix 1173 rows 369 cols
[2024-05-28 02:43:06] [INFO ] Computed 40 invariants in 17 ms
[2024-05-28 02:43:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 02:43:17] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-28 02:43:17] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-28 02:43:17] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-05-28 02:43:17] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-05-28 02:43:17] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 0 ms to minimize.
[2024-05-28 02:43:17] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 1 ms to minimize.
[2024-05-28 02:43:18] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 2 ms to minimize.
[2024-05-28 02:43:18] [INFO ] Deduced a trap composed of 122 places in 235 ms of which 3 ms to minimize.
[2024-05-28 02:43:18] [INFO ] Deduced a trap composed of 34 places in 257 ms of which 3 ms to minimize.
[2024-05-28 02:43:19] [INFO ] Deduced a trap composed of 58 places in 198 ms of which 2 ms to minimize.
[2024-05-28 02:43:19] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 2 ms to minimize.
[2024-05-28 02:43:20] [INFO ] Deduced a trap composed of 121 places in 194 ms of which 2 ms to minimize.
[2024-05-28 02:43:23] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 2 ms to minimize.
[2024-05-28 02:43:29] [INFO ] Deduced a trap composed of 163 places in 205 ms of which 2 ms to minimize.
[2024-05-28 02:43:29] [INFO ] Deduced a trap composed of 203 places in 199 ms of which 2 ms to minimize.
[2024-05-28 02:43:29] [INFO ] Deduced a trap composed of 199 places in 201 ms of which 3 ms to minimize.
[2024-05-28 02:43:30] [INFO ] Deduced a trap composed of 170 places in 210 ms of which 2 ms to minimize.
[2024-05-28 02:43:30] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 2 ms to minimize.
[2024-05-28 02:43:30] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 2 ms to minimize.
[2024-05-28 02:43:30] [INFO ] Deduced a trap composed of 183 places in 216 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1542 variables, and 56 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1193/1193 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 02:43:51] [INFO ] Deduced a trap composed of 102 places in 235 ms of which 2 ms to minimize.
SMT process timed out in 44764ms, After SMT, problems are : Problem set: 0 solved, 1193 unsolved
Search for dead transitions found 0 dead transitions in 44777ms
[2024-05-28 02:43:51] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
[2024-05-28 02:43:51] [INFO ] Invariant cache hit.
[2024-05-28 02:43:51] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-05-28 02:43:51] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
[2024-05-28 02:43:51] [INFO ] Invariant cache hit.
[2024-05-28 02:43:52] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:43:57] [INFO ] Implicit Places using invariants and state equation in 5776 ms returned []
Implicit Place search using SMT with State Equation took 6191 ms to find 0 implicit places.
[2024-05-28 02:43:57] [INFO ] Redundant transitions in 88 ms returned []
Running 1193 sub problems to find dead transitions.
[2024-05-28 02:43:57] [INFO ] Flow matrix only has 1173 transitions (discarded 24 similar events)
[2024-05-28 02:43:57] [INFO ] Invariant cache hit.
[2024-05-28 02:43:57] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
[2024-05-28 02:44:09] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2024-05-28 02:44:09] [INFO ] Deduced a trap composed of 47 places in 32 ms of which 1 ms to minimize.
[2024-05-28 02:44:09] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-28 02:44:09] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-05-28 02:44:09] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 0 ms to minimize.
[2024-05-28 02:44:09] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-28 02:44:09] [INFO ] Deduced a trap composed of 26 places in 215 ms of which 3 ms to minimize.
[2024-05-28 02:44:09] [INFO ] Deduced a trap composed of 58 places in 205 ms of which 2 ms to minimize.
[2024-05-28 02:44:10] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 2 ms to minimize.
[2024-05-28 02:44:10] [INFO ] Deduced a trap composed of 121 places in 251 ms of which 2 ms to minimize.
[2024-05-28 02:44:11] [INFO ] Deduced a trap composed of 120 places in 201 ms of which 2 ms to minimize.
[2024-05-28 02:44:13] [INFO ] Deduced a trap composed of 179 places in 217 ms of which 3 ms to minimize.
[2024-05-28 02:44:16] [INFO ] Deduced a trap composed of 173 places in 264 ms of which 2 ms to minimize.
[2024-05-28 02:44:17] [INFO ] Deduced a trap composed of 156 places in 240 ms of which 3 ms to minimize.
[2024-05-28 02:44:20] [INFO ] Deduced a trap composed of 178 places in 228 ms of which 3 ms to minimize.
[2024-05-28 02:44:20] [INFO ] Deduced a trap composed of 129 places in 218 ms of which 2 ms to minimize.
[2024-05-28 02:44:21] [INFO ] Deduced a trap composed of 194 places in 237 ms of which 2 ms to minimize.
[2024-05-28 02:44:21] [INFO ] Deduced a trap composed of 212 places in 197 ms of which 2 ms to minimize.
[2024-05-28 02:44:21] [INFO ] Deduced a trap composed of 196 places in 192 ms of which 2 ms to minimize.
[2024-05-28 02:44:22] [INFO ] Deduced a trap composed of 163 places in 233 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1542 variables, and 56 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1193/1193 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1193 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD803 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/366 variables, 1/57 constraints. Problems are: Problem set: 90 solved, 1103 unsolved
[2024-05-28 02:45:02] [INFO ] Deduced a trap composed of 199 places in 255 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1542 variables, and 58 constraints, problems are : Problem set: 90 solved, 1103 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/369 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1193 constraints, Known Traps: 21/21 constraints]
After SMT, in 64691ms problems are : Problem set: 90 solved, 1103 unsolved
Search for dead transitions found 90 dead transitions in 64705ms
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 SI_LTL mode, iteration 1 : 369/537 places, 1107/1365 transitions.
Applied a total of 0 rules in 26 ms. Remains 369 /369 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2024-05-28 02:45:02] [INFO ] Redundant transitions in 30 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 115957 ms. Remains : 369/537 places, 1107/1365 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLCardinality-12
Stuttering criterion allowed to conclude after 3314 steps with 1 reset in 18 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLCardinality-12 finished in 116058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F(p1)))))'
Support contains 8 out of 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 1365/1365 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 537 transition count 1321
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 493 transition count 1321
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 61 Pre rules applied. Total rules applied 88 place count 493 transition count 1260
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 210 place count 432 transition count 1260
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 324 place count 375 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 325 place count 374 transition count 1202
Iterating global reduction 2 with 1 rules applied. Total rules applied 326 place count 374 transition count 1202
Applied a total of 326 rules in 104 ms. Remains 374 /537 variables (removed 163) and now considering 1202/1365 (removed 163) transitions.
Running 1198 sub problems to find dead transitions.
[2024-05-28 02:45:02] [INFO ] Flow matrix only has 1178 transitions (discarded 24 similar events)
// Phase 1: matrix 1178 rows 374 cols
[2024-05-28 02:45:02] [INFO ] Computed 40 invariants in 14 ms
[2024-05-28 02:45:02] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 02:45:14] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 02:45:23] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/1552 variables, and 33 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 02:45:28] [INFO ] Deduced a trap composed of 46 places in 219 ms of which 2 ms to minimize.
[2024-05-28 02:45:28] [INFO ] Deduced a trap composed of 50 places in 199 ms of which 2 ms to minimize.
[2024-05-28 02:45:29] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 2 ms to minimize.
[2024-05-28 02:45:29] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 0 ms to minimize.
[2024-05-28 02:45:29] [INFO ] Deduced a trap composed of 48 places in 35 ms of which 1 ms to minimize.
[2024-05-28 02:45:29] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-05-28 02:45:32] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 02:45:40] [INFO ] Deduced a trap composed of 63 places in 260 ms of which 3 ms to minimize.
[2024-05-28 02:45:40] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 2 ms to minimize.
[2024-05-28 02:45:40] [INFO ] Deduced a trap composed of 59 places in 191 ms of which 3 ms to minimize.
[2024-05-28 02:45:43] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 2 ms to minimize.
[2024-05-28 02:45:46] [INFO ] Deduced a trap composed of 54 places in 136 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/1552 variables, and 45 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1198 constraints, Known Traps: 14/14 constraints]
After SMT, in 44510ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 44521ms
[2024-05-28 02:45:47] [INFO ] Flow matrix only has 1178 transitions (discarded 24 similar events)
[2024-05-28 02:45:47] [INFO ] Invariant cache hit.
[2024-05-28 02:45:47] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-05-28 02:45:47] [INFO ] Flow matrix only has 1178 transitions (discarded 24 similar events)
[2024-05-28 02:45:47] [INFO ] Invariant cache hit.
[2024-05-28 02:45:47] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:45:53] [INFO ] Implicit Places using invariants and state equation in 6323 ms returned []
Implicit Place search using SMT with State Equation took 6702 ms to find 0 implicit places.
[2024-05-28 02:45:53] [INFO ] Redundant transitions in 22 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-28 02:45:53] [INFO ] Flow matrix only has 1178 transitions (discarded 24 similar events)
[2024-05-28 02:45:53] [INFO ] Invariant cache hit.
[2024-05-28 02:45:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 02:46:04] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-28 02:46:10] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Problem TDEAD37 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD832 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/371 variables, 1/34 constraints. Problems are: Problem set: 90 solved, 1108 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 371/1552 variables, and 34 constraints, problems are : Problem set: 90 solved, 1108 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 90 solved, 1108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 90 solved, 1108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 17/31 constraints. Problems are: Problem set: 90 solved, 1108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 2/33 constraints. Problems are: Problem set: 90 solved, 1108 unsolved
[2024-05-28 02:46:29] [INFO ] Deduced a trap composed of 47 places in 218 ms of which 2 ms to minimize.
[2024-05-28 02:46:29] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 2 ms to minimize.
[2024-05-28 02:46:29] [INFO ] Deduced a trap composed of 50 places in 30 ms of which 1 ms to minimize.
[2024-05-28 02:46:29] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 0 ms to minimize.
[2024-05-28 02:46:31] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 2 ms to minimize.
[2024-05-28 02:46:31] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 6/39 constraints. Problems are: Problem set: 90 solved, 1108 unsolved
[2024-05-28 02:46:40] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2024-05-28 02:46:41] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 2/41 constraints. Problems are: Problem set: 90 solved, 1108 unsolved
[2024-05-28 02:46:48] [INFO ] Deduced a trap composed of 54 places in 172 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 1/42 constraints. Problems are: Problem set: 90 solved, 1108 unsolved
[2024-05-28 02:46:54] [INFO ] Deduced a trap composed of 59 places in 188 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/1552 variables, and 43 constraints, problems are : Problem set: 90 solved, 1108 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1198 constraints, Known Traps: 12/12 constraints]
After SMT, in 64320ms problems are : Problem set: 90 solved, 1108 unsolved
Search for dead transitions found 90 dead transitions in 64331ms
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 SI_LTL mode, iteration 1 : 374/537 places, 1112/1365 transitions.
Applied a total of 0 rules in 32 ms. Remains 374 /374 variables (removed 0) and now considering 1112/1112 (removed 0) transitions.
[2024-05-28 02:46:58] [INFO ] Redundant transitions in 18 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 115760 ms. Remains : 374/537 places, 1112/1365 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLCardinality-13
Product exploration explored 100000 steps with 7004 reset in 616 ms.
Product exploration explored 100000 steps with 7001 reset in 496 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 p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 177 steps (0 resets) in 10 ms. (16 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-28 02:46:59] [INFO ] Flow matrix only has 1088 transitions (discarded 24 similar events)
// Phase 1: matrix 1088 rows 374 cols
[2024-05-28 02:46:59] [INFO ] Computed 40 invariants in 14 ms
[2024-05-28 02:47:00] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-05-28 02:47:00] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 36 ms returned sat
[2024-05-28 02:47:01] [INFO ] [Real]Absence check using state equation in 1305 ms returned sat
[2024-05-28 02:47:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:47:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 02:47:02] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 58 ms returned sat
[2024-05-28 02:47:03] [INFO ] [Nat]Absence check using state equation in 1511 ms returned sat
[2024-05-28 02:47:03] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:47:04] [INFO ] [Nat]Added 120 Read/Feed constraints in 855 ms returned sat
[2024-05-28 02:47:04] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2024-05-28 02:47:05] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-28 02:47:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 734 ms
[2024-05-28 02:47:05] [INFO ] Computed and/alt/rep : 694/3061/676 causal constraints (skipped 408 transitions) in 89 ms.
[2024-05-28 02:47:08] [INFO ] Added : 158 causal constraints over 32 iterations in 3404 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 8 out of 374 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 374/374 places, 1112/1112 transitions.
Applied a total of 0 rules in 35 ms. Remains 374 /374 variables (removed 0) and now considering 1112/1112 (removed 0) transitions.
Running 1108 sub problems to find dead transitions.
[2024-05-28 02:47:08] [INFO ] Flow matrix only has 1088 transitions (discarded 24 similar events)
[2024-05-28 02:47:08] [INFO ] Invariant cache hit.
[2024-05-28 02:47:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
[2024-05-28 02:47:17] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
[2024-05-28 02:47:25] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-28 02:47:30] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/1462 variables, and 34 constraints, problems are : Problem set: 0 solved, 1108 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1108/1108 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
[2024-05-28 02:47:33] [INFO ] Deduced a trap composed of 50 places in 175 ms of which 2 ms to minimize.
[2024-05-28 02:47:33] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 1 ms to minimize.
[2024-05-28 02:47:33] [INFO ] Deduced a trap composed of 48 places in 30 ms of which 1 ms to minimize.
[2024-05-28 02:47:33] [INFO ] Deduced a trap composed of 48 places in 28 ms of which 0 ms to minimize.
[2024-05-28 02:47:35] [INFO ] Deduced a trap composed of 47 places in 30 ms of which 1 ms to minimize.
[2024-05-28 02:47:35] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-28 02:47:38] [INFO ] Deduced a trap composed of 47 places in 203 ms of which 2 ms to minimize.
[2024-05-28 02:47:38] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 5 (OVERLAPS) 1/371 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/1462 variables, and 43 constraints, problems are : Problem set: 0 solved, 1108 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1108 constraints, Known Traps: 11/11 constraints]
After SMT, in 43050ms problems are : Problem set: 0 solved, 1108 unsolved
Search for dead transitions found 0 dead transitions in 43067ms
[2024-05-28 02:47:51] [INFO ] Flow matrix only has 1088 transitions (discarded 24 similar events)
[2024-05-28 02:47:51] [INFO ] Invariant cache hit.
[2024-05-28 02:47:52] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-28 02:47:52] [INFO ] Flow matrix only has 1088 transitions (discarded 24 similar events)
[2024-05-28 02:47:52] [INFO ] Invariant cache hit.
[2024-05-28 02:47:52] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:47:59] [INFO ] Implicit Places using invariants and state equation in 7256 ms returned []
Implicit Place search using SMT with State Equation took 7657 ms to find 0 implicit places.
[2024-05-28 02:47:59] [INFO ] Redundant transitions in 18 ms returned []
Running 1108 sub problems to find dead transitions.
[2024-05-28 02:47:59] [INFO ] Flow matrix only has 1088 transitions (discarded 24 similar events)
[2024-05-28 02:47:59] [INFO ] Invariant cache hit.
[2024-05-28 02:47:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
[2024-05-28 02:48:07] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
[2024-05-28 02:48:16] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-28 02:48:22] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 10.0)
(s4 2.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 4.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 3.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 2.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 4.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s56 1.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 2.0)
(s79 1.0)
(s80 1.0)
(s81 9.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 3.0)
(s94 4.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 2.0)
(s110 0.0)
(s111 1.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 4.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 4.0)
(s136 0.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 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 2.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 1.0)
(s170 0.0)
(s171 2.0)
(s172 0.0)
(s173 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 2.0)
(s179 1.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 2.0)
(s199 0.0)
(s200 1.0)
(s201 1.0)
(s202 0.0)
(s203 1.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 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s226 1.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 0.0)
(s239 4.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 2.0)
(s252 10.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 2.0)
(s277 0.0)
(s278 2.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 1.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 2.0)
(s290 0.0)
(s292 1.0)
(s293 1.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 3.0)
(s298 4.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 1.0)
(s316 timeout
0.0)
(s317 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/1462 variables, and 34 constraints, problems are : Problem set: 0 solved, 1108 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1108/1108 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
[2024-05-28 02:48:33] [INFO ] Deduced a trap composed of 50 places in 174 ms of which 2 ms to minimize.
[2024-05-28 02:48:34] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 2 ms to minimize.
[2024-05-28 02:48:34] [INFO ] Deduced a trap composed of 48 places in 31 ms of which 1 ms to minimize.
[2024-05-28 02:48:34] [INFO ] Deduced a trap composed of 48 places in 30 ms of which 1 ms to minimize.
[2024-05-28 02:48:36] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-28 02:48:36] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-05-28 02:48:38] [INFO ] Deduced a trap composed of 47 places in 153 ms of which 2 ms to minimize.
[2024-05-28 02:48:39] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 5 (OVERLAPS) 1/371 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD740 is UNSAT
At refinement iteration 7 (OVERLAPS) 3/374 variables, 8/51 constraints. Problems are: Problem set: 234 solved, 874 unsolved
[2024-05-28 02:49:00] [INFO ] Deduced a trap composed of 79 places in 172 ms of which 2 ms to minimize.
[2024-05-28 02:49:01] [INFO ] Deduced a trap composed of 168 places in 193 ms of which 2 ms to minimize.
[2024-05-28 02:49:01] [INFO ] Deduced a trap composed of 171 places in 198 ms of which 5 ms to minimize.
[2024-05-28 02:49:01] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 2 ms to minimize.
[2024-05-28 02:49:02] [INFO ] Deduced a trap composed of 135 places in 219 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/1462 variables, and 56 constraints, problems are : Problem set: 234 solved, 874 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/374 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1108 constraints, Known Traps: 16/16 constraints]
After SMT, in 63001ms problems are : Problem set: 234 solved, 874 unsolved
Search for dead transitions found 234 dead transitions in 63012ms
Found 234 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 234 transitions
Dead transitions reduction (with SMT) removed 234 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 374/374 places, 878/1112 transitions.
Applied a total of 0 rules in 12 ms. Remains 374 /374 variables (removed 0) and now considering 878/878 (removed 0) transitions.
[2024-05-28 02:49:02] [INFO ] Redundant transitions in 10 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 113845 ms. Remains : 374/374 places, 878/1112 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 p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 169 steps (0 resets) in 5 ms. (28 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-28 02:49:02] [INFO ] Flow matrix only has 854 transitions (discarded 24 similar events)
// Phase 1: matrix 854 rows 374 cols
[2024-05-28 02:49:02] [INFO ] Computed 40 invariants in 10 ms
[2024-05-28 02:49:03] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-28 02:49:03] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 32 ms returned sat
[2024-05-28 02:49:04] [INFO ] [Real]Absence check using state equation in 883 ms returned sat
[2024-05-28 02:49:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:49:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-28 02:49:04] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 55 ms returned sat
[2024-05-28 02:49:05] [INFO ] [Nat]Absence check using state equation in 1405 ms returned sat
[2024-05-28 02:49:05] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:49:07] [INFO ] [Nat]Added 120 Read/Feed constraints in 1369 ms returned sat
[2024-05-28 02:49:07] [INFO ] Deduced a trap composed of 186 places in 241 ms of which 3 ms to minimize.
[2024-05-28 02:49:08] [INFO ] Deduced a trap composed of 170 places in 190 ms of which 3 ms to minimize.
[2024-05-28 02:49:08] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 3 ms to minimize.
[2024-05-28 02:49:09] [INFO ] Deduced a trap composed of 173 places in 212 ms of which 2 ms to minimize.
[2024-05-28 02:49:09] [INFO ] Deduced a trap composed of 190 places in 206 ms of which 2 ms to minimize.
[2024-05-28 02:49:10] [INFO ] Deduced a trap composed of 170 places in 163 ms of which 2 ms to minimize.
[2024-05-28 02:49:10] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 2 ms to minimize.
[2024-05-28 02:49:10] [INFO ] Deduced a trap composed of 187 places in 224 ms of which 2 ms to minimize.
[2024-05-28 02:49:11] [INFO ] Deduced a trap composed of 168 places in 168 ms of which 3 ms to minimize.
[2024-05-28 02:49:11] [INFO ] Deduced a trap composed of 183 places in 188 ms of which 2 ms to minimize.
[2024-05-28 02:49:12] [INFO ] Deduced a trap composed of 50 places in 181 ms of which 2 ms to minimize.
[2024-05-28 02:49:12] [INFO ] Deduced a trap composed of 148 places in 226 ms of which 2 ms to minimize.
[2024-05-28 02:49:12] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5216 ms
[2024-05-28 02:49:12] [INFO ] Computed and/alt/rep : 586/3361/568 causal constraints (skipped 282 transitions) in 66 ms.
[2024-05-28 02:49:17] [INFO ] Added : 282 causal constraints over 57 iterations in 4499 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 6843 reset in 423 ms.
Product exploration explored 100000 steps with 6873 reset in 490 ms.
Support contains 8 out of 374 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 374/374 places, 878/878 transitions.
Applied a total of 0 rules in 15 ms. Remains 374 /374 variables (removed 0) and now considering 878/878 (removed 0) transitions.
Running 874 sub problems to find dead transitions.
[2024-05-28 02:49:18] [INFO ] Flow matrix only has 854 transitions (discarded 24 similar events)
[2024-05-28 02:49:18] [INFO ] Invariant cache hit.
[2024-05-28 02:49:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 874 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 874 unsolved
[2024-05-28 02:49:23] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-05-28 02:49:23] [INFO ] Deduced a trap composed of 46 places in 27 ms of which 0 ms to minimize.
[2024-05-28 02:49:23] [INFO ] Deduced a trap composed of 48 places in 28 ms of which 1 ms to minimize.
[2024-05-28 02:49:23] [INFO ] Deduced a trap composed of 47 places in 27 ms of which 1 ms to minimize.
[2024-05-28 02:49:23] [INFO ] Deduced a trap composed of 50 places in 31 ms of which 1 ms to minimize.
[2024-05-28 02:49:24] [INFO ] Deduced a trap composed of 48 places in 30 ms of which 1 ms to minimize.
[2024-05-28 02:49:24] [INFO ] Deduced a trap composed of 179 places in 155 ms of which 2 ms to minimize.
[2024-05-28 02:49:24] [INFO ] Deduced a trap composed of 187 places in 154 ms of which 2 ms to minimize.
[2024-05-28 02:49:24] [INFO ] Deduced a trap composed of 160 places in 153 ms of which 3 ms to minimize.
[2024-05-28 02:49:24] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
[2024-05-28 02:49:24] [INFO ] Deduced a trap composed of 142 places in 154 ms of which 4 ms to minimize.
[2024-05-28 02:49:25] [INFO ] Deduced a trap composed of 175 places in 152 ms of which 2 ms to minimize.
[2024-05-28 02:49:25] [INFO ] Deduced a trap composed of 156 places in 149 ms of which 2 ms to minimize.
[2024-05-28 02:49:25] [INFO ] Deduced a trap composed of 143 places in 147 ms of which 2 ms to minimize.
[2024-05-28 02:49:25] [INFO ] Deduced a trap composed of 63 places in 153 ms of which 2 ms to minimize.
[2024-05-28 02:49:26] [INFO ] Deduced a trap composed of 116 places in 185 ms of which 2 ms to minimize.
[2024-05-28 02:49:26] [INFO ] Deduced a trap composed of 190 places in 187 ms of which 2 ms to minimize.
[2024-05-28 02:49:26] [INFO ] Deduced a trap composed of 156 places in 159 ms of which 3 ms to minimize.
[2024-05-28 02:49:26] [INFO ] Deduced a trap composed of 153 places in 150 ms of which 2 ms to minimize.
[2024-05-28 02:49:26] [INFO ] Deduced a trap composed of 195 places in 152 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 874 unsolved
[2024-05-28 02:49:27] [INFO ] Deduced a trap composed of 184 places in 201 ms of which 2 ms to minimize.
[2024-05-28 02:49:27] [INFO ] Deduced a trap composed of 155 places in 156 ms of which 2 ms to minimize.
[2024-05-28 02:49:28] [INFO ] Deduced a trap composed of 196 places in 157 ms of which 2 ms to minimize.
[2024-05-28 02:49:28] [INFO ] Deduced a trap composed of 206 places in 156 ms of which 2 ms to minimize.
[2024-05-28 02:49:28] [INFO ] Deduced a trap composed of 183 places in 156 ms of which 2 ms to minimize.
[2024-05-28 02:49:28] [INFO ] Deduced a trap composed of 177 places in 152 ms of which 2 ms to minimize.
[2024-05-28 02:49:28] [INFO ] Deduced a trap composed of 201 places in 161 ms of which 2 ms to minimize.
[2024-05-28 02:49:28] [INFO ] Deduced a trap composed of 156 places in 150 ms of which 2 ms to minimize.
[2024-05-28 02:49:29] [INFO ] Deduced a trap composed of 190 places in 149 ms of which 2 ms to minimize.
[2024-05-28 02:49:29] [INFO ] Deduced a trap composed of 204 places in 149 ms of which 2 ms to minimize.
[2024-05-28 02:49:29] [INFO ] Deduced a trap composed of 168 places in 148 ms of which 2 ms to minimize.
[2024-05-28 02:49:29] [INFO ] Deduced a trap composed of 151 places in 148 ms of which 2 ms to minimize.
[2024-05-28 02:49:29] [INFO ] Deduced a trap composed of 177 places in 145 ms of which 2 ms to minimize.
[2024-05-28 02:49:29] [INFO ] Deduced a trap composed of 195 places in 144 ms of which 2 ms to minimize.
[2024-05-28 02:49:30] [INFO ] Deduced a trap composed of 188 places in 153 ms of which 2 ms to minimize.
[2024-05-28 02:49:30] [INFO ] Deduced a trap composed of 168 places in 144 ms of which 3 ms to minimize.
[2024-05-28 02:49:30] [INFO ] Deduced a trap composed of 128 places in 188 ms of which 2 ms to minimize.
[2024-05-28 02:49:30] [INFO ] Deduced a trap composed of 142 places in 144 ms of which 2 ms to minimize.
[2024-05-28 02:49:30] [INFO ] Deduced a trap composed of 216 places in 138 ms of which 2 ms to minimize.
[2024-05-28 02:49:32] [INFO ] Deduced a trap composed of 159 places in 205 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 874 unsolved
[2024-05-28 02:49:39] [INFO ] Deduced a trap composed of 195 places in 164 ms of which 3 ms to minimize.
SMT process timed out in 21309ms, After SMT, problems are : Problem set: 0 solved, 874 unsolved
Search for dead transitions found 0 dead transitions in 21318ms
[2024-05-28 02:49:39] [INFO ] Flow matrix only has 854 transitions (discarded 24 similar events)
[2024-05-28 02:49:39] [INFO ] Invariant cache hit.
[2024-05-28 02:49:39] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-28 02:49:39] [INFO ] Flow matrix only has 854 transitions (discarded 24 similar events)
[2024-05-28 02:49:39] [INFO ] Invariant cache hit.
[2024-05-28 02:49:40] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:49:47] [INFO ] Implicit Places using invariants and state equation in 7680 ms returned []
Implicit Place search using SMT with State Equation took 8013 ms to find 0 implicit places.
[2024-05-28 02:49:47] [INFO ] Redundant transitions in 28 ms returned []
Running 874 sub problems to find dead transitions.
[2024-05-28 02:49:47] [INFO ] Flow matrix only has 854 transitions (discarded 24 similar events)
[2024-05-28 02:49:47] [INFO ] Invariant cache hit.
[2024-05-28 02:49:47] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 874 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 874 unsolved
[2024-05-28 02:49:53] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-05-28 02:49:53] [INFO ] Deduced a trap composed of 46 places in 29 ms of which 1 ms to minimize.
[2024-05-28 02:49:53] [INFO ] Deduced a trap composed of 48 places in 30 ms of which 0 ms to minimize.
[2024-05-28 02:49:53] [INFO ] Deduced a trap composed of 47 places in 28 ms of which 0 ms to minimize.
[2024-05-28 02:49:53] [INFO ] Deduced a trap composed of 50 places in 30 ms of which 1 ms to minimize.
[2024-05-28 02:49:53] [INFO ] Deduced a trap composed of 48 places in 35 ms of which 1 ms to minimize.
[2024-05-28 02:49:53] [INFO ] Deduced a trap composed of 179 places in 181 ms of which 3 ms to minimize.
[2024-05-28 02:49:53] [INFO ] Deduced a trap composed of 187 places in 154 ms of which 2 ms to minimize.
[2024-05-28 02:49:54] [INFO ] Deduced a trap composed of 160 places in 153 ms of which 2 ms to minimize.
[2024-05-28 02:49:54] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 2 ms to minimize.
[2024-05-28 02:49:54] [INFO ] Deduced a trap composed of 142 places in 146 ms of which 2 ms to minimize.
[2024-05-28 02:49:54] [INFO ] Deduced a trap composed of 175 places in 146 ms of which 2 ms to minimize.
[2024-05-28 02:49:55] [INFO ] Deduced a trap composed of 156 places in 188 ms of which 2 ms to minimize.
[2024-05-28 02:49:55] [INFO ] Deduced a trap composed of 143 places in 206 ms of which 3 ms to minimize.
[2024-05-28 02:49:55] [INFO ] Deduced a trap composed of 63 places in 146 ms of which 2 ms to minimize.
[2024-05-28 02:49:55] [INFO ] Deduced a trap composed of 116 places in 175 ms of which 2 ms to minimize.
[2024-05-28 02:49:56] [INFO ] Deduced a trap composed of 190 places in 143 ms of which 2 ms to minimize.
[2024-05-28 02:49:56] [INFO ] Deduced a trap composed of 156 places in 146 ms of which 2 ms to minimize.
[2024-05-28 02:49:56] [INFO ] Deduced a trap composed of 153 places in 143 ms of which 3 ms to minimize.
[2024-05-28 02:49:56] [INFO ] Deduced a trap composed of 195 places in 147 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 874 unsolved
[2024-05-28 02:49:57] [INFO ] Deduced a trap composed of 184 places in 148 ms of which 2 ms to minimize.
[2024-05-28 02:49:57] [INFO ] Deduced a trap composed of 155 places in 155 ms of which 2 ms to minimize.
[2024-05-28 02:49:57] [INFO ] Deduced a trap composed of 196 places in 168 ms of which 2 ms to minimize.
[2024-05-28 02:49:57] [INFO ] Deduced a trap composed of 206 places in 169 ms of which 2 ms to minimize.
[2024-05-28 02:49:58] [INFO ] Deduced a trap composed of 183 places in 152 ms of which 2 ms to minimize.
[2024-05-28 02:49:58] [INFO ] Deduced a trap composed of 177 places in 148 ms of which 2 ms to minimize.
[2024-05-28 02:49:58] [INFO ] Deduced a trap composed of 201 places in 145 ms of which 2 ms to minimize.
[2024-05-28 02:49:58] [INFO ] Deduced a trap composed of 156 places in 146 ms of which 2 ms to minimize.
[2024-05-28 02:49:58] [INFO ] Deduced a trap composed of 190 places in 146 ms of which 2 ms to minimize.
[2024-05-28 02:49:58] [INFO ] Deduced a trap composed of 204 places in 200 ms of which 3 ms to minimize.
[2024-05-28 02:49:59] [INFO ] Deduced a trap composed of 168 places in 175 ms of which 3 ms to minimize.
[2024-05-28 02:49:59] [INFO ] Deduced a trap composed of 151 places in 205 ms of which 3 ms to minimize.
[2024-05-28 02:49:59] [INFO ] Deduced a trap composed of 177 places in 170 ms of which 3 ms to minimize.
[2024-05-28 02:49:59] [INFO ] Deduced a trap composed of 195 places in 144 ms of which 3 ms to minimize.
[2024-05-28 02:49:59] [INFO ] Deduced a trap composed of 188 places in 144 ms of which 2 ms to minimize.
[2024-05-28 02:49:59] [INFO ] Deduced a trap composed of 168 places in 151 ms of which 2 ms to minimize.
[2024-05-28 02:50:00] [INFO ] Deduced a trap composed of 128 places in 175 ms of which 3 ms to minimize.
[2024-05-28 02:50:00] [INFO ] Deduced a trap composed of 142 places in 144 ms of which 2 ms to minimize.
[2024-05-28 02:50:00] [INFO ] Deduced a trap composed of 216 places in 197 ms of which 2 ms to minimize.
[2024-05-28 02:50:01] [INFO ] Deduced a trap composed of 159 places in 179 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 874 unsolved
[2024-05-28 02:50:09] [INFO ] Deduced a trap composed of 195 places in 139 ms of which 2 ms to minimize.
[2024-05-28 02:50:09] [INFO ] Deduced a trap composed of 164 places in 140 ms of which 2 ms to minimize.
[2024-05-28 02:50:10] [INFO ] Deduced a trap composed of 160 places in 158 ms of which 2 ms to minimize.
[2024-05-28 02:50:10] [INFO ] Deduced a trap composed of 142 places in 145 ms of which 2 ms to minimize.
[2024-05-28 02:50:10] [INFO ] Deduced a trap composed of 148 places in 148 ms of which 2 ms to minimize.
[2024-05-28 02:50:11] [INFO ] Deduced a trap composed of 194 places in 148 ms of which 3 ms to minimize.
[2024-05-28 02:50:11] [INFO ] Deduced a trap composed of 237 places in 154 ms of which 2 ms to minimize.
[2024-05-28 02:50:11] [INFO ] Deduced a trap composed of 217 places in 146 ms of which 2 ms to minimize.
[2024-05-28 02:50:11] [INFO ] Deduced a trap composed of 218 places in 150 ms of which 2 ms to minimize.
[2024-05-28 02:50:13] [INFO ] Deduced a trap composed of 138 places in 204 ms of which 3 ms to minimize.
[2024-05-28 02:50:13] [INFO ] Deduced a trap composed of 163 places in 168 ms of which 2 ms to minimize.
[2024-05-28 02:50:13] [INFO ] Deduced a trap composed of 181 places in 188 ms of which 3 ms to minimize.
[2024-05-28 02:50:13] [INFO ] Deduced a trap composed of 190 places in 166 ms of which 2 ms to minimize.
[2024-05-28 02:50:14] [INFO ] Deduced a trap composed of 190 places in 171 ms of which 2 ms to minimize.
[2024-05-28 02:50:14] [INFO ] Deduced a trap composed of 184 places in 175 ms of which 2 ms to minimize.
[2024-05-28 02:50:14] [INFO ] Deduced a trap composed of 190 places in 151 ms of which 2 ms to minimize.
[2024-05-28 02:50:14] [INFO ] Deduced a trap composed of 185 places in 148 ms of which 2 ms to minimize.
[2024-05-28 02:50:15] [INFO ] Deduced a trap composed of 195 places in 143 ms of which 2 ms to minimize.
[2024-05-28 02:50:15] [INFO ] Deduced a trap composed of 202 places in 152 ms of which 2 ms to minimize.
[2024-05-28 02:50:15] [INFO ] Deduced a trap composed of 185 places in 151 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 874 unsolved
[2024-05-28 02:50:17] [INFO ] Deduced a trap composed of 168 places in 189 ms of which 3 ms to minimize.
[2024-05-28 02:50:17] [INFO ] Deduced a trap composed of 143 places in 170 ms of which 3 ms to minimize.
[2024-05-28 02:50:17] [INFO ] Deduced a trap composed of 169 places in 140 ms of which 2 ms to minimize.
[2024-05-28 02:50:17] [INFO ] Deduced a trap composed of 188 places in 138 ms of which 2 ms to minimize.
[2024-05-28 02:50:18] [INFO ] Deduced a trap composed of 156 places in 143 ms of which 3 ms to minimize.
[2024-05-28 02:50:18] [INFO ] Deduced a trap composed of 153 places in 180 ms of which 3 ms to minimize.
SMT process timed out in 31196ms, After SMT, problems are : Problem set: 0 solved, 874 unsolved
Search for dead transitions found 0 dead transitions in 31211ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60595 ms. Remains : 374/374 places, 878/878 transitions.
Treatment of property PolyORBLF-PT-S04J04T06-LTLCardinality-13 finished in 316391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 1365/1365 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 537 transition count 1320
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 492 transition count 1319
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 491 transition count 1319
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 92 place count 491 transition count 1260
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 210 place count 432 transition count 1260
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 332 place count 371 transition count 1199
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 333 place count 370 transition count 1198
Iterating global reduction 3 with 1 rules applied. Total rules applied 334 place count 370 transition count 1198
Applied a total of 334 rules in 108 ms. Remains 370 /537 variables (removed 167) and now considering 1198/1365 (removed 167) transitions.
Running 1194 sub problems to find dead transitions.
[2024-05-28 02:50:18] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
// Phase 1: matrix 1174 rows 370 cols
[2024-05-28 02:50:18] [INFO ] Computed 40 invariants in 15 ms
[2024-05-28 02:50:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 02:50:30] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 0 ms to minimize.
[2024-05-28 02:50:30] [INFO ] Deduced a trap composed of 47 places in 30 ms of which 1 ms to minimize.
[2024-05-28 02:50:30] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 0 ms to minimize.
[2024-05-28 02:50:30] [INFO ] Deduced a trap composed of 47 places in 32 ms of which 1 ms to minimize.
[2024-05-28 02:50:30] [INFO ] Deduced a trap composed of 47 places in 30 ms of which 0 ms to minimize.
[2024-05-28 02:50:30] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 1 ms to minimize.
[2024-05-28 02:50:30] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 2 ms to minimize.
[2024-05-28 02:50:31] [INFO ] Deduced a trap composed of 57 places in 180 ms of which 2 ms to minimize.
[2024-05-28 02:50:31] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 2 ms to minimize.
[2024-05-28 02:50:31] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 6 ms to minimize.
[2024-05-28 02:50:32] [INFO ] Deduced a trap composed of 139 places in 175 ms of which 2 ms to minimize.
[2024-05-28 02:50:32] [INFO ] Deduced a trap composed of 120 places in 235 ms of which 2 ms to minimize.
[2024-05-28 02:50:34] [INFO ] Deduced a trap composed of 200 places in 183 ms of which 2 ms to minimize.
[2024-05-28 02:50:35] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 2 ms to minimize.
[2024-05-28 02:50:36] [INFO ] Deduced a trap composed of 169 places in 204 ms of which 2 ms to minimize.
[2024-05-28 02:50:41] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 2 ms to minimize.
[2024-05-28 02:50:41] [INFO ] Deduced a trap composed of 194 places in 246 ms of which 2 ms to minimize.
[2024-05-28 02:50:42] [INFO ] Deduced a trap composed of 187 places in 252 ms of which 2 ms to minimize.
[2024-05-28 02:50:43] [INFO ] Deduced a trap composed of 149 places in 250 ms of which 3 ms to minimize.
[2024-05-28 02:50:43] [INFO ] Deduced a trap composed of 140 places in 227 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1544 variables, and 56 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 02:50:49] [INFO ] Deduced a trap composed of 193 places in 257 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1544 variables, and 57 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 21/21 constraints]
After SMT, in 44857ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 44868ms
[2024-05-28 02:51:03] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-28 02:51:03] [INFO ] Invariant cache hit.
[2024-05-28 02:51:04] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-28 02:51:04] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-28 02:51:04] [INFO ] Invariant cache hit.
[2024-05-28 02:51:04] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:51:10] [INFO ] Implicit Places using invariants and state equation in 6560 ms returned []
Implicit Place search using SMT with State Equation took 6920 ms to find 0 implicit places.
[2024-05-28 02:51:10] [INFO ] Redundant transitions in 29 ms returned []
Running 1194 sub problems to find dead transitions.
[2024-05-28 02:51:10] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-05-28 02:51:10] [INFO ] Invariant cache hit.
[2024-05-28 02:51:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 02:51:22] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-05-28 02:51:22] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 1 ms to minimize.
[2024-05-28 02:51:22] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-28 02:51:22] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 1 ms to minimize.
[2024-05-28 02:51:22] [INFO ] Deduced a trap composed of 47 places in 32 ms of which 1 ms to minimize.
[2024-05-28 02:51:22] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-05-28 02:51:22] [INFO ] Deduced a trap composed of 59 places in 212 ms of which 3 ms to minimize.
[2024-05-28 02:51:23] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 2 ms to minimize.
[2024-05-28 02:51:23] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 1 ms to minimize.
[2024-05-28 02:51:23] [INFO ] Deduced a trap composed of 139 places in 220 ms of which 3 ms to minimize.
[2024-05-28 02:51:24] [INFO ] Deduced a trap composed of 125 places in 228 ms of which 3 ms to minimize.
[2024-05-28 02:51:24] [INFO ] Deduced a trap composed of 189 places in 294 ms of which 3 ms to minimize.
[2024-05-28 02:51:24] [INFO ] Deduced a trap composed of 120 places in 220 ms of which 2 ms to minimize.
[2024-05-28 02:51:29] [INFO ] Deduced a trap composed of 174 places in 257 ms of which 3 ms to minimize.
[2024-05-28 02:51:29] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 2 ms to minimize.
[2024-05-28 02:51:30] [INFO ] Deduced a trap composed of 137 places in 236 ms of which 3 ms to minimize.
[2024-05-28 02:51:33] [INFO ] Deduced a trap composed of 181 places in 250 ms of which 3 ms to minimize.
[2024-05-28 02:51:33] [INFO ] Deduced a trap composed of 188 places in 243 ms of which 2 ms to minimize.
[2024-05-28 02:51:34] [INFO ] Deduced a trap composed of 178 places in 236 ms of which 3 ms to minimize.
[2024-05-28 02:51:34] [INFO ] Deduced a trap composed of 149 places in 213 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 02:51:43] [INFO ] Deduced a trap composed of 183 places in 215 ms of which 2 ms to minimize.
[2024-05-28 02:51:44] [INFO ] Deduced a trap composed of 178 places in 182 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1544 variables, and 58 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 22/58 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-05-28 02:52:03] [INFO ] Deduced a trap composed of 140 places in 201 ms of which 2 ms to minimize.
[2024-05-28 02:52:06] [INFO ] Deduced a trap composed of 174 places in 247 ms of which 2 ms to minimize.
[2024-05-28 02:52:06] [INFO ] Deduced a trap composed of 174 places in 256 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 9)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 2)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(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 1)
(s52 0)
(s53 0)
(s54 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 0)
(s80 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1544 variables, and 61 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 25/25 constraints]
After SMT, in 64645ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 64659ms
Starting structural reductions in SI_LTL mode, iteration 1 : 370/537 places, 1198/1365 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116600 ms. Remains : 370/537 places, 1198/1365 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLCardinality-15
Stuttering criterion allowed to conclude after 5617 steps with 34 reset in 26 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLCardinality-15 finished in 116670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F(p1)))))'
[2024-05-28 02:52:15] [INFO ] Flatten gal took : 94 ms
[2024-05-28 02:52:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-28 02:52:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 537 places, 1365 transitions and 6942 arcs took 11 ms.
Total runtime 1082718 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S04J04T06

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 2679
MODEL NAME: /home/mcc/execution/414/model
537 places, 1365 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-PT-S04J04T06, 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 r289-tajo-171654445500267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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