Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r464-smll-171620118400380.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Anderson-PT-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620118400380
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.1M May 18 16:42 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 Anderson-PT-12-LTLFireability-00
FORMULA_NAME Anderson-PT-12-LTLFireability-01
FORMULA_NAME Anderson-PT-12-LTLFireability-02
FORMULA_NAME Anderson-PT-12-LTLFireability-03
FORMULA_NAME Anderson-PT-12-LTLFireability-04
FORMULA_NAME Anderson-PT-12-LTLFireability-05
FORMULA_NAME Anderson-PT-12-LTLFireability-06
FORMULA_NAME Anderson-PT-12-LTLFireability-07
FORMULA_NAME Anderson-PT-12-LTLFireability-08
FORMULA_NAME Anderson-PT-12-LTLFireability-09
FORMULA_NAME Anderson-PT-12-LTLFireability-10
FORMULA_NAME Anderson-PT-12-LTLFireability-11
FORMULA_NAME Anderson-PT-12-LTLFireability-12
FORMULA_NAME Anderson-PT-12-LTLFireability-13
FORMULA_NAME Anderson-PT-12-LTLFireability-14
FORMULA_NAME Anderson-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717262061018

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:14:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 17:14:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:14:24] [INFO ] Load time of PNML (sax parser for PT used): 600 ms
[2024-06-01 17:14:24] [INFO ] Transformed 889 places.
[2024-06-01 17:14:24] [INFO ] Transformed 4152 transitions.
[2024-06-01 17:14:24] [INFO ] Found NUPN structural information;
[2024-06-01 17:14:24] [INFO ] Parsed PT model containing 889 places and 4152 transitions and 16080 arcs in 881 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Anderson-PT-12-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 889/889 places, 4152/4152 transitions.
Discarding 238 places :
Symmetric choice reduction at 0 with 238 rule applications. Total rules 238 place count 651 transition count 1516
Iterating global reduction 0 with 238 rules applied. Total rules applied 476 place count 651 transition count 1516
Applied a total of 476 rules in 195 ms. Remains 651 /889 variables (removed 238) and now considering 1516/4152 (removed 2636) transitions.
// Phase 1: matrix 1516 rows 651 cols
[2024-06-01 17:14:25] [INFO ] Computed 27 invariants in 184 ms
[2024-06-01 17:14:27] [INFO ] Implicit Places using invariants in 2185 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2241 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 650/889 places, 1516/4152 transitions.
Applied a total of 0 rules in 43 ms. Remains 650 /650 variables (removed 0) and now considering 1516/1516 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2509 ms. Remains : 650/889 places, 1516/4152 transitions.
Support contains 47 out of 650 places after structural reductions.
[2024-06-01 17:14:28] [INFO ] Flatten gal took : 355 ms
[2024-06-01 17:14:28] [INFO ] Flatten gal took : 195 ms
[2024-06-01 17:14:28] [INFO ] Input system was already deterministic with 1516 transitions.
Support contains 46 out of 650 places (down from 47) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2748 ms. (14 steps per ms) remains 21/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 54 ms. (72 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (8 resets) in 81 ms. (48 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 98 ms. (40 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 69 ms. (57 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
// Phase 1: matrix 1516 rows 650 cols
[2024-06-01 17:14:30] [INFO ] Computed 26 invariants in 33 ms
[2024-06-01 17:14:30] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 597/629 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/629 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 13/642 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/642 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 17:14:31] [INFO ] Deduced a trap composed of 506 places in 650 ms of which 94 ms to minimize.
[2024-06-01 17:14:33] [INFO ] Deduced a trap composed of 433 places in 988 ms of which 14 ms to minimize.
[2024-06-01 17:14:34] [INFO ] Deduced a trap composed of 453 places in 866 ms of which 11 ms to minimize.
[2024-06-01 17:14:35] [INFO ] Deduced a trap composed of 512 places in 844 ms of which 9 ms to minimize.
[2024-06-01 17:14:35] [INFO ] Deduced a trap composed of 466 places in 861 ms of which 9 ms to minimize.
SMT process timed out in 5694ms, After SMT, problems are : Problem set: 0 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 650 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 650 transition count 1390
Reduce places removed 126 places and 0 transitions.
Iterating post reduction 1 with 126 rules applied. Total rules applied 252 place count 524 transition count 1390
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 131 Pre rules applied. Total rules applied 252 place count 524 transition count 1259
Deduced a syphon composed of 131 places in 2 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 262 rules applied. Total rules applied 514 place count 393 transition count 1259
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 521 place count 386 transition count 1142
Iterating global reduction 2 with 7 rules applied. Total rules applied 528 place count 386 transition count 1142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 530 place count 385 transition count 1141
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 2 with 18 rules applied. Total rules applied 548 place count 385 transition count 1123
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 566 place count 367 transition count 1123
Applied a total of 566 rules in 369 ms. Remains 367 /650 variables (removed 283) and now considering 1123/1516 (removed 393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 370 ms. Remains : 367/650 places, 1123/1516 transitions.
RANDOM walk for 40000 steps (8 resets) in 1758 ms. (22 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 16/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 14/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 13/13 properties
// Phase 1: matrix 1123 rows 367 cols
[2024-06-01 17:14:37] [INFO ] Computed 26 invariants in 18 ms
[2024-06-01 17:14:37] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 320/342 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 3/345 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 21/366 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 17:14:38] [INFO ] Deduced a trap composed of 101 places in 494 ms of which 6 ms to minimize.
[2024-06-01 17:14:38] [INFO ] Deduced a trap composed of 100 places in 642 ms of which 6 ms to minimize.
[2024-06-01 17:14:39] [INFO ] Deduced a trap composed of 88 places in 579 ms of which 6 ms to minimize.
[2024-06-01 17:14:40] [INFO ] Deduced a trap composed of 109 places in 548 ms of which 6 ms to minimize.
[2024-06-01 17:14:40] [INFO ] Deduced a trap composed of 105 places in 500 ms of which 5 ms to minimize.
[2024-06-01 17:14:41] [INFO ] Deduced a trap composed of 80 places in 390 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 17:14:41] [INFO ] Deduced a trap composed of 109 places in 479 ms of which 5 ms to minimize.
[2024-06-01 17:14:42] [INFO ] Deduced a trap composed of 119 places in 553 ms of which 6 ms to minimize.
[2024-06-01 17:14:42] [INFO ] Deduced a trap composed of 108 places in 584 ms of which 6 ms to minimize.
[2024-06-01 17:14:43] [INFO ] Deduced a trap composed of 100 places in 595 ms of which 6 ms to minimize.
[2024-06-01 17:14:44] [INFO ] Deduced a trap composed of 84 places in 578 ms of which 6 ms to minimize.
[2024-06-01 17:14:44] [INFO ] Deduced a trap composed of 63 places in 595 ms of which 5 ms to minimize.
[2024-06-01 17:14:45] [INFO ] Deduced a trap composed of 119 places in 556 ms of which 5 ms to minimize.
[2024-06-01 17:14:45] [INFO ] Deduced a trap composed of 76 places in 574 ms of which 6 ms to minimize.
[2024-06-01 17:14:46] [INFO ] Deduced a trap composed of 120 places in 533 ms of which 5 ms to minimize.
[2024-06-01 17:14:46] [INFO ] Deduced a trap composed of 55 places in 484 ms of which 6 ms to minimize.
[2024-06-01 17:14:47] [INFO ] Deduced a trap composed of 139 places in 607 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 11/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/367 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 1123/1490 variables, 367/410 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1490 variables, 132/542 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1490 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/1490 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1490/1490 variables, and 542 constraints, problems are : Problem set: 0 solved, 13 unsolved in 13140 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 367/367 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 320/342 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 3/345 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp27 is UNSAT
At refinement iteration 5 (OVERLAPS) 21/366 variables, 12/25 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 17/42 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-01 17:14:51] [INFO ] Deduced a trap composed of 79 places in 526 ms of which 6 ms to minimize.
[2024-06-01 17:14:52] [INFO ] Deduced a trap composed of 79 places in 549 ms of which 6 ms to minimize.
[2024-06-01 17:14:52] [INFO ] Deduced a trap composed of 83 places in 403 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 3/45 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-01 17:14:53] [INFO ] Deduced a trap composed of 64 places in 501 ms of which 4 ms to minimize.
[2024-06-01 17:14:54] [INFO ] Deduced a trap composed of 53 places in 404 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 2/47 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-01 17:14:54] [INFO ] Deduced a trap composed of 108 places in 593 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 1/48 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-01 17:14:55] [INFO ] Deduced a trap composed of 184 places in 593 ms of which 6 ms to minimize.
[2024-06-01 17:14:56] [INFO ] Deduced a trap composed of 74 places in 499 ms of which 5 ms to minimize.
[2024-06-01 17:14:56] [INFO ] Deduced a trap composed of 85 places in 567 ms of which 6 ms to minimize.
[2024-06-01 17:14:57] [INFO ] Deduced a trap composed of 71 places in 590 ms of which 6 ms to minimize.
[2024-06-01 17:14:58] [INFO ] Deduced a trap composed of 99 places in 575 ms of which 6 ms to minimize.
[2024-06-01 17:14:58] [INFO ] Deduced a trap composed of 87 places in 531 ms of which 6 ms to minimize.
[2024-06-01 17:14:59] [INFO ] Deduced a trap composed of 70 places in 572 ms of which 6 ms to minimize.
[2024-06-01 17:14:59] [INFO ] Deduced a trap composed of 96 places in 567 ms of which 6 ms to minimize.
[2024-06-01 17:15:00] [INFO ] Deduced a trap composed of 115 places in 553 ms of which 5 ms to minimize.
[2024-06-01 17:15:01] [INFO ] Deduced a trap composed of 110 places in 527 ms of which 6 ms to minimize.
[2024-06-01 17:15:01] [INFO ] Deduced a trap composed of 80 places in 530 ms of which 6 ms to minimize.
[2024-06-01 17:15:02] [INFO ] Deduced a trap composed of 79 places in 524 ms of which 7 ms to minimize.
[2024-06-01 17:15:02] [INFO ] Deduced a trap composed of 83 places in 599 ms of which 6 ms to minimize.
[2024-06-01 17:15:03] [INFO ] Deduced a trap composed of 83 places in 587 ms of which 6 ms to minimize.
[2024-06-01 17:15:04] [INFO ] Deduced a trap composed of 86 places in 621 ms of which 6 ms to minimize.
[2024-06-01 17:15:04] [INFO ] Deduced a trap composed of 59 places in 602 ms of which 6 ms to minimize.
[2024-06-01 17:15:05] [INFO ] Deduced a trap composed of 61 places in 600 ms of which 6 ms to minimize.
[2024-06-01 17:15:05] [INFO ] Deduced a trap composed of 147 places in 611 ms of which 6 ms to minimize.
[2024-06-01 17:15:06] [INFO ] Deduced a trap composed of 107 places in 590 ms of which 6 ms to minimize.
[2024-06-01 17:15:07] [INFO ] Deduced a trap composed of 103 places in 555 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 20/68 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-01 17:15:07] [INFO ] Deduced a trap composed of 79 places in 579 ms of which 6 ms to minimize.
[2024-06-01 17:15:08] [INFO ] Deduced a trap composed of 69 places in 563 ms of which 6 ms to minimize.
[2024-06-01 17:15:09] [INFO ] Deduced a trap composed of 83 places in 517 ms of which 5 ms to minimize.
[2024-06-01 17:15:09] [INFO ] Deduced a trap composed of 95 places in 501 ms of which 5 ms to minimize.
[2024-06-01 17:15:10] [INFO ] Deduced a trap composed of 96 places in 544 ms of which 6 ms to minimize.
[2024-06-01 17:15:10] [INFO ] Deduced a trap composed of 98 places in 608 ms of which 6 ms to minimize.
[2024-06-01 17:15:11] [INFO ] Deduced a trap composed of 58 places in 565 ms of which 6 ms to minimize.
[2024-06-01 17:15:11] [INFO ] Deduced a trap composed of 88 places in 556 ms of which 6 ms to minimize.
[2024-06-01 17:15:12] [INFO ] Deduced a trap composed of 77 places in 559 ms of which 9 ms to minimize.
[2024-06-01 17:15:13] [INFO ] Deduced a trap composed of 82 places in 564 ms of which 6 ms to minimize.
[2024-06-01 17:15:13] [INFO ] Deduced a trap composed of 91 places in 555 ms of which 6 ms to minimize.
[2024-06-01 17:15:14] [INFO ] Deduced a trap composed of 80 places in 516 ms of which 5 ms to minimize.
[2024-06-01 17:15:14] [INFO ] Deduced a trap composed of 83 places in 540 ms of which 6 ms to minimize.
[2024-06-01 17:15:15] [INFO ] Deduced a trap composed of 79 places in 564 ms of which 6 ms to minimize.
[2024-06-01 17:15:15] [INFO ] Deduced a trap composed of 117 places in 577 ms of which 6 ms to minimize.
[2024-06-01 17:15:16] [INFO ] Deduced a trap composed of 102 places in 568 ms of which 6 ms to minimize.
[2024-06-01 17:15:17] [INFO ] Deduced a trap composed of 98 places in 589 ms of which 5 ms to minimize.
[2024-06-01 17:15:17] [INFO ] Deduced a trap composed of 102 places in 577 ms of which 6 ms to minimize.
[2024-06-01 17:15:18] [INFO ] Deduced a trap composed of 104 places in 545 ms of which 6 ms to minimize.
[2024-06-01 17:15:19] [INFO ] Deduced a trap composed of 93 places in 609 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 20/88 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-01 17:15:19] [INFO ] Deduced a trap composed of 52 places in 594 ms of which 7 ms to minimize.
[2024-06-01 17:15:20] [INFO ] Deduced a trap composed of 88 places in 571 ms of which 6 ms to minimize.
[2024-06-01 17:15:21] [INFO ] Deduced a trap composed of 97 places in 490 ms of which 4 ms to minimize.
[2024-06-01 17:15:21] [INFO ] Deduced a trap composed of 89 places in 598 ms of which 6 ms to minimize.
[2024-06-01 17:15:22] [INFO ] Deduced a trap composed of 143 places in 566 ms of which 6 ms to minimize.
[2024-06-01 17:15:23] [INFO ] Deduced a trap composed of 87 places in 525 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/366 variables, 6/94 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-01 17:15:24] [INFO ] Deduced a trap composed of 118 places in 587 ms of which 6 ms to minimize.
[2024-06-01 17:15:25] [INFO ] Deduced a trap composed of 103 places in 349 ms of which 4 ms to minimize.
[2024-06-01 17:15:25] [INFO ] Deduced a trap composed of 102 places in 307 ms of which 3 ms to minimize.
[2024-06-01 17:15:25] [INFO ] Deduced a trap composed of 93 places in 442 ms of which 6 ms to minimize.
[2024-06-01 17:15:26] [INFO ] Deduced a trap composed of 64 places in 609 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/366 variables, 5/99 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-01 17:15:28] [INFO ] Deduced a trap composed of 117 places in 539 ms of which 6 ms to minimize.
[2024-06-01 17:15:28] [INFO ] Deduced a trap composed of 116 places in 551 ms of which 6 ms to minimize.
[2024-06-01 17:15:29] [INFO ] Deduced a trap composed of 117 places in 572 ms of which 6 ms to minimize.
[2024-06-01 17:15:29] [INFO ] Deduced a trap composed of 127 places in 577 ms of which 6 ms to minimize.
[2024-06-01 17:15:30] [INFO ] Deduced a trap composed of 125 places in 465 ms of which 4 ms to minimize.
[2024-06-01 17:15:30] [INFO ] Deduced a trap composed of 116 places in 442 ms of which 4 ms to minimize.
[2024-06-01 17:15:31] [INFO ] Deduced a trap composed of 122 places in 568 ms of which 5 ms to minimize.
[2024-06-01 17:15:32] [INFO ] Deduced a trap composed of 123 places in 581 ms of which 5 ms to minimize.
[2024-06-01 17:15:32] [INFO ] Deduced a trap composed of 106 places in 514 ms of which 5 ms to minimize.
[2024-06-01 17:15:33] [INFO ] Deduced a trap composed of 126 places in 547 ms of which 5 ms to minimize.
[2024-06-01 17:15:33] [INFO ] Deduced a trap composed of 101 places in 590 ms of which 6 ms to minimize.
[2024-06-01 17:15:34] [INFO ] Deduced a trap composed of 105 places in 583 ms of which 6 ms to minimize.
[2024-06-01 17:15:34] [INFO ] Deduced a trap composed of 74 places in 559 ms of which 6 ms to minimize.
[2024-06-01 17:15:35] [INFO ] Deduced a trap composed of 128 places in 512 ms of which 5 ms to minimize.
SMT process timed out in 58400ms, After SMT, problems are : Problem set: 1 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 19 out of 367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 1123/1123 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 360 transition count 962
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 360 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 359 transition count 961
Applied a total of 16 rules in 97 ms. Remains 359 /367 variables (removed 8) and now considering 961/1123 (removed 162) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 359/367 places, 961/1123 transitions.
RANDOM walk for 40000 steps (8 resets) in 511 ms. (78 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 194 ms. (205 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 247 ms. (161 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 202 ms. (197 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 2/11 properties
// Phase 1: matrix 961 rows 359 cols
[2024-06-01 17:15:36] [INFO ] Computed 26 invariants in 8 ms
[2024-06-01 17:15:36] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 321/325 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/335 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 23/358 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/359 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 961/1320 variables, 359/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1320 variables, 132/517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1320 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/1320 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1320/1320 variables, and 517 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1222 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 359/359 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 321/325 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/335 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 23/358 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/359 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 17:15:38] [INFO ] Deduced a trap composed of 105 places in 464 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 961/1320 variables, 359/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1320 variables, 132/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1320 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1320 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1320 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1320/1320 variables, and 520 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2202 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 359/359 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 3459ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 463 ms.
Support contains 4 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 961/961 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 350 transition count 754
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 350 transition count 754
Applied a total of 18 rules in 56 ms. Remains 350 /359 variables (removed 9) and now considering 754/961 (removed 207) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 350/359 places, 754/961 transitions.
RANDOM walk for 40000 steps (8 resets) in 187 ms. (212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 316457 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 2
Probabilistic random walk after 316457 steps, saw 245360 distinct states, run finished after 3009 ms. (steps per millisecond=105 ) properties seen :0
// Phase 1: matrix 754 rows 350 cols
[2024-06-01 17:15:43] [INFO ] Computed 26 invariants in 11 ms
[2024-06-01 17:15:43] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 312/316 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/326 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 24/350 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 754/1104 variables, 350/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1104 variables, 132/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1104 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1104 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1104/1104 variables, and 508 constraints, problems are : Problem set: 0 solved, 2 unsolved in 960 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 350/350 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 312/316 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/326 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 24/350 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 754/1104 variables, 350/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1104 variables, 132/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1104 variables, 2/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1104 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1104 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1104/1104 variables, and 510 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1423 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 350/350 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2415ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 285 ms.
Support contains 4 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 754/754 transitions.
Applied a total of 0 rules in 34 ms. Remains 350 /350 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 350/350 places, 754/754 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 754/754 transitions.
Applied a total of 0 rules in 31 ms. Remains 350 /350 variables (removed 0) and now considering 754/754 (removed 0) transitions.
[2024-06-01 17:15:46] [INFO ] Invariant cache hit.
[2024-06-01 17:15:47] [INFO ] Implicit Places using invariants in 777 ms returned []
[2024-06-01 17:15:47] [INFO ] Invariant cache hit.
[2024-06-01 17:15:47] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-01 17:15:49] [INFO ] Implicit Places using invariants and state equation in 2663 ms returned []
Implicit Place search using SMT with State Equation took 3448 ms to find 0 implicit places.
[2024-06-01 17:15:49] [INFO ] Redundant transitions in 80 ms returned []
Running 742 sub problems to find dead transitions.
[2024-06-01 17:15:49] [INFO ] Invariant cache hit.
[2024-06-01 17:15:49] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-06-01 17:16:03] [INFO ] Deduced a trap composed of 116 places in 485 ms of which 6 ms to minimize.
[2024-06-01 17:16:06] [INFO ] Deduced a trap composed of 111 places in 480 ms of which 6 ms to minimize.
[2024-06-01 17:16:07] [INFO ] Deduced a trap composed of 66 places in 508 ms of which 6 ms to minimize.
[2024-06-01 17:16:08] [INFO ] Deduced a trap composed of 75 places in 487 ms of which 7 ms to minimize.
[2024-06-01 17:16:08] [INFO ] Deduced a trap composed of 77 places in 483 ms of which 6 ms to minimize.
[2024-06-01 17:16:09] [INFO ] Deduced a trap composed of 123 places in 405 ms of which 4 ms to minimize.
[2024-06-01 17:16:10] [INFO ] Deduced a trap composed of 97 places in 376 ms of which 6 ms to minimize.
[2024-06-01 17:16:10] [INFO ] Deduced a trap composed of 61 places in 414 ms of which 6 ms to minimize.
[2024-06-01 17:16:11] [INFO ] Deduced a trap composed of 96 places in 451 ms of which 6 ms to minimize.
[2024-06-01 17:16:12] [INFO ] Deduced a trap composed of 111 places in 463 ms of which 6 ms to minimize.
[2024-06-01 17:16:12] [INFO ] Deduced a trap composed of 109 places in 407 ms of which 3 ms to minimize.
[2024-06-01 17:16:12] [INFO ] Deduced a trap composed of 98 places in 389 ms of which 4 ms to minimize.
[2024-06-01 17:16:13] [INFO ] Deduced a trap composed of 99 places in 401 ms of which 4 ms to minimize.
[2024-06-01 17:16:13] [INFO ] Deduced a trap composed of 97 places in 405 ms of which 5 ms to minimize.
[2024-06-01 17:16:14] [INFO ] Deduced a trap composed of 87 places in 407 ms of which 5 ms to minimize.
[2024-06-01 17:16:14] [INFO ] Deduced a trap composed of 103 places in 474 ms of which 6 ms to minimize.
[2024-06-01 17:16:15] [INFO ] Deduced a trap composed of 86 places in 479 ms of which 7 ms to minimize.
[2024-06-01 17:16:15] [INFO ] Deduced a trap composed of 112 places in 498 ms of which 5 ms to minimize.
[2024-06-01 17:16:16] [INFO ] Deduced a trap composed of 99 places in 509 ms of which 6 ms to minimize.
[2024-06-01 17:16:16] [INFO ] Deduced a trap composed of 128 places in 474 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-06-01 17:16:18] [INFO ] Deduced a trap composed of 113 places in 506 ms of which 6 ms to minimize.
[2024-06-01 17:16:19] [INFO ] Deduced a trap composed of 91 places in 486 ms of which 6 ms to minimize.
[2024-06-01 17:16:19] [INFO ] Deduced a trap composed of 89 places in 495 ms of which 6 ms to minimize.
[2024-06-01 17:16:20] [INFO ] Deduced a trap composed of 126 places in 424 ms of which 5 ms to minimize.
[2024-06-01 17:16:20] [INFO ] Deduced a trap composed of 92 places in 481 ms of which 6 ms to minimize.
[2024-06-01 17:16:21] [INFO ] Deduced a trap composed of 99 places in 498 ms of which 6 ms to minimize.
SMT process timed out in 31497ms, After SMT, problems are : Problem set: 0 solved, 742 unsolved
Search for dead transitions found 0 dead transitions in 31522ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35102 ms. Remains : 350/350 places, 754/754 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA Anderson-PT-12-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 4 out of 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 650 transition count 1374
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 508 transition count 1374
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 284 place count 508 transition count 1242
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 548 place count 376 transition count 1242
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 572 place count 352 transition count 756
Iterating global reduction 2 with 24 rules applied. Total rules applied 596 place count 352 transition count 756
Applied a total of 596 rules in 117 ms. Remains 352 /650 variables (removed 298) and now considering 756/1516 (removed 760) transitions.
// Phase 1: matrix 756 rows 352 cols
[2024-06-01 17:16:22] [INFO ] Computed 26 invariants in 13 ms
[2024-06-01 17:16:22] [INFO ] Implicit Places using invariants in 758 ms returned []
[2024-06-01 17:16:22] [INFO ] Invariant cache hit.
[2024-06-01 17:16:23] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-01 17:16:25] [INFO ] Implicit Places using invariants and state equation in 2307 ms returned []
Implicit Place search using SMT with State Equation took 3085 ms to find 0 implicit places.
[2024-06-01 17:16:25] [INFO ] Redundant transitions in 16 ms returned []
Running 744 sub problems to find dead transitions.
[2024-06-01 17:16:25] [INFO ] Invariant cache hit.
[2024-06-01 17:16:25] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-06-01 17:16:36] [INFO ] Deduced a trap composed of 114 places in 481 ms of which 6 ms to minimize.
[2024-06-01 17:16:37] [INFO ] Deduced a trap composed of 75 places in 483 ms of which 6 ms to minimize.
[2024-06-01 17:16:38] [INFO ] Deduced a trap composed of 82 places in 486 ms of which 7 ms to minimize.
[2024-06-01 17:16:38] [INFO ] Deduced a trap composed of 110 places in 486 ms of which 6 ms to minimize.
[2024-06-01 17:16:39] [INFO ] Deduced a trap composed of 75 places in 483 ms of which 5 ms to minimize.
[2024-06-01 17:16:39] [INFO ] Deduced a trap composed of 85 places in 487 ms of which 6 ms to minimize.
[2024-06-01 17:16:40] [INFO ] Deduced a trap composed of 47 places in 474 ms of which 6 ms to minimize.
[2024-06-01 17:16:43] [INFO ] Deduced a trap composed of 105 places in 277 ms of which 4 ms to minimize.
[2024-06-01 17:16:43] [INFO ] Deduced a trap composed of 69 places in 314 ms of which 3 ms to minimize.
[2024-06-01 17:16:43] [INFO ] Deduced a trap composed of 60 places in 306 ms of which 3 ms to minimize.
[2024-06-01 17:16:44] [INFO ] Deduced a trap composed of 87 places in 423 ms of which 6 ms to minimize.
[2024-06-01 17:16:44] [INFO ] Deduced a trap composed of 113 places in 441 ms of which 6 ms to minimize.
[2024-06-01 17:16:45] [INFO ] Deduced a trap composed of 113 places in 365 ms of which 4 ms to minimize.
[2024-06-01 17:16:45] [INFO ] Deduced a trap composed of 113 places in 391 ms of which 6 ms to minimize.
[2024-06-01 17:16:46] [INFO ] Deduced a trap composed of 110 places in 490 ms of which 5 ms to minimize.
[2024-06-01 17:16:46] [INFO ] Deduced a trap composed of 106 places in 399 ms of which 5 ms to minimize.
[2024-06-01 17:16:47] [INFO ] Deduced a trap composed of 93 places in 397 ms of which 5 ms to minimize.
[2024-06-01 17:16:47] [INFO ] Deduced a trap composed of 75 places in 461 ms of which 5 ms to minimize.
[2024-06-01 17:16:48] [INFO ] Deduced a trap composed of 116 places in 497 ms of which 6 ms to minimize.
[2024-06-01 17:16:48] [INFO ] Deduced a trap composed of 128 places in 501 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-06-01 17:16:54] [INFO ] Deduced a trap composed of 114 places in 424 ms of which 5 ms to minimize.
[2024-06-01 17:16:55] [INFO ] Deduced a trap composed of 102 places in 499 ms of which 6 ms to minimize.
[2024-06-01 17:16:55] [INFO ] Deduced a trap composed of 91 places in 496 ms of which 7 ms to minimize.
[2024-06-01 17:16:56] [INFO ] Deduced a trap composed of 92 places in 498 ms of which 5 ms to minimize.
SMT process timed out in 31001ms, After SMT, problems are : Problem set: 0 solved, 744 unsolved
Search for dead transitions found 0 dead transitions in 31015ms
Starting structural reductions in SI_LTL mode, iteration 1 : 352/650 places, 756/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34251 ms. Remains : 352/650 places, 756/1516 transitions.
Stuttering acceptance computed with spot in 387 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-12-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 631 ms.
Product exploration explored 100000 steps with 0 reset in 558 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 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 130 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 856 ms. (46 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 323 ms. (123 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 250 ms. (159 steps per ms) remains 1/4 properties
[2024-06-01 17:16:58] [INFO ] Invariant cache hit.
[2024-06-01 17:16:58] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 317/1108 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 2/14 constraints, Generalized P Invariants (flows): 0/12 constraints, State Equation: 0/352 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 130ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 21 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-12-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-12-LTLFireability-00 finished in 36865 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&&F(p1)))||X(X(G(p2)))))'
Support contains 4 out of 650 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 626 transition count 1030
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 626 transition count 1030
Applied a total of 48 rules in 45 ms. Remains 626 /650 variables (removed 24) and now considering 1030/1516 (removed 486) transitions.
// Phase 1: matrix 1030 rows 626 cols
[2024-06-01 17:16:58] [INFO ] Computed 26 invariants in 20 ms
[2024-06-01 17:16:59] [INFO ] Implicit Places using invariants in 937 ms returned []
[2024-06-01 17:16:59] [INFO ] Invariant cache hit.
[2024-06-01 17:17:00] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-01 17:17:06] [INFO ] Implicit Places using invariants and state equation in 6618 ms returned []
Implicit Place search using SMT with State Equation took 7560 ms to find 0 implicit places.
Running 1018 sub problems to find dead transitions.
[2024-06-01 17:17:06] [INFO ] Invariant cache hit.
[2024-06-01 17:17:06] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
[2024-06-01 17:17:36] [INFO ] Deduced a trap composed of 287 places in 630 ms of which 10 ms to minimize.
[2024-06-01 17:17:37] [INFO ] Deduced a trap composed of 209 places in 574 ms of which 9 ms to minimize.
SMT process timed out in 31415ms, After SMT, problems are : Problem set: 0 solved, 1018 unsolved
Search for dead transitions found 0 dead transitions in 31435ms
Starting structural reductions in LTL mode, iteration 1 : 626/650 places, 1030/1516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39048 ms. Remains : 626/650 places, 1030/1516 transitions.
Stuttering acceptance computed with spot in 476 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-12-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 424 ms.
Stack based approach found an accepted trace after 261 steps with 0 reset with depth 262 and stack size 262 in 2 ms.
FORMULA Anderson-PT-12-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-02 finished in 39997 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 650 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 625 transition count 1007
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 625 transition count 1007
Applied a total of 50 rules in 43 ms. Remains 625 /650 variables (removed 25) and now considering 1007/1516 (removed 509) transitions.
// Phase 1: matrix 1007 rows 625 cols
[2024-06-01 17:17:38] [INFO ] Computed 26 invariants in 13 ms
[2024-06-01 17:17:39] [INFO ] Implicit Places using invariants in 999 ms returned []
[2024-06-01 17:17:39] [INFO ] Invariant cache hit.
[2024-06-01 17:17:40] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-01 17:17:47] [INFO ] Implicit Places using invariants and state equation in 8202 ms returned []
Implicit Place search using SMT with State Equation took 9204 ms to find 0 implicit places.
Running 995 sub problems to find dead transitions.
[2024-06-01 17:17:47] [INFO ] Invariant cache hit.
[2024-06-01 17:17:47] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 995 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/625 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 995 unsolved
[2024-06-01 17:18:14] [INFO ] Deduced a trap composed of 82 places in 817 ms of which 10 ms to minimize.
[2024-06-01 17:18:16] [INFO ] Deduced a trap composed of 226 places in 721 ms of which 9 ms to minimize.
[2024-06-01 17:18:17] [INFO ] Deduced a trap composed of 219 places in 794 ms of which 9 ms to minimize.
[2024-06-01 17:18:18] [INFO ] Deduced a trap composed of 142 places in 855 ms of which 10 ms to minimize.
[2024-06-01 17:18:18] [INFO ] Deduced a trap composed of 140 places in 793 ms of which 9 ms to minimize.
SMT process timed out in 30923ms, After SMT, problems are : Problem set: 0 solved, 995 unsolved
Search for dead transitions found 0 dead transitions in 30945ms
Starting structural reductions in LTL mode, iteration 1 : 625/650 places, 1007/1516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40198 ms. Remains : 625/650 places, 1007/1516 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-03
Entered a terminal (fully accepting) state of product in 40532 steps with 0 reset in 126 ms.
FORMULA Anderson-PT-12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-12-LTLFireability-03 finished in 40533 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(p1)&&p0))||X(F(p2))))'
Support contains 4 out of 650 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 626 transition count 1030
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 626 transition count 1030
Applied a total of 48 rules in 46 ms. Remains 626 /650 variables (removed 24) and now considering 1030/1516 (removed 486) transitions.
// Phase 1: matrix 1030 rows 626 cols
[2024-06-01 17:18:19] [INFO ] Computed 26 invariants in 14 ms
[2024-06-01 17:18:20] [INFO ] Implicit Places using invariants in 1037 ms returned []
[2024-06-01 17:18:20] [INFO ] Invariant cache hit.
[2024-06-01 17:18:21] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-01 17:18:26] [INFO ] Implicit Places using invariants and state equation in 6073 ms returned []
Implicit Place search using SMT with State Equation took 7137 ms to find 0 implicit places.
Running 1018 sub problems to find dead transitions.
[2024-06-01 17:18:26] [INFO ] Invariant cache hit.
[2024-06-01 17:18:26] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.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 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1656 variables, and 26 constraints, problems are : Problem set: 0 solved, 1018 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/626 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 1018/1018 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1018 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
[2024-06-01 17:19:02] [INFO ] Deduced a trap composed of 148 places in 607 ms of which 6 ms to minimize.
[2024-06-01 17:19:10] [INFO ] Deduced a trap composed of 314 places in 841 ms of which 9 ms to minimize.
[2024-06-01 17:19:10] [INFO ] Deduced a trap composed of 127 places in 891 ms of which 10 ms to minimize.
[2024-06-01 17:19:12] [INFO ] Deduced a trap composed of 221 places in 882 ms of which 10 ms to minimize.
[2024-06-01 17:19:13] [INFO ] Deduced a trap composed of 294 places in 874 ms of which 10 ms to minimize.
[2024-06-01 17:19:14] [INFO ] Deduced a trap composed of 301 places in 928 ms of which 10 ms to minimize.
[2024-06-01 17:19:15] [INFO ] Deduced a trap composed of 291 places in 895 ms of which 10 ms to minimize.
[2024-06-01 17:19:15] [INFO ] Deduced a trap composed of 174 places in 829 ms of which 10 ms to minimize.
[2024-06-01 17:19:16] [INFO ] Deduced a trap composed of 303 places in 562 ms of which 6 ms to minimize.
[2024-06-01 17:19:17] [INFO ] Deduced a trap composed of 334 places in 614 ms of which 6 ms to minimize.
[2024-06-01 17:19:17] [INFO ] Deduced a trap composed of 339 places in 797 ms of which 9 ms to minimize.
[2024-06-01 17:19:18] [INFO ] Deduced a trap composed of 261 places in 783 ms of which 6 ms to minimize.
[2024-06-01 17:19:19] [INFO ] Deduced a trap composed of 144 places in 717 ms of which 10 ms to minimize.
[2024-06-01 17:19:20] [INFO ] Deduced a trap composed of 303 places in 874 ms of which 9 ms to minimize.
[2024-06-01 17:19:21] [INFO ] Deduced a trap composed of 251 places in 781 ms of which 9 ms to minimize.
[2024-06-01 17:19:21] [INFO ] Deduced a trap composed of 397 places in 726 ms of which 9 ms to minimize.
[2024-06-01 17:19:22] [INFO ] Deduced a trap composed of 338 places in 760 ms of which 10 ms to minimize.
[2024-06-01 17:19:23] [INFO ] Deduced a trap composed of 203 places in 864 ms of which 9 ms to minimize.
[2024-06-01 17:19:24] [INFO ] Deduced a trap composed of 108 places in 732 ms of which 9 ms to minimize.
[2024-06-01 17:19:25] [INFO ] Deduced a trap composed of 329 places in 584 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/626 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/1656 variables, and 46 constraints, problems are : Problem set: 0 solved, 1018 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/626 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/1018 constraints, Known Traps: 20/20 constraints]
After SMT, in 61038ms problems are : Problem set: 0 solved, 1018 unsolved
Search for dead transitions found 0 dead transitions in 61050ms
Starting structural reductions in LTL mode, iteration 1 : 626/650 places, 1030/1516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68237 ms. Remains : 626/650 places, 1030/1516 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Anderson-PT-12-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 456 ms.
Product exploration explored 100000 steps with 50000 reset in 508 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) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 17 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-12-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-12-LTLFireability-07 finished in 69456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (p1||G(!p2)))&&F(G(p2))))'
Support contains 5 out of 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 650 transition count 1375
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 place count 509 transition count 1375
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 282 place count 509 transition count 1243
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 546 place count 377 transition count 1243
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 569 place count 354 transition count 780
Iterating global reduction 2 with 23 rules applied. Total rules applied 592 place count 354 transition count 780
Applied a total of 592 rules in 50 ms. Remains 354 /650 variables (removed 296) and now considering 780/1516 (removed 736) transitions.
// Phase 1: matrix 780 rows 354 cols
[2024-06-01 17:19:28] [INFO ] Computed 26 invariants in 6 ms
[2024-06-01 17:19:29] [INFO ] Implicit Places using invariants in 507 ms returned []
[2024-06-01 17:19:29] [INFO ] Invariant cache hit.
[2024-06-01 17:19:29] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-01 17:19:31] [INFO ] Implicit Places using invariants and state equation in 2097 ms returned []
Implicit Place search using SMT with State Equation took 2609 ms to find 0 implicit places.
[2024-06-01 17:19:31] [INFO ] Redundant transitions in 6 ms returned []
Running 768 sub problems to find dead transitions.
[2024-06-01 17:19:31] [INFO ] Invariant cache hit.
[2024-06-01 17:19:31] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-06-01 17:19:43] [INFO ] Deduced a trap composed of 97 places in 492 ms of which 6 ms to minimize.
[2024-06-01 17:19:44] [INFO ] Deduced a trap composed of 77 places in 485 ms of which 5 ms to minimize.
[2024-06-01 17:19:44] [INFO ] Deduced a trap composed of 91 places in 504 ms of which 5 ms to minimize.
[2024-06-01 17:19:45] [INFO ] Deduced a trap composed of 150 places in 506 ms of which 6 ms to minimize.
[2024-06-01 17:19:45] [INFO ] Deduced a trap composed of 80 places in 502 ms of which 6 ms to minimize.
[2024-06-01 17:19:46] [INFO ] Deduced a trap composed of 49 places in 439 ms of which 7 ms to minimize.
[2024-06-01 17:19:49] [INFO ] Deduced a trap composed of 60 places in 465 ms of which 5 ms to minimize.
[2024-06-01 17:19:50] [INFO ] Deduced a trap composed of 72 places in 488 ms of which 6 ms to minimize.
[2024-06-01 17:19:50] [INFO ] Deduced a trap composed of 60 places in 470 ms of which 6 ms to minimize.
[2024-06-01 17:19:51] [INFO ] Deduced a trap composed of 49 places in 495 ms of which 6 ms to minimize.
[2024-06-01 17:19:51] [INFO ] Deduced a trap composed of 93 places in 506 ms of which 5 ms to minimize.
[2024-06-01 17:19:52] [INFO ] Deduced a trap composed of 103 places in 438 ms of which 5 ms to minimize.
[2024-06-01 17:19:52] [INFO ] Deduced a trap composed of 111 places in 490 ms of which 6 ms to minimize.
[2024-06-01 17:19:53] [INFO ] Deduced a trap composed of 106 places in 489 ms of which 6 ms to minimize.
[2024-06-01 17:19:53] [INFO ] Deduced a trap composed of 72 places in 539 ms of which 6 ms to minimize.
[2024-06-01 17:19:55] [INFO ] Deduced a trap composed of 54 places in 438 ms of which 6 ms to minimize.
[2024-06-01 17:19:55] [INFO ] Deduced a trap composed of 73 places in 503 ms of which 6 ms to minimize.
[2024-06-01 17:19:56] [INFO ] Deduced a trap composed of 63 places in 417 ms of which 6 ms to minimize.
[2024-06-01 17:19:56] [INFO ] Deduced a trap composed of 78 places in 508 ms of which 5 ms to minimize.
[2024-06-01 17:19:57] [INFO ] Deduced a trap composed of 77 places in 410 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 768 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 354/1134 variables, and 46 constraints, problems are : Problem set: 0 solved, 768 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/354 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 768/768 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 768 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-06-01 17:20:10] [INFO ] Deduced a trap composed of 127 places in 487 ms of which 6 ms to minimize.
[2024-06-01 17:20:10] [INFO ] Deduced a trap composed of 118 places in 483 ms of which 6 ms to minimize.
[2024-06-01 17:20:11] [INFO ] Deduced a trap composed of 128 places in 448 ms of which 5 ms to minimize.
[2024-06-01 17:20:11] [INFO ] Deduced a trap composed of 78 places in 519 ms of which 6 ms to minimize.
[2024-06-01 17:20:12] [INFO ] Deduced a trap composed of 93 places in 500 ms of which 6 ms to minimize.
[2024-06-01 17:20:13] [INFO ] Deduced a trap composed of 70 places in 504 ms of which 6 ms to minimize.
[2024-06-01 17:20:14] [INFO ] Deduced a trap composed of 125 places in 534 ms of which 7 ms to minimize.
[2024-06-01 17:20:14] [INFO ] Deduced a trap composed of 77 places in 504 ms of which 6 ms to minimize.
[2024-06-01 17:20:15] [INFO ] Deduced a trap composed of 105 places in 463 ms of which 3 ms to minimize.
[2024-06-01 17:20:15] [INFO ] Deduced a trap composed of 104 places in 379 ms of which 4 ms to minimize.
[2024-06-01 17:20:16] [INFO ] Deduced a trap composed of 102 places in 475 ms of which 6 ms to minimize.
[2024-06-01 17:20:16] [INFO ] Deduced a trap composed of 99 places in 406 ms of which 5 ms to minimize.
[2024-06-01 17:20:16] [INFO ] Deduced a trap composed of 107 places in 435 ms of which 6 ms to minimize.
[2024-06-01 17:20:17] [INFO ] Deduced a trap composed of 134 places in 488 ms of which 6 ms to minimize.
[2024-06-01 17:20:17] [INFO ] Deduced a trap composed of 139 places in 509 ms of which 6 ms to minimize.
[2024-06-01 17:20:18] [INFO ] Deduced a trap composed of 133 places in 508 ms of which 6 ms to minimize.
[2024-06-01 17:20:18] [INFO ] Deduced a trap composed of 96 places in 468 ms of which 6 ms to minimize.
[2024-06-01 17:20:19] [INFO ] Deduced a trap composed of 69 places in 392 ms of which 5 ms to minimize.
[2024-06-01 17:20:19] [INFO ] Deduced a trap composed of 87 places in 471 ms of which 5 ms to minimize.
[2024-06-01 17:20:20] [INFO ] Deduced a trap composed of 78 places in 463 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-06-01 17:20:25] [INFO ] Deduced a trap composed of 47 places in 499 ms of which 6 ms to minimize.
[2024-06-01 17:20:25] [INFO ] Deduced a trap composed of 84 places in 499 ms of which 5 ms to minimize.
[2024-06-01 17:20:26] [INFO ] Deduced a trap composed of 94 places in 473 ms of which 6 ms to minimize.
[2024-06-01 17:20:26] [INFO ] Deduced a trap composed of 105 places in 500 ms of which 5 ms to minimize.
[2024-06-01 17:20:30] [INFO ] Deduced a trap composed of 105 places in 496 ms of which 6 ms to minimize.
[2024-06-01 17:20:30] [INFO ] Deduced a trap composed of 58 places in 512 ms of which 6 ms to minimize.
[2024-06-01 17:20:31] [INFO ] Deduced a trap composed of 70 places in 484 ms of which 5 ms to minimize.
[2024-06-01 17:20:31] [INFO ] Deduced a trap composed of 95 places in 491 ms of which 5 ms to minimize.
[2024-06-01 17:20:32] [INFO ] Deduced a trap composed of 113 places in 475 ms of which 6 ms to minimize.
[2024-06-01 17:20:32] [INFO ] Deduced a trap composed of 96 places in 509 ms of which 6 ms to minimize.
SMT process timed out in 61381ms, After SMT, problems are : Problem set: 0 solved, 768 unsolved
Search for dead transitions found 0 dead transitions in 61389ms
Starting structural reductions in SI_LTL mode, iteration 1 : 354/650 places, 780/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64065 ms. Remains : 354/650 places, 780/1516 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p2) (NOT p1)), true, p2, (NOT p2), (AND (NOT p1) p2)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 348 ms.
Product exploration explored 100000 steps with 0 reset in 491 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 132 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[true, true, p2, (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 32005 steps (6 resets) in 51 ms. (615 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2)]
Property proved to be false thanks to negative knowledge :(F p2)
Knowledge based reduction with 15 factoid took 219 ms. Reduced automaton from 4 states, 8 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-12-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-12-LTLFireability-08 finished in 65777 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(F(p0))||G(p1))))'
Support contains 4 out of 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 650 transition count 1373
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 507 transition count 1373
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 286 place count 507 transition count 1241
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 550 place count 375 transition count 1241
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 575 place count 350 transition count 732
Iterating global reduction 2 with 25 rules applied. Total rules applied 600 place count 350 transition count 732
Applied a total of 600 rules in 69 ms. Remains 350 /650 variables (removed 300) and now considering 732/1516 (removed 784) transitions.
// Phase 1: matrix 732 rows 350 cols
[2024-06-01 17:20:34] [INFO ] Computed 26 invariants in 8 ms
[2024-06-01 17:20:35] [INFO ] Implicit Places using invariants in 784 ms returned []
[2024-06-01 17:20:35] [INFO ] Invariant cache hit.
[2024-06-01 17:20:35] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-01 17:20:37] [INFO ] Implicit Places using invariants and state equation in 2021 ms returned []
Implicit Place search using SMT with State Equation took 2808 ms to find 0 implicit places.
[2024-06-01 17:20:37] [INFO ] Redundant transitions in 6 ms returned []
Running 720 sub problems to find dead transitions.
[2024-06-01 17:20:37] [INFO ] Invariant cache hit.
[2024-06-01 17:20:37] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 17:20:48] [INFO ] Deduced a trap composed of 67 places in 475 ms of which 6 ms to minimize.
[2024-06-01 17:20:52] [INFO ] Deduced a trap composed of 112 places in 497 ms of which 6 ms to minimize.
[2024-06-01 17:20:52] [INFO ] Deduced a trap composed of 126 places in 493 ms of which 6 ms to minimize.
[2024-06-01 17:20:53] [INFO ] Deduced a trap composed of 121 places in 469 ms of which 5 ms to minimize.
[2024-06-01 17:20:53] [INFO ] Deduced a trap composed of 170 places in 484 ms of which 5 ms to minimize.
[2024-06-01 17:20:54] [INFO ] Deduced a trap composed of 117 places in 398 ms of which 6 ms to minimize.
[2024-06-01 17:20:54] [INFO ] Deduced a trap composed of 83 places in 484 ms of which 6 ms to minimize.
[2024-06-01 17:20:55] [INFO ] Deduced a trap composed of 89 places in 464 ms of which 5 ms to minimize.
[2024-06-01 17:20:55] [INFO ] Deduced a trap composed of 86 places in 471 ms of which 5 ms to minimize.
[2024-06-01 17:20:56] [INFO ] Deduced a trap composed of 94 places in 478 ms of which 5 ms to minimize.
[2024-06-01 17:20:56] [INFO ] Deduced a trap composed of 136 places in 483 ms of which 7 ms to minimize.
[2024-06-01 17:20:57] [INFO ] Deduced a trap composed of 127 places in 480 ms of which 6 ms to minimize.
[2024-06-01 17:20:57] [INFO ] Deduced a trap composed of 79 places in 472 ms of which 6 ms to minimize.
[2024-06-01 17:20:58] [INFO ] Deduced a trap composed of 90 places in 486 ms of which 5 ms to minimize.
[2024-06-01 17:20:58] [INFO ] Deduced a trap composed of 109 places in 474 ms of which 6 ms to minimize.
[2024-06-01 17:20:59] [INFO ] Deduced a trap composed of 119 places in 405 ms of which 6 ms to minimize.
[2024-06-01 17:20:59] [INFO ] Deduced a trap composed of 119 places in 474 ms of which 6 ms to minimize.
[2024-06-01 17:21:00] [INFO ] Deduced a trap composed of 111 places in 492 ms of which 6 ms to minimize.
[2024-06-01 17:21:00] [INFO ] Deduced a trap composed of 117 places in 485 ms of which 5 ms to minimize.
[2024-06-01 17:21:01] [INFO ] Deduced a trap composed of 115 places in 400 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 17:21:04] [INFO ] Deduced a trap composed of 59 places in 467 ms of which 5 ms to minimize.
[2024-06-01 17:21:07] [INFO ] Deduced a trap composed of 136 places in 484 ms of which 5 ms to minimize.
[2024-06-01 17:21:08] [INFO ] Deduced a trap composed of 124 places in 477 ms of which 6 ms to minimize.
SMT process timed out in 30796ms, After SMT, problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 30804ms
Starting structural reductions in SI_LTL mode, iteration 1 : 350/650 places, 732/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33696 ms. Remains : 350/650 places, 732/1516 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-12-LTLFireability-09
Product exploration explored 100000 steps with 33 reset in 367 ms.
Stack based approach found an accepted trace after 124 steps with 1 reset with depth 59 and stack size 59 in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-09 finished in 34204 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((X(p0)||(p1 U (G(!p2) U (p3 U p0))))))'
Support contains 2 out of 650 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 650 transition count 1422
Reduce places removed 94 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 118 rules applied. Total rules applied 212 place count 556 transition count 1398
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 236 place count 532 transition count 1398
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 131 Pre rules applied. Total rules applied 236 place count 532 transition count 1267
Deduced a syphon composed of 131 places in 1 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 498 place count 401 transition count 1267
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 522 place count 377 transition count 781
Iterating global reduction 3 with 24 rules applied. Total rules applied 546 place count 377 transition count 781
Applied a total of 546 rules in 88 ms. Remains 377 /650 variables (removed 273) and now considering 781/1516 (removed 735) transitions.
// Phase 1: matrix 781 rows 377 cols
[2024-06-01 17:21:08] [INFO ] Computed 26 invariants in 9 ms
[2024-06-01 17:21:09] [INFO ] Implicit Places using invariants in 680 ms returned []
[2024-06-01 17:21:09] [INFO ] Invariant cache hit.
[2024-06-01 17:21:09] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-01 17:21:12] [INFO ] Implicit Places using invariants and state equation in 2760 ms returned []
Implicit Place search using SMT with State Equation took 3446 ms to find 0 implicit places.
[2024-06-01 17:21:12] [INFO ] Redundant transitions in 11 ms returned []
Running 769 sub problems to find dead transitions.
[2024-06-01 17:21:12] [INFO ] Invariant cache hit.
[2024-06-01 17:21:12] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 769 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/377 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 769 unsolved
[2024-06-01 17:21:24] [INFO ] Deduced a trap composed of 117 places in 522 ms of which 7 ms to minimize.
[2024-06-01 17:21:25] [INFO ] Deduced a trap composed of 101 places in 506 ms of which 6 ms to minimize.
[2024-06-01 17:21:31] [INFO ] Deduced a trap composed of 113 places in 507 ms of which 6 ms to minimize.
[2024-06-01 17:21:31] [INFO ] Deduced a trap composed of 85 places in 508 ms of which 6 ms to minimize.
[2024-06-01 17:21:32] [INFO ] Deduced a trap composed of 103 places in 499 ms of which 7 ms to minimize.
[2024-06-01 17:21:33] [INFO ] Deduced a trap composed of 92 places in 511 ms of which 5 ms to minimize.
[2024-06-01 17:21:33] [INFO ] Deduced a trap composed of 96 places in 521 ms of which 6 ms to minimize.
[2024-06-01 17:21:34] [INFO ] Deduced a trap composed of 99 places in 515 ms of which 6 ms to minimize.
[2024-06-01 17:21:34] [INFO ] Deduced a trap composed of 102 places in 530 ms of which 6 ms to minimize.
[2024-06-01 17:21:35] [INFO ] Deduced a trap composed of 123 places in 550 ms of which 6 ms to minimize.
[2024-06-01 17:21:36] [INFO ] Deduced a trap composed of 96 places in 510 ms of which 6 ms to minimize.
[2024-06-01 17:21:36] [INFO ] Deduced a trap composed of 68 places in 517 ms of which 7 ms to minimize.
[2024-06-01 17:21:37] [INFO ] Deduced a trap composed of 123 places in 517 ms of which 6 ms to minimize.
[2024-06-01 17:21:37] [INFO ] Deduced a trap composed of 158 places in 526 ms of which 7 ms to minimize.
[2024-06-01 17:21:38] [INFO ] Deduced a trap composed of 146 places in 540 ms of which 7 ms to minimize.
[2024-06-01 17:21:38] [INFO ] Deduced a trap composed of 100 places in 548 ms of which 6 ms to minimize.
[2024-06-01 17:21:39] [INFO ] Deduced a trap composed of 110 places in 449 ms of which 6 ms to minimize.
[2024-06-01 17:21:39] [INFO ] Deduced a trap composed of 142 places in 509 ms of which 6 ms to minimize.
[2024-06-01 17:21:40] [INFO ] Deduced a trap composed of 135 places in 496 ms of which 6 ms to minimize.
[2024-06-01 17:21:41] [INFO ] Deduced a trap composed of 135 places in 506 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 769 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 377/1158 variables, and 46 constraints, problems are : Problem set: 0 solved, 769 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/377 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 769/769 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 769 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 769 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/377 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 769 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 769 unsolved
[2024-06-01 17:21:47] [INFO ] Deduced a trap composed of 87 places in 463 ms of which 4 ms to minimize.
[2024-06-01 17:21:47] [INFO ] Deduced a trap composed of 73 places in 505 ms of which 6 ms to minimize.
[2024-06-01 17:21:48] [INFO ] Deduced a trap composed of 66 places in 499 ms of which 6 ms to minimize.
[2024-06-01 17:21:48] [INFO ] Deduced a trap composed of 84 places in 516 ms of which 6 ms to minimize.
[2024-06-01 17:21:49] [INFO ] Deduced a trap composed of 63 places in 500 ms of which 6 ms to minimize.
[2024-06-01 17:21:49] [INFO ] Deduced a trap composed of 61 places in 506 ms of which 7 ms to minimize.
[2024-06-01 17:21:50] [INFO ] Deduced a trap composed of 94 places in 496 ms of which 6 ms to minimize.
[2024-06-01 17:21:50] [INFO ] Deduced a trap composed of 74 places in 534 ms of which 6 ms to minimize.
[2024-06-01 17:21:51] [INFO ] Deduced a trap composed of 55 places in 521 ms of which 6 ms to minimize.
[2024-06-01 17:21:52] [INFO ] Deduced a trap composed of 52 places in 508 ms of which 6 ms to minimize.
[2024-06-01 17:21:52] [INFO ] Deduced a trap composed of 126 places in 521 ms of which 7 ms to minimize.
[2024-06-01 17:21:53] [INFO ] Deduced a trap composed of 106 places in 503 ms of which 6 ms to minimize.
[2024-06-01 17:21:53] [INFO ] Deduced a trap composed of 104 places in 519 ms of which 6 ms to minimize.
[2024-06-01 17:21:54] [INFO ] Deduced a trap composed of 85 places in 509 ms of which 5 ms to minimize.
[2024-06-01 17:21:54] [INFO ] Deduced a trap composed of 103 places in 535 ms of which 6 ms to minimize.
[2024-06-01 17:21:55] [INFO ] Deduced a trap composed of 104 places in 505 ms of which 6 ms to minimize.
[2024-06-01 17:21:55] [INFO ] Deduced a trap composed of 104 places in 533 ms of which 7 ms to minimize.
[2024-06-01 17:21:56] [INFO ] Deduced a trap composed of 113 places in 509 ms of which 6 ms to minimize.
[2024-06-01 17:21:57] [INFO ] Deduced a trap composed of 70 places in 518 ms of which 6 ms to minimize.
[2024-06-01 17:21:57] [INFO ] Deduced a trap composed of 113 places in 517 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 769 unsolved
[2024-06-01 17:22:00] [INFO ] Deduced a trap composed of 65 places in 513 ms of which 6 ms to minimize.
[2024-06-01 17:22:01] [INFO ] Deduced a trap composed of 98 places in 525 ms of which 6 ms to minimize.
[2024-06-01 17:22:07] [INFO ] Deduced a trap composed of 70 places in 464 ms of which 6 ms to minimize.
[2024-06-01 17:22:09] [INFO ] Deduced a trap composed of 153 places in 514 ms of which 6 ms to minimize.
[2024-06-01 17:22:10] [INFO ] Deduced a trap composed of 59 places in 505 ms of which 6 ms to minimize.
[2024-06-01 17:22:11] [INFO ] Deduced a trap composed of 76 places in 522 ms of which 6 ms to minimize.
[2024-06-01 17:22:12] [INFO ] Deduced a trap composed of 56 places in 538 ms of which 11 ms to minimize.
[2024-06-01 17:22:13] [INFO ] Deduced a trap composed of 97 places in 532 ms of which 7 ms to minimize.
SMT process timed out in 61502ms, After SMT, problems are : Problem set: 0 solved, 769 unsolved
Search for dead transitions found 0 dead transitions in 61515ms
Starting structural reductions in SI_LTL mode, iteration 1 : 377/650 places, 781/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65071 ms. Remains : 377/650 places, 781/1516 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-10
Product exploration explored 100000 steps with 28 reset in 333 ms.
Stack based approach found an accepted trace after 129 steps with 0 reset with depth 130 and stack size 130 in 2 ms.
FORMULA Anderson-PT-12-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-10 finished in 65501 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 3 out of 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 650 transition count 1396
Reduce places removed 120 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 132 rules applied. Total rules applied 252 place count 530 transition count 1384
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 264 place count 518 transition count 1384
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 131 Pre rules applied. Total rules applied 264 place count 518 transition count 1253
Deduced a syphon composed of 131 places in 1 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 526 place count 387 transition count 1253
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 551 place count 362 transition count 722
Iterating global reduction 3 with 25 rules applied. Total rules applied 576 place count 362 transition count 722
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 578 place count 361 transition count 721
Applied a total of 578 rules in 92 ms. Remains 361 /650 variables (removed 289) and now considering 721/1516 (removed 795) transitions.
// Phase 1: matrix 721 rows 361 cols
[2024-06-01 17:22:14] [INFO ] Computed 26 invariants in 9 ms
[2024-06-01 17:22:15] [INFO ] Implicit Places using invariants in 819 ms returned []
[2024-06-01 17:22:15] [INFO ] Invariant cache hit.
[2024-06-01 17:22:15] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-01 17:22:17] [INFO ] Implicit Places using invariants and state equation in 2863 ms returned []
Implicit Place search using SMT with State Equation took 3687 ms to find 0 implicit places.
[2024-06-01 17:22:17] [INFO ] Redundant transitions in 10 ms returned []
Running 709 sub problems to find dead transitions.
[2024-06-01 17:22:17] [INFO ] Invariant cache hit.
[2024-06-01 17:22:17] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 709 unsolved
[2024-06-01 17:22:33] [INFO ] Deduced a trap composed of 114 places in 510 ms of which 6 ms to minimize.
[2024-06-01 17:22:34] [INFO ] Deduced a trap composed of 117 places in 521 ms of which 6 ms to minimize.
[2024-06-01 17:22:35] [INFO ] Deduced a trap composed of 94 places in 484 ms of which 5 ms to minimize.
[2024-06-01 17:22:35] [INFO ] Deduced a trap composed of 91 places in 470 ms of which 5 ms to minimize.
[2024-06-01 17:22:37] [INFO ] Deduced a trap composed of 66 places in 509 ms of which 6 ms to minimize.
[2024-06-01 17:22:39] [INFO ] Deduced a trap composed of 141 places in 488 ms of which 6 ms to minimize.
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 94 places in 481 ms of which 6 ms to minimize.
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 114 places in 492 ms of which 5 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 144 places in 483 ms of which 6 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 86 places in 485 ms of which 6 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 117 places in 511 ms of which 6 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 95 places in 493 ms of which 5 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 74 places in 487 ms of which 7 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 118 places in 511 ms of which 6 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 61 places in 508 ms of which 6 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 63 places in 513 ms of which 6 ms to minimize.
[2024-06-01 17:22:45] [INFO ] Deduced a trap composed of 81 places in 450 ms of which 5 ms to minimize.
[2024-06-01 17:22:45] [INFO ] Deduced a trap composed of 62 places in 488 ms of which 6 ms to minimize.
[2024-06-01 17:22:46] [INFO ] Deduced a trap composed of 67 places in 440 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 709 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1082 variables, and 44 constraints, problems are : Problem set: 0 solved, 709 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 11/12 constraints, State Equation: 0/361 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 709/709 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 709 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 709 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/1082 variables, and 44 constraints, problems are : Problem set: 0 solved, 709 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 11/12 constraints, State Equation: 0/361 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/709 constraints, Known Traps: 19/19 constraints]
After SMT, in 61037ms problems are : Problem set: 0 solved, 709 unsolved
Search for dead transitions found 0 dead transitions in 61051ms
Starting structural reductions in SI_LTL mode, iteration 1 : 361/650 places, 721/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64851 ms. Remains : 361/650 places, 721/1516 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-11
Product exploration explored 100000 steps with 88 reset in 340 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 0 ms.
FORMULA Anderson-PT-12-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-11 finished in 65275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0&&F(((!p1&&X(!p2))||G(!p2)))))))))'
Support contains 7 out of 650 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 628 transition count 1076
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 628 transition count 1076
Applied a total of 44 rules in 42 ms. Remains 628 /650 variables (removed 22) and now considering 1076/1516 (removed 440) transitions.
// Phase 1: matrix 1076 rows 628 cols
[2024-06-01 17:23:19] [INFO ] Computed 26 invariants in 16 ms
[2024-06-01 17:23:20] [INFO ] Implicit Places using invariants in 1112 ms returned []
[2024-06-01 17:23:20] [INFO ] Invariant cache hit.
[2024-06-01 17:23:21] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-01 17:23:28] [INFO ] Implicit Places using invariants and state equation in 7856 ms returned []
Implicit Place search using SMT with State Equation took 8970 ms to find 0 implicit places.
Running 1064 sub problems to find dead transitions.
[2024-06-01 17:23:28] [INFO ] Invariant cache hit.
[2024-06-01 17:23:28] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-06-01 17:23:53] [INFO ] Deduced a trap composed of 122 places in 880 ms of which 10 ms to minimize.
[2024-06-01 17:23:55] [INFO ] Deduced a trap composed of 163 places in 876 ms of which 9 ms to minimize.
[2024-06-01 17:23:56] [INFO ] Deduced a trap composed of 223 places in 809 ms of which 9 ms to minimize.
[2024-06-01 17:23:57] [INFO ] Deduced a trap composed of 331 places in 839 ms of which 10 ms to minimize.
[2024-06-01 17:23:58] [INFO ] Deduced a trap composed of 172 places in 784 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 628/1704 variables, and 31 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/628 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-06-01 17:24:04] [INFO ] Deduced a trap composed of 97 places in 708 ms of which 10 ms to minimize.
[2024-06-01 17:24:05] [INFO ] Deduced a trap composed of 124 places in 849 ms of which 10 ms to minimize.
[2024-06-01 17:24:06] [INFO ] Deduced a trap composed of 201 places in 764 ms of which 9 ms to minimize.
[2024-06-01 17:24:07] [INFO ] Deduced a trap composed of 131 places in 851 ms of which 9 ms to minimize.
[2024-06-01 17:24:08] [INFO ] Deduced a trap composed of 186 places in 811 ms of which 9 ms to minimize.
[2024-06-01 17:24:09] [INFO ] Deduced a trap composed of 179 places in 744 ms of which 10 ms to minimize.
[2024-06-01 17:24:10] [INFO ] Deduced a trap composed of 276 places in 855 ms of which 9 ms to minimize.
[2024-06-01 17:24:10] [INFO ] Deduced a trap composed of 308 places in 876 ms of which 16 ms to minimize.
[2024-06-01 17:24:11] [INFO ] Deduced a trap composed of 281 places in 740 ms of which 9 ms to minimize.
[2024-06-01 17:24:12] [INFO ] Deduced a trap composed of 152 places in 795 ms of which 9 ms to minimize.
[2024-06-01 17:24:13] [INFO ] Deduced a trap composed of 143 places in 758 ms of which 9 ms to minimize.
[2024-06-01 17:24:14] [INFO ] Deduced a trap composed of 112 places in 779 ms of which 8 ms to minimize.
[2024-06-01 17:24:14] [INFO ] Deduced a trap composed of 246 places in 838 ms of which 9 ms to minimize.
[2024-06-01 17:24:15] [INFO ] Deduced a trap composed of 112 places in 823 ms of which 10 ms to minimize.
[2024-06-01 17:24:16] [INFO ] Deduced a trap composed of 103 places in 730 ms of which 9 ms to minimize.
[2024-06-01 17:24:17] [INFO ] Deduced a trap composed of 210 places in 794 ms of which 9 ms to minimize.
[2024-06-01 17:24:18] [INFO ] Deduced a trap composed of 309 places in 788 ms of which 8 ms to minimize.
[2024-06-01 17:24:19] [INFO ] Deduced a trap composed of 99 places in 836 ms of which 9 ms to minimize.
[2024-06-01 17:24:20] [INFO ] Deduced a trap composed of 228 places in 840 ms of which 10 ms to minimize.
[2024-06-01 17:24:21] [INFO ] Deduced a trap composed of 165 places in 824 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/628 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-06-01 17:24:25] [INFO ] Deduced a trap composed of 219 places in 789 ms of which 12 ms to minimize.
[2024-06-01 17:24:25] [INFO ] Deduced a trap composed of 110 places in 831 ms of which 10 ms to minimize.
[2024-06-01 17:24:27] [INFO ] Deduced a trap composed of 124 places in 762 ms of which 9 ms to minimize.
[2024-06-01 17:24:28] [INFO ] Deduced a trap composed of 159 places in 815 ms of which 10 ms to minimize.
[2024-06-01 17:24:29] [INFO ] Deduced a trap composed of 236 places in 839 ms of which 9 ms to minimize.
[2024-06-01 17:24:30] [INFO ] Deduced a trap composed of 272 places in 840 ms of which 10 ms to minimize.
SMT process timed out in 61667ms, After SMT, problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 61677ms
Starting structural reductions in LTL mode, iteration 1 : 628/650 places, 1076/1516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70693 ms. Remains : 628/650 places, 1076/1516 transitions.
Stuttering acceptance computed with spot in 404 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, p2]
Running random walk in product with property : Anderson-PT-12-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 376 ms.
Product exploration explored 100000 steps with 0 reset in 434 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 120 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, p2]
RANDOM walk for 40000 steps (8 resets) in 755 ms. (52 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 422 ms. (94 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 3/3 properties
[2024-06-01 17:24:32] [INFO ] Invariant cache hit.
[2024-06-01 17:24:32] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 589/596 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/617 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/617 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/617 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 6 (OVERLAPS) 11/628 variables, 11/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1076/1704 variables, 628/654 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1704 variables, 132/786 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1704 variables, 0/786 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1704 variables, 0/786 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1704/1704 variables, and 786 constraints, problems are : Problem set: 2 solved, 1 unsolved in 1043 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 628/628 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 591/593 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/616 variables, 12/14 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-01 17:24:34] [INFO ] Deduced a trap composed of 560 places in 728 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/616 variables, 1/15 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/616 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12/628 variables, 12/27 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 0/27 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1076/1704 variables, 628/655 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1704 variables, 132/787 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1704 variables, 1/788 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1704 variables, 0/788 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1704 variables, 0/788 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1704/1704 variables, and 788 constraints, problems are : Problem set: 2 solved, 1 unsolved in 2126 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 628/628 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 3199ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 13 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (G (OR (NOT p1) (NOT p2))), (G (OR (NOT p0) (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F (NOT (OR (NOT p1) p2))), (F p2), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F p1)]
Knowledge based reduction with 3 factoid took 346 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Support contains 4 out of 628 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 1076/1076 transitions.
Applied a total of 0 rules in 21 ms. Remains 628 /628 variables (removed 0) and now considering 1076/1076 (removed 0) transitions.
[2024-06-01 17:24:36] [INFO ] Invariant cache hit.
[2024-06-01 17:24:37] [INFO ] Implicit Places using invariants in 932 ms returned []
[2024-06-01 17:24:37] [INFO ] Invariant cache hit.
[2024-06-01 17:24:38] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-01 17:24:45] [INFO ] Implicit Places using invariants and state equation in 8143 ms returned []
Implicit Place search using SMT with State Equation took 9085 ms to find 0 implicit places.
Running 1064 sub problems to find dead transitions.
[2024-06-01 17:24:45] [INFO ] Invariant cache hit.
[2024-06-01 17:24:45] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-06-01 17:25:10] [INFO ] Deduced a trap composed of 122 places in 813 ms of which 10 ms to minimize.
[2024-06-01 17:25:12] [INFO ] Deduced a trap composed of 163 places in 837 ms of which 8 ms to minimize.
[2024-06-01 17:25:13] [INFO ] Deduced a trap composed of 223 places in 714 ms of which 9 ms to minimize.
[2024-06-01 17:25:14] [INFO ] Deduced a trap composed of 331 places in 767 ms of which 9 ms to minimize.
[2024-06-01 17:25:15] [INFO ] Deduced a trap composed of 172 places in 853 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 628/1704 variables, and 31 constraints, problems are : Problem set: 0 solved, 1064 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/628 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 1064/1064 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/628 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-06-01 17:25:22] [INFO ] Deduced a trap composed of 97 places in 784 ms of which 9 ms to minimize.
[2024-06-01 17:25:23] [INFO ] Deduced a trap composed of 124 places in 811 ms of which 9 ms to minimize.
[2024-06-01 17:25:24] [INFO ] Deduced a trap composed of 201 places in 842 ms of which 9 ms to minimize.
[2024-06-01 17:25:25] [INFO ] Deduced a trap composed of 131 places in 831 ms of which 9 ms to minimize.
[2024-06-01 17:25:26] [INFO ] Deduced a trap composed of 186 places in 855 ms of which 9 ms to minimize.
[2024-06-01 17:25:27] [INFO ] Deduced a trap composed of 179 places in 864 ms of which 9 ms to minimize.
[2024-06-01 17:25:28] [INFO ] Deduced a trap composed of 276 places in 765 ms of which 9 ms to minimize.
[2024-06-01 17:25:29] [INFO ] Deduced a trap composed of 308 places in 823 ms of which 9 ms to minimize.
[2024-06-01 17:25:30] [INFO ] Deduced a trap composed of 281 places in 824 ms of which 10 ms to minimize.
[2024-06-01 17:25:31] [INFO ] Deduced a trap composed of 152 places in 852 ms of which 10 ms to minimize.
[2024-06-01 17:25:31] [INFO ] Deduced a trap composed of 143 places in 805 ms of which 9 ms to minimize.
[2024-06-01 17:25:32] [INFO ] Deduced a trap composed of 112 places in 679 ms of which 9 ms to minimize.
[2024-06-01 17:25:33] [INFO ] Deduced a trap composed of 246 places in 825 ms of which 9 ms to minimize.
[2024-06-01 17:25:34] [INFO ] Deduced a trap composed of 112 places in 822 ms of which 10 ms to minimize.
[2024-06-01 17:25:35] [INFO ] Deduced a trap composed of 103 places in 840 ms of which 10 ms to minimize.
[2024-06-01 17:25:35] [INFO ] Deduced a trap composed of 210 places in 825 ms of which 9 ms to minimize.
[2024-06-01 17:25:36] [INFO ] Deduced a trap composed of 309 places in 810 ms of which 9 ms to minimize.
[2024-06-01 17:25:37] [INFO ] Deduced a trap composed of 99 places in 802 ms of which 10 ms to minimize.
[2024-06-01 17:25:39] [INFO ] Deduced a trap composed of 228 places in 874 ms of which 9 ms to minimize.
[2024-06-01 17:25:40] [INFO ] Deduced a trap composed of 165 places in 840 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/628 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 1064 unsolved
[2024-06-01 17:25:44] [INFO ] Deduced a trap composed of 219 places in 887 ms of which 9 ms to minimize.
[2024-06-01 17:25:45] [INFO ] Deduced a trap composed of 110 places in 848 ms of which 9 ms to minimize.
[2024-06-01 17:25:46] [INFO ] Deduced a trap composed of 124 places in 860 ms of which 10 ms to minimize.
[2024-06-01 17:25:47] [INFO ] Deduced a trap composed of 159 places in 812 ms of which 9 ms to minimize.
SMT process timed out in 61760ms, After SMT, problems are : Problem set: 0 solved, 1064 unsolved
Search for dead transitions found 0 dead transitions in 61771ms
Finished structural reductions in LTL mode , in 1 iterations and 70880 ms. Remains : 628/628 places, 1076/1076 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 121 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
RANDOM walk for 40000 steps (8 resets) in 871 ms. (45 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 82 ms. (481 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
[2024-06-01 17:25:48] [INFO ] Invariant cache hit.
[2024-06-01 17:25:48] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 591/593 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/616 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/616 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/628 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1076/1704 variables, 628/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1704 variables, 132/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1704 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1704 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1704/1704 variables, and 786 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1045 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 628/628 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 591/593 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/616 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:25:50] [INFO ] Deduced a trap composed of 560 places in 819 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/616 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/616 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12/628 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1076/1704 variables, 628/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1704 variables, 132/787 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1704 variables, 1/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1704 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1704 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1704/1704 variables, and 788 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2492 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 628/628 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 3558ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p2))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 1 factoid took 269 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Product exploration explored 100000 steps with 0 reset in 354 ms.
Product exploration explored 100000 steps with 0 reset in 404 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, p2]
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 628/628 places, 1076/1076 transitions.
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 628 transition count 1076
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 132 Pre rules applied. Total rules applied 142 place count 628 transition count 1076
Deduced a syphon composed of 274 places in 1 ms
Iterating global reduction 1 with 132 rules applied. Total rules applied 274 place count 628 transition count 1076
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 276 place count 626 transition count 1030
Deduced a syphon composed of 274 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 278 place count 626 transition count 1030
Deduced a syphon composed of 274 places in 1 ms
Applied a total of 278 rules in 169 ms. Remains 626 /628 variables (removed 2) and now considering 1030/1076 (removed 46) transitions.
[2024-06-01 17:25:54] [INFO ] Redundant transitions in 19 ms returned []
Running 1018 sub problems to find dead transitions.
// Phase 1: matrix 1030 rows 626 cols
[2024-06-01 17:25:54] [INFO ] Computed 26 invariants in 22 ms
[2024-06-01 17:25:54] [INFO ] State equation strengthened by 252 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
[2024-06-01 17:26:17] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 4 ms to minimize.
[2024-06-01 17:26:17] [INFO ] Deduced a trap composed of 28 places in 196 ms of which 4 ms to minimize.
[2024-06-01 17:26:17] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 3 ms to minimize.
[2024-06-01 17:26:18] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 4 ms to minimize.
[2024-06-01 17:26:18] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 2 ms to minimize.
[2024-06-01 17:26:18] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-06-01 17:26:19] [INFO ] Deduced a trap composed of 97 places in 767 ms of which 9 ms to minimize.
[2024-06-01 17:26:19] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-06-01 17:26:20] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-01 17:26:20] [INFO ] Deduced a trap composed of 93 places in 730 ms of which 9 ms to minimize.
[2024-06-01 17:26:21] [INFO ] Deduced a trap composed of 82 places in 694 ms of which 8 ms to minimize.
[2024-06-01 17:26:22] [INFO ] Deduced a trap composed of 26 places in 627 ms of which 8 ms to minimize.
[2024-06-01 17:26:23] [INFO ] Deduced a trap composed of 30 places in 668 ms of which 9 ms to minimize.
[2024-06-01 17:26:23] [INFO ] Deduced a trap composed of 40 places in 738 ms of which 9 ms to minimize.
[2024-06-01 17:26:24] [INFO ] Deduced a trap composed of 69 places in 639 ms of which 9 ms to minimize.
[2024-06-01 17:26:25] [INFO ] Deduced a trap composed of 24 places in 702 ms of which 9 ms to minimize.
[2024-06-01 17:26:26] [INFO ] Deduced a trap composed of 26 places in 753 ms of which 9 ms to minimize.
SMT process timed out in 31472ms, After SMT, problems are : Problem set: 0 solved, 1018 unsolved
Search for dead transitions found 0 dead transitions in 31489ms
Starting structural reductions in SI_LTL mode, iteration 1 : 626/628 places, 1030/1076 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31690 ms. Remains : 626/628 places, 1030/1076 transitions.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 1076/1076 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 626 transition count 1030
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 626 transition count 1030
Applied a total of 4 rules in 48 ms. Remains 626 /628 variables (removed 2) and now considering 1030/1076 (removed 46) transitions.
// Phase 1: matrix 1030 rows 626 cols
[2024-06-01 17:26:26] [INFO ] Computed 26 invariants in 20 ms
[2024-06-01 17:26:27] [INFO ] Implicit Places using invariants in 1038 ms returned []
[2024-06-01 17:26:27] [INFO ] Invariant cache hit.
[2024-06-01 17:26:28] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-01 17:26:33] [INFO ] Implicit Places using invariants and state equation in 5879 ms returned []
Implicit Place search using SMT with State Equation took 6918 ms to find 0 implicit places.
Running 1018 sub problems to find dead transitions.
[2024-06-01 17:26:33] [INFO ] Invariant cache hit.
[2024-06-01 17:26:33] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
[2024-06-01 17:26:59] [INFO ] Deduced a trap composed of 227 places in 851 ms of which 10 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 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 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1656 variables, and 27 constraints, problems are : Problem set: 0 solved, 1018 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/626 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 1018/1018 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1018 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/626 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
[2024-06-01 17:27:09] [INFO ] Deduced a trap composed of 141 places in 844 ms of which 9 ms to minimize.
[2024-06-01 17:27:10] [INFO ] Deduced a trap composed of 312 places in 773 ms of which 11 ms to minimize.
[2024-06-01 17:27:11] [INFO ] Deduced a trap composed of 252 places in 781 ms of which 8 ms to minimize.
[2024-06-01 17:27:12] [INFO ] Deduced a trap composed of 299 places in 843 ms of which 11 ms to minimize.
[2024-06-01 17:27:13] [INFO ] Deduced a trap composed of 301 places in 859 ms of which 9 ms to minimize.
[2024-06-01 17:27:13] [INFO ] Deduced a trap composed of 369 places in 852 ms of which 9 ms to minimize.
[2024-06-01 17:27:14] [INFO ] Deduced a trap composed of 266 places in 843 ms of which 11 ms to minimize.
[2024-06-01 17:27:15] [INFO ] Deduced a trap composed of 218 places in 873 ms of which 10 ms to minimize.
[2024-06-01 17:27:16] [INFO ] Deduced a trap composed of 236 places in 844 ms of which 9 ms to minimize.
[2024-06-01 17:27:17] [INFO ] Deduced a trap composed of 347 places in 832 ms of which 10 ms to minimize.
[2024-06-01 17:27:18] [INFO ] Deduced a trap composed of 277 places in 852 ms of which 9 ms to minimize.
[2024-06-01 17:27:19] [INFO ] Deduced a trap composed of 163 places in 847 ms of which 9 ms to minimize.
[2024-06-01 17:27:19] [INFO ] Deduced a trap composed of 340 places in 833 ms of which 9 ms to minimize.
[2024-06-01 17:27:20] [INFO ] Deduced a trap composed of 370 places in 835 ms of which 9 ms to minimize.
[2024-06-01 17:27:21] [INFO ] Deduced a trap composed of 195 places in 696 ms of which 9 ms to minimize.
[2024-06-01 17:27:25] [INFO ] Deduced a trap composed of 108 places in 808 ms of which 10 ms to minimize.
[2024-06-01 17:27:25] [INFO ] Deduced a trap composed of 94 places in 831 ms of which 10 ms to minimize.
[2024-06-01 17:27:26] [INFO ] Deduced a trap composed of 207 places in 717 ms of which 9 ms to minimize.
[2024-06-01 17:27:27] [INFO ] Deduced a trap composed of 278 places in 790 ms of which 9 ms to minimize.
[2024-06-01 17:27:28] [INFO ] Deduced a trap composed of 206 places in 810 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/626 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 1018 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/1656 variables, and 47 constraints, problems are : Problem set: 0 solved, 1018 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/626 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/1018 constraints, Known Traps: 21/21 constraints]
After SMT, in 60975ms problems are : Problem set: 0 solved, 1018 unsolved
Search for dead transitions found 0 dead transitions in 60987ms
Starting structural reductions in LTL mode, iteration 1 : 626/628 places, 1030/1076 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67957 ms. Remains : 626/628 places, 1030/1076 transitions.
Treatment of property Anderson-PT-12-LTLFireability-12 finished in 255058 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&&G(F(((p2 U p3)&&p1))))))'
Support contains 5 out of 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 650 transition count 1374
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 508 transition count 1374
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 131 Pre rules applied. Total rules applied 284 place count 508 transition count 1243
Deduced a syphon composed of 131 places in 0 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 262 rules applied. Total rules applied 546 place count 377 transition count 1243
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 569 place count 354 transition count 758
Iterating global reduction 2 with 23 rules applied. Total rules applied 592 place count 354 transition count 758
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 594 place count 353 transition count 757
Applied a total of 594 rules in 71 ms. Remains 353 /650 variables (removed 297) and now considering 757/1516 (removed 759) transitions.
// Phase 1: matrix 757 rows 353 cols
[2024-06-01 17:27:34] [INFO ] Computed 26 invariants in 11 ms
[2024-06-01 17:27:35] [INFO ] Implicit Places using invariants in 520 ms returned []
[2024-06-01 17:27:35] [INFO ] Invariant cache hit.
[2024-06-01 17:27:35] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-01 17:27:37] [INFO ] Implicit Places using invariants and state equation in 2693 ms returned []
Implicit Place search using SMT with State Equation took 3225 ms to find 0 implicit places.
[2024-06-01 17:27:37] [INFO ] Redundant transitions in 10 ms returned []
Running 745 sub problems to find dead transitions.
[2024-06-01 17:27:37] [INFO ] Invariant cache hit.
[2024-06-01 17:27:37] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-06-01 17:27:50] [INFO ] Deduced a trap composed of 136 places in 511 ms of which 6 ms to minimize.
[2024-06-01 17:27:51] [INFO ] Deduced a trap composed of 127 places in 476 ms of which 5 ms to minimize.
[2024-06-01 17:27:51] [INFO ] Deduced a trap composed of 104 places in 484 ms of which 6 ms to minimize.
[2024-06-01 17:27:52] [INFO ] Deduced a trap composed of 92 places in 493 ms of which 6 ms to minimize.
[2024-06-01 17:27:52] [INFO ] Deduced a trap composed of 108 places in 509 ms of which 5 ms to minimize.
[2024-06-01 17:27:53] [INFO ] Deduced a trap composed of 96 places in 511 ms of which 6 ms to minimize.
[2024-06-01 17:27:53] [INFO ] Deduced a trap composed of 104 places in 489 ms of which 6 ms to minimize.
[2024-06-01 17:27:54] [INFO ] Deduced a trap composed of 70 places in 491 ms of which 6 ms to minimize.
[2024-06-01 17:27:58] [INFO ] Deduced a trap composed of 111 places in 536 ms of which 7 ms to minimize.
[2024-06-01 17:27:59] [INFO ] Deduced a trap composed of 116 places in 460 ms of which 5 ms to minimize.
[2024-06-01 17:27:59] [INFO ] Deduced a trap composed of 111 places in 465 ms of which 6 ms to minimize.
[2024-06-01 17:28:00] [INFO ] Deduced a trap composed of 159 places in 420 ms of which 6 ms to minimize.
[2024-06-01 17:28:00] [INFO ] Deduced a trap composed of 133 places in 496 ms of which 5 ms to minimize.
[2024-06-01 17:28:01] [INFO ] Deduced a trap composed of 165 places in 494 ms of which 6 ms to minimize.
[2024-06-01 17:28:01] [INFO ] Deduced a trap composed of 147 places in 502 ms of which 6 ms to minimize.
[2024-06-01 17:28:02] [INFO ] Deduced a trap composed of 155 places in 491 ms of which 5 ms to minimize.
[2024-06-01 17:28:02] [INFO ] Deduced a trap composed of 159 places in 490 ms of which 6 ms to minimize.
[2024-06-01 17:28:03] [INFO ] Deduced a trap composed of 158 places in 432 ms of which 5 ms to minimize.
[2024-06-01 17:28:03] [INFO ] Deduced a trap composed of 158 places in 512 ms of which 5 ms to minimize.
[2024-06-01 17:28:04] [INFO ] Deduced a trap composed of 199 places in 418 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 745 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 353/1110 variables, and 46 constraints, problems are : Problem set: 0 solved, 745 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/353 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 745/745 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 745 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 745 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/1110 variables, and 46 constraints, problems are : Problem set: 0 solved, 745 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/353 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/745 constraints, Known Traps: 20/20 constraints]
After SMT, in 61302ms problems are : Problem set: 0 solved, 745 unsolved
Search for dead transitions found 0 dead transitions in 61315ms
Starting structural reductions in SI_LTL mode, iteration 1 : 353/650 places, 757/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64635 ms. Remains : 353/650 places, 757/1516 transitions.
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p1) (NOT p3) (NOT p0)), (OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (NOT p0), (NOT p3)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 344 ms.
Stack based approach found an accepted trace after 57 steps with 0 reset with depth 58 and stack size 58 in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-13 finished in 65349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 1516/1516 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 650 transition count 1373
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 507 transition count 1373
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 286 place count 507 transition count 1241
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 550 place count 375 transition count 1241
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 575 place count 350 transition count 732
Iterating global reduction 2 with 25 rules applied. Total rules applied 600 place count 350 transition count 732
Applied a total of 600 rules in 55 ms. Remains 350 /650 variables (removed 300) and now considering 732/1516 (removed 784) transitions.
// Phase 1: matrix 732 rows 350 cols
[2024-06-01 17:28:39] [INFO ] Computed 26 invariants in 12 ms
[2024-06-01 17:28:40] [INFO ] Implicit Places using invariants in 817 ms returned []
[2024-06-01 17:28:40] [INFO ] Invariant cache hit.
[2024-06-01 17:28:41] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-01 17:28:43] [INFO ] Implicit Places using invariants and state equation in 2814 ms returned []
Implicit Place search using SMT with State Equation took 3642 ms to find 0 implicit places.
[2024-06-01 17:28:43] [INFO ] Redundant transitions in 10 ms returned []
Running 720 sub problems to find dead transitions.
[2024-06-01 17:28:43] [INFO ] Invariant cache hit.
[2024-06-01 17:28:43] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 17:28:58] [INFO ] Deduced a trap composed of 93 places in 489 ms of which 6 ms to minimize.
[2024-06-01 17:28:58] [INFO ] Deduced a trap composed of 47 places in 496 ms of which 5 ms to minimize.
[2024-06-01 17:28:59] [INFO ] Deduced a trap composed of 103 places in 463 ms of which 5 ms to minimize.
[2024-06-01 17:29:00] [INFO ] Deduced a trap composed of 143 places in 490 ms of which 6 ms to minimize.
[2024-06-01 17:29:01] [INFO ] Deduced a trap composed of 125 places in 450 ms of which 5 ms to minimize.
[2024-06-01 17:29:01] [INFO ] Deduced a trap composed of 101 places in 511 ms of which 5 ms to minimize.
[2024-06-01 17:29:02] [INFO ] Deduced a trap composed of 116 places in 484 ms of which 5 ms to minimize.
[2024-06-01 17:29:02] [INFO ] Deduced a trap composed of 100 places in 500 ms of which 6 ms to minimize.
[2024-06-01 17:29:03] [INFO ] Deduced a trap composed of 89 places in 495 ms of which 6 ms to minimize.
[2024-06-01 17:29:03] [INFO ] Deduced a trap composed of 114 places in 492 ms of which 6 ms to minimize.
[2024-06-01 17:29:04] [INFO ] Deduced a trap composed of 118 places in 466 ms of which 5 ms to minimize.
[2024-06-01 17:29:04] [INFO ] Deduced a trap composed of 119 places in 490 ms of which 5 ms to minimize.
[2024-06-01 17:29:05] [INFO ] Deduced a trap composed of 91 places in 479 ms of which 6 ms to minimize.
[2024-06-01 17:29:05] [INFO ] Deduced a trap composed of 105 places in 513 ms of which 6 ms to minimize.
[2024-06-01 17:29:06] [INFO ] Deduced a trap composed of 125 places in 485 ms of which 5 ms to minimize.
[2024-06-01 17:29:06] [INFO ] Deduced a trap composed of 101 places in 490 ms of which 6 ms to minimize.
[2024-06-01 17:29:07] [INFO ] Deduced a trap composed of 113 places in 476 ms of which 6 ms to minimize.
[2024-06-01 17:29:07] [INFO ] Deduced a trap composed of 103 places in 500 ms of which 5 ms to minimize.
[2024-06-01 17:29:08] [INFO ] Deduced a trap composed of 126 places in 489 ms of which 6 ms to minimize.
[2024-06-01 17:29:08] [INFO ] Deduced a trap composed of 139 places in 491 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1082 variables, and 46 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/350 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 720/720 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/1082 variables, and 46 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/350 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/720 constraints, Known Traps: 20/20 constraints]
After SMT, in 60980ms problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 60993ms
Starting structural reductions in SI_LTL mode, iteration 1 : 350/650 places, 732/1516 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64711 ms. Remains : 350/650 places, 732/1516 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 202 ms.
Product exploration explored 100000 steps with 0 reset in 235 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 676942 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :0 out of 1
Probabilistic random walk after 676942 steps, saw 524928 distinct states, run finished after 3001 ms. (steps per millisecond=225 ) properties seen :0
[2024-06-01 17:29:48] [INFO ] Invariant cache hit.
[2024-06-01 17:29:48] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 313/315 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/338 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 732/1082 variables, 350/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1082 variables, 132/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1082 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1082 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1082/1082 variables, and 508 constraints, problems are : Problem set: 0 solved, 1 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 350/350 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 313/315 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/338 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 732/1082 variables, 350/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1082 variables, 132/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1082 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1082 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1082 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1082/1082 variables, and 509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 670 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 350/350 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1029ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 732/732 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 731
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 349 transition count 731
Applied a total of 2 rules in 26 ms. Remains 349 /350 variables (removed 1) and now considering 731/732 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 349/350 places, 731/732 transitions.
RANDOM walk for 40000 steps (8 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 786768 steps, run timeout after 3001 ms. (steps per millisecond=262 ) properties seen :0 out of 1
Probabilistic random walk after 786768 steps, saw 606901 distinct states, run finished after 3001 ms. (steps per millisecond=262 ) properties seen :0
// Phase 1: matrix 731 rows 349 cols
[2024-06-01 17:29:52] [INFO ] Computed 26 invariants in 5 ms
[2024-06-01 17:29:52] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 312/314 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/325 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/348 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/349 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 731/1080 variables, 349/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1080 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1080/1080 variables, and 507 constraints, problems are : Problem set: 0 solved, 1 unsolved in 576 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 349/349 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 312/314 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/325 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/348 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/349 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 731/1080 variables, 349/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1080 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1080 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1080/1080 variables, and 508 constraints, problems are : Problem set: 0 solved, 1 unsolved in 798 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 349/349 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1389ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 731/731 transitions.
Applied a total of 0 rules in 16 ms. Remains 349 /349 variables (removed 0) and now considering 731/731 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 349/349 places, 731/731 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 731/731 transitions.
Applied a total of 0 rules in 16 ms. Remains 349 /349 variables (removed 0) and now considering 731/731 (removed 0) transitions.
[2024-06-01 17:29:53] [INFO ] Invariant cache hit.
[2024-06-01 17:29:54] [INFO ] Implicit Places using invariants in 856 ms returned []
[2024-06-01 17:29:54] [INFO ] Invariant cache hit.
[2024-06-01 17:29:55] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-01 17:29:56] [INFO ] Implicit Places using invariants and state equation in 2279 ms returned []
Implicit Place search using SMT with State Equation took 3140 ms to find 0 implicit places.
[2024-06-01 17:29:56] [INFO ] Redundant transitions in 7 ms returned []
Running 719 sub problems to find dead transitions.
[2024-06-01 17:29:56] [INFO ] Invariant cache hit.
[2024-06-01 17:29:56] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 17:30:11] [INFO ] Deduced a trap composed of 114 places in 468 ms of which 6 ms to minimize.
[2024-06-01 17:30:12] [INFO ] Deduced a trap composed of 95 places in 476 ms of which 6 ms to minimize.
[2024-06-01 17:30:12] [INFO ] Deduced a trap composed of 105 places in 472 ms of which 6 ms to minimize.
[2024-06-01 17:30:13] [INFO ] Deduced a trap composed of 84 places in 455 ms of which 6 ms to minimize.
[2024-06-01 17:30:13] [INFO ] Deduced a trap composed of 143 places in 463 ms of which 5 ms to minimize.
[2024-06-01 17:30:15] [INFO ] Deduced a trap composed of 92 places in 490 ms of which 14 ms to minimize.
[2024-06-01 17:30:15] [INFO ] Deduced a trap composed of 113 places in 507 ms of which 7 ms to minimize.
[2024-06-01 17:30:16] [INFO ] Deduced a trap composed of 104 places in 471 ms of which 6 ms to minimize.
[2024-06-01 17:30:17] [INFO ] Deduced a trap composed of 101 places in 475 ms of which 6 ms to minimize.
[2024-06-01 17:30:17] [INFO ] Deduced a trap composed of 132 places in 489 ms of which 6 ms to minimize.
[2024-06-01 17:30:18] [INFO ] Deduced a trap composed of 107 places in 477 ms of which 6 ms to minimize.
[2024-06-01 17:30:18] [INFO ] Deduced a trap composed of 125 places in 484 ms of which 5 ms to minimize.
[2024-06-01 17:30:19] [INFO ] Deduced a trap composed of 138 places in 482 ms of which 6 ms to minimize.
[2024-06-01 17:30:19] [INFO ] Deduced a trap composed of 83 places in 484 ms of which 6 ms to minimize.
[2024-06-01 17:30:20] [INFO ] Deduced a trap composed of 57 places in 468 ms of which 6 ms to minimize.
[2024-06-01 17:30:20] [INFO ] Deduced a trap composed of 97 places in 478 ms of which 5 ms to minimize.
[2024-06-01 17:30:21] [INFO ] Deduced a trap composed of 147 places in 481 ms of which 6 ms to minimize.
[2024-06-01 17:30:21] [INFO ] Deduced a trap composed of 88 places in 474 ms of which 5 ms to minimize.
[2024-06-01 17:30:22] [INFO ] Deduced a trap composed of 111 places in 483 ms of which 5 ms to minimize.
[2024-06-01 17:30:22] [INFO ] Deduced a trap composed of 109 places in 466 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 17:30:27] [INFO ] Deduced a trap composed of 127 places in 471 ms of which 6 ms to minimize.
[2024-06-01 17:30:28] [INFO ] Deduced a trap composed of 98 places in 483 ms of which 6 ms to minimize.
SMT process timed out in 31470ms, After SMT, problems are : Problem set: 0 solved, 719 unsolved
Search for dead transitions found 0 dead transitions in 31480ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34654 ms. Remains : 349/349 places, 731/731 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 144 Pre rules applied. Total rules applied 0 place count 349 transition count 587
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 0 with 288 rules applied. Total rules applied 288 place count 205 transition count 587
Applied a total of 288 rules in 22 ms. Remains 205 /349 variables (removed 144) and now considering 587/731 (removed 144) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 587 rows 205 cols
[2024-06-01 17:30:28] [INFO ] Computed 26 invariants in 6 ms
[2024-06-01 17:30:28] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 17:30:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-06-01 17:30:28] [INFO ] [Nat]Absence check using 13 positive and 13 generalized place invariants in 23 ms returned sat
[2024-06-01 17:30:29] [INFO ] After 372ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 17:30:29] [INFO ] After 455ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 17:30:29] [INFO ] After 647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 771 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 350/350 places, 732/732 transitions.
Applied a total of 0 rules in 16 ms. Remains 350 /350 variables (removed 0) and now considering 732/732 (removed 0) transitions.
// Phase 1: matrix 732 rows 350 cols
[2024-06-01 17:30:29] [INFO ] Computed 26 invariants in 8 ms
[2024-06-01 17:30:30] [INFO ] Implicit Places using invariants in 886 ms returned []
[2024-06-01 17:30:30] [INFO ] Invariant cache hit.
[2024-06-01 17:30:30] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-01 17:30:32] [INFO ] Implicit Places using invariants and state equation in 2453 ms returned []
Implicit Place search using SMT with State Equation took 3340 ms to find 0 implicit places.
[2024-06-01 17:30:32] [INFO ] Redundant transitions in 6 ms returned []
Running 720 sub problems to find dead transitions.
[2024-06-01 17:30:32] [INFO ] Invariant cache hit.
[2024-06-01 17:30:32] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 17:30:46] [INFO ] Deduced a trap composed of 93 places in 481 ms of which 5 ms to minimize.
[2024-06-01 17:30:47] [INFO ] Deduced a trap composed of 47 places in 475 ms of which 6 ms to minimize.
[2024-06-01 17:30:47] [INFO ] Deduced a trap composed of 103 places in 501 ms of which 5 ms to minimize.
[2024-06-01 17:30:49] [INFO ] Deduced a trap composed of 143 places in 509 ms of which 5 ms to minimize.
[2024-06-01 17:30:50] [INFO ] Deduced a trap composed of 125 places in 503 ms of which 13 ms to minimize.
[2024-06-01 17:30:50] [INFO ] Deduced a trap composed of 101 places in 471 ms of which 6 ms to minimize.
[2024-06-01 17:30:51] [INFO ] Deduced a trap composed of 116 places in 497 ms of which 5 ms to minimize.
[2024-06-01 17:30:51] [INFO ] Deduced a trap composed of 100 places in 496 ms of which 6 ms to minimize.
[2024-06-01 17:30:52] [INFO ] Deduced a trap composed of 89 places in 487 ms of which 5 ms to minimize.
[2024-06-01 17:30:52] [INFO ] Deduced a trap composed of 114 places in 491 ms of which 6 ms to minimize.
[2024-06-01 17:30:53] [INFO ] Deduced a trap composed of 118 places in 485 ms of which 6 ms to minimize.
[2024-06-01 17:30:53] [INFO ] Deduced a trap composed of 119 places in 496 ms of which 5 ms to minimize.
[2024-06-01 17:30:54] [INFO ] Deduced a trap composed of 91 places in 495 ms of which 7 ms to minimize.
[2024-06-01 17:30:54] [INFO ] Deduced a trap composed of 105 places in 483 ms of which 5 ms to minimize.
[2024-06-01 17:30:55] [INFO ] Deduced a trap composed of 125 places in 492 ms of which 6 ms to minimize.
[2024-06-01 17:30:55] [INFO ] Deduced a trap composed of 101 places in 482 ms of which 5 ms to minimize.
[2024-06-01 17:30:56] [INFO ] Deduced a trap composed of 113 places in 476 ms of which 6 ms to minimize.
[2024-06-01 17:30:56] [INFO ] Deduced a trap composed of 103 places in 478 ms of which 6 ms to minimize.
[2024-06-01 17:30:57] [INFO ] Deduced a trap composed of 126 places in 482 ms of which 6 ms to minimize.
[2024-06-01 17:30:57] [INFO ] Deduced a trap composed of 139 places in 483 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 720 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 350/1082 variables, and 46 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/350 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 720/720 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/1082 variables, and 46 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/350 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/720 constraints, Known Traps: 20/20 constraints]
After SMT, in 60936ms problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 60943ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64314 ms. Remains : 350/350 places, 732/732 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 756357 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :0 out of 1
Probabilistic random walk after 756357 steps, saw 584794 distinct states, run finished after 3005 ms. (steps per millisecond=251 ) properties seen :0
[2024-06-01 17:31:37] [INFO ] Invariant cache hit.
[2024-06-01 17:31:37] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 313/315 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/338 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 732/1082 variables, 350/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1082 variables, 132/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1082 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1082 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1082/1082 variables, and 508 constraints, problems are : Problem set: 0 solved, 1 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 350/350 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 313/315 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/338 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 732/1082 variables, 350/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1082 variables, 132/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1082 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1082 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1082 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1082/1082 variables, and 509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 907 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 350/350 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1409ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 732/732 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 731
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 349 transition count 731
Applied a total of 2 rules in 37 ms. Remains 349 /350 variables (removed 1) and now considering 731/732 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 349/350 places, 731/732 transitions.
RANDOM walk for 40000 steps (8 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 675604 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :0 out of 1
Probabilistic random walk after 675604 steps, saw 522684 distinct states, run finished after 3005 ms. (steps per millisecond=224 ) properties seen :0
// Phase 1: matrix 731 rows 349 cols
[2024-06-01 17:31:41] [INFO ] Computed 26 invariants in 8 ms
[2024-06-01 17:31:41] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 312/314 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/325 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/348 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/349 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 731/1080 variables, 349/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1080 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1080/1080 variables, and 507 constraints, problems are : Problem set: 0 solved, 1 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 349/349 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 312/314 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/325 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/348 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/349 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 731/1080 variables, 349/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1080 variables, 132/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1080 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1080 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1080/1080 variables, and 508 constraints, problems are : Problem set: 0 solved, 1 unsolved in 806 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 349/349 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1223ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 731/731 transitions.
Applied a total of 0 rules in 15 ms. Remains 349 /349 variables (removed 0) and now considering 731/731 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 349/349 places, 731/731 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 731/731 transitions.
Applied a total of 0 rules in 14 ms. Remains 349 /349 variables (removed 0) and now considering 731/731 (removed 0) transitions.
[2024-06-01 17:31:42] [INFO ] Invariant cache hit.
[2024-06-01 17:31:43] [INFO ] Implicit Places using invariants in 855 ms returned []
[2024-06-01 17:31:43] [INFO ] Invariant cache hit.
[2024-06-01 17:31:44] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-01 17:31:46] [INFO ] Implicit Places using invariants and state equation in 2692 ms returned []
Implicit Place search using SMT with State Equation took 3550 ms to find 0 implicit places.
[2024-06-01 17:31:46] [INFO ] Redundant transitions in 9 ms returned []
Running 719 sub problems to find dead transitions.
[2024-06-01 17:31:46] [INFO ] Invariant cache hit.
[2024-06-01 17:31:46] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 17:32:01] [INFO ] Deduced a trap composed of 114 places in 433 ms of which 5 ms to minimize.
[2024-06-01 17:32:01] [INFO ] Deduced a trap composed of 95 places in 485 ms of which 5 ms to minimize.
[2024-06-01 17:32:02] [INFO ] Deduced a trap composed of 105 places in 489 ms of which 6 ms to minimize.
[2024-06-01 17:32:02] [INFO ] Deduced a trap composed of 84 places in 491 ms of which 6 ms to minimize.
[2024-06-01 17:32:03] [INFO ] Deduced a trap composed of 143 places in 471 ms of which 6 ms to minimize.
[2024-06-01 17:32:04] [INFO ] Deduced a trap composed of 92 places in 506 ms of which 5 ms to minimize.
[2024-06-01 17:32:05] [INFO ] Deduced a trap composed of 113 places in 419 ms of which 6 ms to minimize.
[2024-06-01 17:32:06] [INFO ] Deduced a trap composed of 104 places in 506 ms of which 6 ms to minimize.
[2024-06-01 17:32:06] [INFO ] Deduced a trap composed of 101 places in 487 ms of which 6 ms to minimize.
[2024-06-01 17:32:07] [INFO ] Deduced a trap composed of 132 places in 468 ms of which 6 ms to minimize.
[2024-06-01 17:32:07] [INFO ] Deduced a trap composed of 107 places in 498 ms of which 5 ms to minimize.
[2024-06-01 17:32:08] [INFO ] Deduced a trap composed of 125 places in 442 ms of which 5 ms to minimize.
[2024-06-01 17:32:08] [INFO ] Deduced a trap composed of 138 places in 496 ms of which 5 ms to minimize.
[2024-06-01 17:32:09] [INFO ] Deduced a trap composed of 83 places in 488 ms of which 6 ms to minimize.
[2024-06-01 17:32:09] [INFO ] Deduced a trap composed of 57 places in 483 ms of which 5 ms to minimize.
[2024-06-01 17:32:10] [INFO ] Deduced a trap composed of 97 places in 476 ms of which 6 ms to minimize.
[2024-06-01 17:32:10] [INFO ] Deduced a trap composed of 147 places in 480 ms of which 6 ms to minimize.
[2024-06-01 17:32:11] [INFO ] Deduced a trap composed of 88 places in 472 ms of which 5 ms to minimize.
[2024-06-01 17:32:11] [INFO ] Deduced a trap composed of 111 places in 478 ms of which 8 ms to minimize.
[2024-06-01 17:32:12] [INFO ] Deduced a trap composed of 109 places in 446 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-01 17:32:17] [INFO ] Deduced a trap composed of 127 places in 421 ms of which 6 ms to minimize.
[2024-06-01 17:32:17] [INFO ] Deduced a trap composed of 98 places in 465 ms of which 5 ms to minimize.
SMT process timed out in 31401ms, After SMT, problems are : Problem set: 0 solved, 719 unsolved
Search for dead transitions found 0 dead transitions in 31417ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35002 ms. Remains : 349/349 places, 731/731 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 144 Pre rules applied. Total rules applied 0 place count 349 transition count 587
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 0 with 288 rules applied. Total rules applied 288 place count 205 transition count 587
Applied a total of 288 rules in 21 ms. Remains 205 /349 variables (removed 144) and now considering 587/731 (removed 144) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 587 rows 205 cols
[2024-06-01 17:32:17] [INFO ] Computed 26 invariants in 6 ms
[2024-06-01 17:32:18] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 17:32:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2024-06-01 17:32:18] [INFO ] [Nat]Absence check using 13 positive and 13 generalized place invariants in 23 ms returned sat
[2024-06-01 17:32:18] [INFO ] After 380ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 17:32:18] [INFO ] After 466ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 17:32:18] [INFO ] After 646ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 754 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 207 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 315 ms.
Product exploration explored 100000 steps with 0 reset in 363 ms.
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 350/350 places, 732/732 transitions.
Applied a total of 0 rules in 9 ms. Remains 350 /350 variables (removed 0) and now considering 732/732 (removed 0) transitions.
// Phase 1: matrix 732 rows 350 cols
[2024-06-01 17:32:19] [INFO ] Computed 26 invariants in 8 ms
[2024-06-01 17:32:20] [INFO ] Implicit Places using invariants in 884 ms returned []
[2024-06-01 17:32:20] [INFO ] Invariant cache hit.
[2024-06-01 17:32:21] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-01 17:32:23] [INFO ] Implicit Places using invariants and state equation in 2585 ms returned []
Implicit Place search using SMT with State Equation took 3478 ms to find 0 implicit places.
[2024-06-01 17:32:23] [INFO ] Redundant transitions in 9 ms returned []
Running 720 sub problems to find dead transitions.
[2024-06-01 17:32:23] [INFO ] Invariant cache hit.
[2024-06-01 17:32:23] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 17:32:37] [INFO ] Deduced a trap composed of 93 places in 475 ms of which 6 ms to minimize.
[2024-06-01 17:32:38] [INFO ] Deduced a trap composed of 47 places in 478 ms of which 5 ms to minimize.
[2024-06-01 17:32:38] [INFO ] Deduced a trap composed of 103 places in 475 ms of which 5 ms to minimize.
[2024-06-01 17:32:40] [INFO ] Deduced a trap composed of 143 places in 475 ms of which 6 ms to minimize.
[2024-06-01 17:32:40] [INFO ] Deduced a trap composed of 125 places in 466 ms of which 6 ms to minimize.
[2024-06-01 17:32:41] [INFO ] Deduced a trap composed of 101 places in 430 ms of which 6 ms to minimize.
[2024-06-01 17:32:41] [INFO ] Deduced a trap composed of 116 places in 488 ms of which 6 ms to minimize.
[2024-06-01 17:32:42] [INFO ] Deduced a trap composed of 100 places in 480 ms of which 6 ms to minimize.
[2024-06-01 17:32:42] [INFO ] Deduced a trap composed of 89 places in 492 ms of which 5 ms to minimize.
[2024-06-01 17:32:43] [INFO ] Deduced a trap composed of 114 places in 490 ms of which 6 ms to minimize.
[2024-06-01 17:32:43] [INFO ] Deduced a trap composed of 118 places in 488 ms of which 6 ms to minimize.
[2024-06-01 17:32:44] [INFO ] Deduced a trap composed of 119 places in 433 ms of which 5 ms to minimize.
[2024-06-01 17:32:44] [INFO ] Deduced a trap composed of 91 places in 435 ms of which 5 ms to minimize.
[2024-06-01 17:32:45] [INFO ] Deduced a trap composed of 105 places in 481 ms of which 6 ms to minimize.
[2024-06-01 17:32:45] [INFO ] Deduced a trap composed of 125 places in 495 ms of which 6 ms to minimize.
[2024-06-01 17:32:46] [INFO ] Deduced a trap composed of 101 places in 454 ms of which 5 ms to minimize.
[2024-06-01 17:32:46] [INFO ] Deduced a trap composed of 113 places in 469 ms of which 6 ms to minimize.
[2024-06-01 17:32:47] [INFO ] Deduced a trap composed of 103 places in 473 ms of which 5 ms to minimize.
[2024-06-01 17:32:47] [INFO ] Deduced a trap composed of 126 places in 475 ms of which 6 ms to minimize.
[2024-06-01 17:32:48] [INFO ] Deduced a trap composed of 139 places in 503 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1082 variables, and 46 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/350 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 720/720 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/1082 variables, and 46 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/350 constraints, ReadFeed: 0/132 constraints, PredecessorRefiner: 0/720 constraints, Known Traps: 20/20 constraints]
After SMT, in 61188ms problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 61202ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64709 ms. Remains : 350/350 places, 732/732 transitions.
Treatment of property Anderson-PT-12-LTLFireability-14 finished in 284691 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0&&F(((!p1&&X(!p2))||G(!p2)))))))))'
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)))'
[2024-06-01 17:33:25] [INFO ] Flatten gal took : 126 ms
[2024-06-01 17:33:25] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 17:33:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 650 places, 1516 transitions and 5506 arcs took 23 ms.
Total runtime 1141486 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : Anderson-PT-12-LTLFireability-12
Could not compute solution for formula : Anderson-PT-12-LTLFireability-14

BK_STOP 1717263901942

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name Anderson-PT-12-LTLFireability-12
ltl formula formula --ltl=/tmp/3035/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 650 places, 1516 transitions and 5506 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.260 real 0.070 user 0.100 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3035/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3035/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3035/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3035/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 651 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 651, there are 1569 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2221 levels ~10000 states ~54276 transitions
pnml2lts-mc( 0/ 4): ~4259 levels ~20000 states ~114244 transitions
pnml2lts-mc( 0/ 4): ~8615 levels ~40000 states ~222396 transitions
pnml2lts-mc( 1/ 4): ~18371 levels ~80000 states ~410412 transitions
pnml2lts-mc( 1/ 4): ~36695 levels ~160000 states ~846768 transitions
pnml2lts-mc( 3/ 4): ~71700 levels ~320000 states ~1811184 transitions
pnml2lts-mc( 3/ 4): ~142357 levels ~640000 states ~3592628 transitions
pnml2lts-mc( 3/ 4): ~284858 levels ~1280000 states ~7189884 transitions
pnml2lts-mc( 1/ 4): ~578040 levels ~2560000 states ~14636320 transitions
pnml2lts-mc( 1/ 4): ~1160354 levels ~5120000 states ~29792272 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 9057828
pnml2lts-mc( 0/ 4): unique transitions count: 53501177
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 21506640
pnml2lts-mc( 0/ 4): - claim success count: 9057831
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8070731
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9057831 states 53501215 transitions, fanout: 5.907
pnml2lts-mc( 0/ 4): Total exploration time 350.230 sec (350.180 sec minimum, 350.195 sec on average)
pnml2lts-mc( 0/ 4): States per second: 25863, Transitions per second: 152760
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 182.1MB, 12.3 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 46.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1546 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 182.1MB (~256.0MB paged-in)
ltl formula name Anderson-PT-12-LTLFireability-14
ltl formula formula --ltl=/tmp/3035/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 650 places, 1516 transitions and 5506 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.250 real 0.070 user 0.090 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3035/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3035/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3035/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3035/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 651 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 651, there are 1528 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2332 levels ~10000 states ~62716 transitions
pnml2lts-mc( 1/ 4): ~4564 levels ~20000 states ~117732 transitions
pnml2lts-mc( 1/ 4): ~8759 levels ~40000 states ~247484 transitions
pnml2lts-mc( 0/ 4): ~17836 levels ~80000 states ~486200 transitions
pnml2lts-mc( 0/ 4): ~35354 levels ~160000 states ~926964 transitions
pnml2lts-mc( 0/ 4): ~70236 levels ~320000 states ~1861420 transitions
pnml2lts-mc( 2/ 4): ~138721 levels ~640000 states ~3479136 transitions
pnml2lts-mc( 2/ 4): ~277180 levels ~1280000 states ~7065696 transitions
pnml2lts-mc( 2/ 4): ~555602 levels ~2560000 states ~14045120 transitions
pnml2lts-mc( 2/ 4): ~1106364 levels ~5120000 states ~28589248 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 9447228
pnml2lts-mc( 0/ 4): unique transitions count: 55152940
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 23378337
pnml2lts-mc( 0/ 4): - claim success count: 9447232
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8293278
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9447232 states 55153038 transitions, fanout: 5.838
pnml2lts-mc( 0/ 4): Total exploration time 344.320 sec (344.290 sec minimum, 344.305 sec on average)
pnml2lts-mc( 0/ 4): States per second: 27437, Transitions per second: 160180
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 182.4MB, 12.3 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 46.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1546 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 182.4MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Anderson-PT-12, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620118400380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-12.tgz
mv Anderson-PT-12 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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