Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.9K Apr 11 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 11 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 11 17:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 11 17:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717249634224

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:47:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:47:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:47:15] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 13:47:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:47:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 654 ms
[2024-06-01 13:47:16] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 554 PT places and 3040.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 13:47:16] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-06-01 13:47:16] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (17 resets) in 2818 ms. (14 steps per ms) remains 10/30 properties
BEST_FIRST walk for 40003 steps (8 resets) in 558 ms. (71 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (9 resets) in 273 ms. (145 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (11 resets) in 278 ms. (143 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (9 resets) in 201 ms. (198 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (9 resets) in 268 ms. (148 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (9 resets) in 209 ms. (190 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 181 ms. (219 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (10 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (10 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
[2024-06-01 13:47:18] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:47:18] [INFO ] Computed 26 invariants in 13 ms
[2024-06-01 13:47:18] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 2 (OVERLAPS) 42/55 variables, 7/8 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 3/58 variables, 3/11 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 6 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
At refinement iteration 6 (OVERLAPS) 21/79 variables, 14/25 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 64/143 variables, 79/104 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 8/112 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/112 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/145 variables, 2/114 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 1/115 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 9 solved, 1 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/34 variables, 3/3 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/48 variables, 5/8 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/52 variables, 1/9 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 9 solved, 1 unsolved
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Int declared 73/145 variables, and 21 constraints, problems are : Problem set: 10 solved, 0 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 12/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 0/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 386ms problems are : Problem set: 10 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 10 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:47:18] [INFO ] Flatten gal took : 29 ms
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:47:18] [INFO ] Flatten gal took : 8 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 13:47:18] [INFO ] Unfolded HLPN to a Petri net with 554 places and 2998 transitions 20754 arcs in 72 ms.
[2024-06-01 13:47:18] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Support contains 227 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 548 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 548 transition count 1366
Applied a total of 12 rules in 61 ms. Remains 548 /554 variables (removed 6) and now considering 1366/1372 (removed 6) transitions.
Running 1362 sub problems to find dead transitions.
[2024-06-01 13:47:19] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
// Phase 1: matrix 1342 rows 548 cols
[2024-06-01 13:47:19] [INFO ] Computed 50 invariants in 89 ms
[2024-06-01 13:47:19] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-06-01 13:47:34] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 13 ms to minimize.
[2024-06-01 13:47:34] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 2 ms to minimize.
[2024-06-01 13:47:34] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:47:34] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 2 ms to minimize.
[2024-06-01 13:47:34] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 1 ms to minimize.
[2024-06-01 13:47:35] [INFO ] Deduced a trap composed of 150 places in 360 ms of which 5 ms to minimize.
[2024-06-01 13:47:35] [INFO ] Deduced a trap composed of 161 places in 316 ms of which 4 ms to minimize.
[2024-06-01 13:47:36] [INFO ] Deduced a trap composed of 313 places in 313 ms of which 3 ms to minimize.
[2024-06-01 13:47:36] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 2 ms to minimize.
[2024-06-01 13:47:37] [INFO ] Deduced a trap composed of 145 places in 250 ms of which 3 ms to minimize.
[2024-06-01 13:47:37] [INFO ] Deduced a trap composed of 39 places in 237 ms of which 3 ms to minimize.
[2024-06-01 13:47:43] [INFO ] Deduced a trap composed of 305 places in 358 ms of which 5 ms to minimize.
[2024-06-01 13:47:43] [INFO ] Deduced a trap composed of 280 places in 347 ms of which 5 ms to minimize.
[2024-06-01 13:47:44] [INFO ] Deduced a trap composed of 319 places in 409 ms of which 5 ms to minimize.
SMT process timed out in 25117ms, After SMT, problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 25140ms
[2024-06-01 13:47:44] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2024-06-01 13:47:44] [INFO ] Invariant cache hit.
[2024-06-01 13:47:44] [INFO ] Implicit Places using invariants in 381 ms returned [432, 433, 434, 435, 436, 437]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 389 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 542/554 places, 1366/1372 transitions.
Applied a total of 0 rules in 13 ms. Remains 542 /542 variables (removed 0) and now considering 1366/1366 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25625 ms. Remains : 542/554 places, 1366/1372 transitions.
Support contains 227 out of 542 places after structural reductions.
[2024-06-01 13:47:44] [INFO ] Flatten gal took : 113 ms
[2024-06-01 13:47:44] [INFO ] Flatten gal took : 104 ms
[2024-06-01 13:47:45] [INFO ] Input system was already deterministic with 1366 transitions.
RANDOM walk for 40000 steps (8 resets) in 559 ms. (71 steps per ms) remains 3/21 properties
BEST_FIRST walk for 40002 steps (8 resets) in 267 ms. (149 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 235 ms. (169 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
[2024-06-01 13:47:45] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
// Phase 1: matrix 1342 rows 542 cols
[2024-06-01 13:47:45] [INFO ] Computed 44 invariants in 38 ms
[2024-06-01 13:47:45] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 226/275 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 27/302 variables, 7/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 5 (OVERLAPS) 235/537 variables, 24/40 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/540 variables, 3/43 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 0/43 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1342/1882 variables, 540/583 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1882 variables, 120/703 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1882 variables, 0/703 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1884 variables, 2/705 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1884 variables, 1/706 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1884 variables, 0/706 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1884 variables, 0/706 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1884/1884 variables, and 706 constraints, problems are : Problem set: 2 solved, 1 unsolved in 813 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 542/542 constraints, ReadFeed: 120/120 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/37 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 232/269 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-01 13:47:46] [INFO ] Deduced a trap composed of 143 places in 154 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 27/296 variables, 7/17 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Int declared 535/1884 variables, and 39 constraints, problems are : Problem set: 3 solved, 0 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 16/20 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/542 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1185ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 7 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(G(p1))))))'
Support contains 31 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 1366/1366 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 538 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 532 transition count 1360
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 532 transition count 1360
Applied a total of 16 rules in 41 ms. Remains 532 /542 variables (removed 10) and now considering 1360/1366 (removed 6) transitions.
Running 1356 sub problems to find dead transitions.
[2024-06-01 13:47:47] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-06-01 13:47:47] [INFO ] Computed 40 invariants in 48 ms
[2024-06-01 13:47:47] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:48:04] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 2 ms to minimize.
[2024-06-01 13:48:04] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:48:05] [INFO ] Deduced a trap composed of 74 places in 289 ms of which 4 ms to minimize.
[2024-06-01 13:48:05] [INFO ] Deduced a trap composed of 157 places in 286 ms of which 4 ms to minimize.
[2024-06-01 13:48:06] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:48:08] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 2 ms to minimize.
[2024-06-01 13:48:08] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:48:12] [INFO ] Deduced a trap composed of 279 places in 359 ms of which 4 ms to minimize.
[2024-06-01 13:48:12] [INFO ] Deduced a trap composed of 315 places in 384 ms of which 4 ms to minimize.
[2024-06-01 13:48:12] [INFO ] Deduced a trap composed of 303 places in 336 ms of which 4 ms to minimize.
[2024-06-01 13:48:13] [INFO ] Deduced a trap composed of 301 places in 340 ms of which 4 ms to minimize.
SMT process timed out in 26211ms, After SMT, problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 26230ms
[2024-06-01 13:48:13] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-06-01 13:48:13] [INFO ] Invariant cache hit.
[2024-06-01 13:48:13] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-06-01 13:48:13] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-06-01 13:48:13] [INFO ] Invariant cache hit.
[2024-06-01 13:48:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:48:20] [INFO ] Implicit Places using invariants and state equation in 7091 ms returned []
Implicit Place search using SMT with State Equation took 7596 ms to find 0 implicit places.
Running 1356 sub problems to find dead transitions.
[2024-06-01 13:48:20] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-06-01 13:48:20] [INFO ] Invariant cache hit.
[2024-06-01 13:48:20] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:48:37] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 1 ms to minimize.
[2024-06-01 13:48:37] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:48:37] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 2 ms to minimize.
[2024-06-01 13:48:38] [INFO ] Deduced a trap composed of 39 places in 226 ms of which 2 ms to minimize.
[2024-06-01 13:48:38] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:48:39] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:48:40] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:48:42] [INFO ] Deduced a trap composed of 279 places in 360 ms of which 4 ms to minimize.
[2024-06-01 13:48:43] [INFO ] Deduced a trap composed of 299 places in 353 ms of which 4 ms to minimize.
[2024-06-01 13:48:43] [INFO ] Deduced a trap composed of 369 places in 380 ms of which 4 ms to minimize.
[2024-06-01 13:48:43] [INFO ] Deduced a trap composed of 291 places in 357 ms of which 5 ms to minimize.
[2024-06-01 13:48:53] [INFO ] Deduced a trap composed of 149 places in 308 ms of which 4 ms to minimize.
[2024-06-01 13:48:56] [INFO ] Deduced a trap composed of 319 places in 248 ms of which 3 ms to minimize.
SMT process timed out in 35234ms, After SMT, problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 35255ms
Starting structural reductions in LTL mode, iteration 1 : 532/542 places, 1360/1366 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69133 ms. Remains : 532/542 places, 1360/1366 transitions.
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLCardinality-01
Product exploration explored 100000 steps with 5 reset in 592 ms.
Stack based approach found an accepted trace after 5304 steps with 0 reset with depth 5305 and stack size 5305 in 34 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S04J04T06-LTLCardinality-01 finished in 70120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((p1 U p2)))))'
Support contains 38 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 1366/1366 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 538 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 532 transition count 1360
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 532 transition count 1360
Applied a total of 16 rules in 30 ms. Remains 532 /542 variables (removed 10) and now considering 1360/1366 (removed 6) transitions.
Running 1356 sub problems to find dead transitions.
[2024-06-01 13:48:57] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-06-01 13:48:57] [INFO ] Computed 40 invariants in 33 ms
[2024-06-01 13:48:57] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:49:12] [INFO ] Deduced a trap composed of 98 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:49:12] [INFO ] Deduced a trap composed of 133 places in 248 ms of which 3 ms to minimize.
[2024-06-01 13:49:13] [INFO ] Deduced a trap composed of 241 places in 278 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 38 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20066 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 25/29 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:49:29] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 3 ms to minimize.
[2024-06-01 13:49:29] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 1 ms to minimize.
[2024-06-01 13:49:36] [INFO ] Deduced a trap composed of 262 places in 261 ms of which 3 ms to minimize.
[2024-06-01 13:49:37] [INFO ] Deduced a trap composed of 258 places in 266 ms of which 4 ms to minimize.
[2024-06-01 13:49:37] [INFO ] Deduced a trap composed of 90 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:49:37] [INFO ] Deduced a trap composed of 110 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:49:38] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 2 ms to minimize.
[2024-06-01 13:49:38] [INFO ] Deduced a trap composed of 273 places in 312 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 46 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 25/29 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 11/11 constraints]
After SMT, in 45584ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45622ms
[2024-06-01 13:49:42] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-06-01 13:49:42] [INFO ] Invariant cache hit.
[2024-06-01 13:49:43] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-06-01 13:49:43] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-06-01 13:49:43] [INFO ] Invariant cache hit.
[2024-06-01 13:49:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:49:51] [INFO ] Implicit Places using invariants and state equation in 8215 ms returned []
Implicit Place search using SMT with State Equation took 8643 ms to find 0 implicit places.
Running 1356 sub problems to find dead transitions.
[2024-06-01 13:49:51] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-06-01 13:49:51] [INFO ] Invariant cache hit.
[2024-06-01 13:49:51] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:50:07] [INFO ] Deduced a trap composed of 98 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:50:07] [INFO ] Deduced a trap composed of 133 places in 223 ms of which 3 ms to minimize.
[2024-06-01 13:50:08] [INFO ] Deduced a trap composed of 305 places in 306 ms of which 4 ms to minimize.
[2024-06-01 13:50:20] [INFO ] Deduced a trap composed of 258 places in 223 ms of which 3 ms to minimize.
[2024-06-01 13:50:20] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 2 ms to minimize.
[2024-06-01 13:50:21] [INFO ] Deduced a trap composed of 272 places in 319 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
(s205 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.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 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 2.0)
(s105 2.0)
(s106 2.0)
(s107 2.0)
(s108 2.0)
(s109 2.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 9.0)
(s123 0.0)
(s124 1.0)
(s125 1.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 1.0)
(s174 0.0)
(s175 0.0)
(s176 1.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.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 41 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 25/29 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:50:34] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 4 ms to minimize.
[2024-06-01 13:50:34] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 2 ms to minimize.
[2024-06-01 13:50:34] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:50:51] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 45 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 25/29 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 10/10 constraints]
After SMT, in 65484ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 65516ms
Starting structural reductions in LTL mode, iteration 1 : 532/542 places, 1360/1366 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119827 ms. Remains : 532/542 places, 1360/1366 transitions.
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 1145 ms.
Product exploration explored 100000 steps with 50000 reset in 633 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 p1))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 16 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S04J04T06-LTLCardinality-05 finished in 121910 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)))))'
Support contains 30 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 1366/1366 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 538 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 532 transition count 1360
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 532 transition count 1360
Applied a total of 16 rules in 23 ms. Remains 532 /542 variables (removed 10) and now considering 1360/1366 (removed 6) transitions.
Running 1356 sub problems to find dead transitions.
[2024-06-01 13:50:58] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-06-01 13:50:59] [INFO ] Computed 40 invariants in 49 ms
[2024-06-01 13:50:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:51:14] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 2 ms to minimize.
[2024-06-01 13:51:14] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 1 ms to minimize.
[2024-06-01 13:51:14] [INFO ] Deduced a trap composed of 74 places in 329 ms of which 4 ms to minimize.
[2024-06-01 13:51:15] [INFO ] Deduced a trap composed of 157 places in 274 ms of which 3 ms to minimize.
[2024-06-01 13:51:16] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-06-01 13:51:17] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:51:17] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 2 ms to minimize.
[2024-06-01 13:51:21] [INFO ] Deduced a trap composed of 279 places in 343 ms of which 4 ms to minimize.
[2024-06-01 13:51:22] [INFO ] Deduced a trap composed of 315 places in 349 ms of which 4 ms to minimize.
[2024-06-01 13:51:22] [INFO ] Deduced a trap composed of 303 places in 389 ms of which 4 ms to minimize.
[2024-06-01 13:51:23] [INFO ] Deduced a trap composed of 301 places in 382 ms of which 4 ms to minimize.
[2024-06-01 13:51:23] [INFO ] Deduced a trap composed of 330 places in 326 ms of which 4 ms to minimize.
[2024-06-01 13:51:23] [INFO ] Deduced a trap composed of 326 places in 349 ms of which 4 ms to minimize.
[2024-06-01 13:51:24] [INFO ] Deduced a trap composed of 297 places in 338 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 50 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:51:26] [INFO ] Deduced a trap composed of 259 places in 306 ms of which 4 ms to minimize.
[2024-06-01 13:51:41] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:51:41] [INFO ] Deduced a trap composed of 61 places in 319 ms of which 4 ms to minimize.
[2024-06-01 13:51:41] [INFO ] Deduced a trap composed of 277 places in 304 ms of which 3 ms to minimize.
[2024-06-01 13:51:42] [INFO ] Deduced a trap composed of 41 places in 303 ms of which 4 ms to minimize.
[2024-06-01 13:51:42] [INFO ] Deduced a trap composed of 3 places in 341 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 6)
(s1 4)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 9)
(s123 1)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 1)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 1)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 1)
(s346 0)
(s347 0)
(s348 0)
(s349 1)
(s350 0)
(s351 0)
(s352 1)
(s353 0)
(s354 0)
(s355 0)
(s356 1)
(s357 0)
(s358 0)
(s359 0)
(s360 1)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 1)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 10)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 56 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 20/20 constraints]
After SMT, in 45228ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45248ms
[2024-06-01 13:51:44] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-06-01 13:51:44] [INFO ] Invariant cache hit.
[2024-06-01 13:51:44] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-06-01 13:51:44] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-06-01 13:51:44] [INFO ] Invariant cache hit.
[2024-06-01 13:51:44] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:51:50] [INFO ] Implicit Places using invariants and state equation in 6400 ms returned []
Implicit Place search using SMT with State Equation took 6749 ms to find 0 implicit places.
Running 1356 sub problems to find dead transitions.
[2024-06-01 13:51:50] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-06-01 13:51:50] [INFO ] Invariant cache hit.
[2024-06-01 13:51:51] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:52:06] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 2 ms to minimize.
[2024-06-01 13:52:06] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:52:06] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:52:07] [INFO ] Deduced a trap composed of 39 places in 222 ms of which 3 ms to minimize.
[2024-06-01 13:52:07] [INFO ] Deduced a trap composed of 74 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:52:08] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:52:10] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:52:11] [INFO ] Deduced a trap composed of 279 places in 325 ms of which 4 ms to minimize.
[2024-06-01 13:52:12] [INFO ] Deduced a trap composed of 299 places in 354 ms of which 4 ms to minimize.
[2024-06-01 13:52:12] [INFO ] Deduced a trap composed of 369 places in 358 ms of which 4 ms to minimize.
[2024-06-01 13:52:12] [INFO ] Deduced a trap composed of 291 places in 305 ms of which 4 ms to minimize.
[2024-06-01 13:52:22] [INFO ] Deduced a trap composed of 149 places in 303 ms of which 4 ms to minimize.
[2024-06-01 13:52:26] [INFO ] Deduced a trap composed of 319 places in 329 ms of which 3 ms to minimize.
SMT process timed out in 35313ms, After SMT, problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 35337ms
Starting structural reductions in LTL mode, iteration 1 : 532/542 places, 1360/1366 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87365 ms. Remains : 532/542 places, 1360/1366 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T06-LTLCardinality-09 finished in 87569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 542/542 places, 1366/1366 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 538 transition count 1324
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 496 transition count 1324
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 84 place count 496 transition count 1264
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 204 place count 436 transition count 1264
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 336 place count 370 transition count 1198
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 342 place count 364 transition count 1192
Iterating global reduction 2 with 6 rules applied. Total rules applied 348 place count 364 transition count 1192
Applied a total of 348 rules in 195 ms. Remains 364 /542 variables (removed 178) and now considering 1192/1366 (removed 174) transitions.
Running 1188 sub problems to find dead transitions.
[2024-06-01 13:52:26] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
// Phase 1: matrix 1168 rows 364 cols
[2024-06-01 13:52:26] [INFO ] Computed 40 invariants in 19 ms
[2024-06-01 13:52:26] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-06-01 13:52:37] [INFO ] Deduced a trap composed of 46 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:52:37] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:52:37] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 1 ms to minimize.
[2024-06-01 13:52:37] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 2 ms to minimize.
[2024-06-01 13:52:37] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:52:38] [INFO ] Deduced a trap composed of 157 places in 336 ms of which 2 ms to minimize.
[2024-06-01 13:52:38] [INFO ] Deduced a trap composed of 167 places in 316 ms of which 3 ms to minimize.
[2024-06-01 13:52:38] [INFO ] Deduced a trap composed of 191 places in 279 ms of which 3 ms to minimize.
[2024-06-01 13:52:39] [INFO ] Deduced a trap composed of 171 places in 308 ms of which 3 ms to minimize.
[2024-06-01 13:52:39] [INFO ] Deduced a trap composed of 164 places in 287 ms of which 3 ms to minimize.
[2024-06-01 13:52:39] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:52:40] [INFO ] Deduced a trap composed of 137 places in 218 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-06-01 13:52:51] [INFO ] Deduced a trap composed of 178 places in 171 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1532 variables, and 49 constraints, problems are : Problem set: 0 solved, 1188 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1188/1188 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-06-01 13:52:55] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2024-06-01 13:53:02] [INFO ] Deduced a trap composed of 120 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:53:03] [INFO ] Deduced a trap composed of 92 places in 274 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/1532 variables, and 52 constraints, problems are : Problem set: 0 solved, 1188 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1188 constraints, Known Traps: 16/16 constraints]
After SMT, in 45223ms problems are : Problem set: 0 solved, 1188 unsolved
Search for dead transitions found 0 dead transitions in 45241ms
[2024-06-01 13:53:11] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
[2024-06-01 13:53:11] [INFO ] Invariant cache hit.
[2024-06-01 13:53:12] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-06-01 13:53:12] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
[2024-06-01 13:53:12] [INFO ] Invariant cache hit.
[2024-06-01 13:53:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:53:16] [INFO ] Implicit Places using invariants and state equation in 4015 ms returned []
Implicit Place search using SMT with State Equation took 4320 ms to find 0 implicit places.
[2024-06-01 13:53:16] [INFO ] Redundant transitions in 109 ms returned []
Running 1188 sub problems to find dead transitions.
[2024-06-01 13:53:16] [INFO ] Flow matrix only has 1168 transitions (discarded 24 similar events)
[2024-06-01 13:53:16] [INFO ] Invariant cache hit.
[2024-06-01 13:53:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-06-01 13:53:27] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:53:27] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:53:27] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:53:27] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:53:27] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:53:27] [INFO ] Deduced a trap composed of 162 places in 265 ms of which 3 ms to minimize.
[2024-06-01 13:53:27] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:53:35] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:53:37] [INFO ] Deduced a trap composed of 120 places in 228 ms of which 2 ms to minimize.
[2024-06-01 13:53:38] [INFO ] Deduced a trap composed of 116 places in 202 ms of which 2 ms to minimize.
[2024-06-01 13:53:38] [INFO ] Deduced a trap composed of 140 places in 292 ms of which 3 ms to minimize.
[2024-06-01 13:53:39] [INFO ] Deduced a trap composed of 83 places in 222 ms of which 2 ms to minimize.
[2024-06-01 13:53:39] [INFO ] Deduced a trap composed of 73 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:53:39] [INFO ] Deduced a trap composed of 58 places in 291 ms of which 3 ms to minimize.
[2024-06-01 13:53:40] [INFO ] Deduced a trap composed of 61 places in 334 ms of which 3 ms to minimize.
[2024-06-01 13:53:40] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 2 ms to minimize.
[2024-06-01 13:53:40] [INFO ] Deduced a trap composed of 57 places in 254 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
[2024-06-01 13:53:42] [INFO ] Deduced a trap composed of 178 places in 256 ms of which 2 ms to minimize.
[2024-06-01 13:53:50] [INFO ] Deduced a trap composed of 147 places in 220 ms of which 2 ms to minimize.
[2024-06-01 13:53:50] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 1 ms to minimize.
[2024-06-01 13:53:51] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1532 variables, and 57 constraints, problems are : Problem set: 0 solved, 1188 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1188/1188 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 21/57 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1188 unsolved
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/361 variables, 1/58 constraints. Problems are: Problem set: 90 solved, 1098 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/58 constraints. Problems are: Problem set: 90 solved, 1098 unsolved
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
At refinement iteration 6 (OVERLAPS) 3/364 variables, 3/61 constraints. Problems are: Problem set: 324 solved, 864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/1532 variables, and 61 constraints, problems are : Problem set: 324 solved, 864 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1188 constraints, Known Traps: 21/21 constraints]
After SMT, in 65454ms problems are : Problem set: 324 solved, 864 unsolved
Search for dead transitions found 324 dead transitions in 65469ms
Found 324 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 324 transitions
Dead transitions reduction (with SMT) removed 324 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 364/542 places, 868/1366 transitions.
Applied a total of 0 rules in 48 ms. Remains 364 /364 variables (removed 0) and now considering 868/868 (removed 0) transitions.
[2024-06-01 13:54:21] [INFO ] Redundant transitions in 16 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 115432 ms. Remains : 364/542 places, 868/1366 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLCardinality-10
Product exploration explored 100000 steps with 2119 reset in 426 ms.
Product exploration explored 100000 steps with 2106 reset in 475 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 67 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 61 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Support contains 5 out of 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 868/868 transitions.
Applied a total of 0 rules in 21 ms. Remains 364 /364 variables (removed 0) and now considering 868/868 (removed 0) transitions.
Running 864 sub problems to find dead transitions.
[2024-06-01 13:54:23] [INFO ] Flow matrix only has 844 transitions (discarded 24 similar events)
// Phase 1: matrix 844 rows 364 cols
[2024-06-01 13:54:23] [INFO ] Computed 40 invariants in 30 ms
[2024-06-01 13:54:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-06-01 13:54:29] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:54:29] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:54:29] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:54:29] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:54:29] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:54:29] [INFO ] Deduced a trap composed of 151 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:54:29] [INFO ] Deduced a trap composed of 136 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:54:29] [INFO ] Deduced a trap composed of 162 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:54:30] [INFO ] Deduced a trap composed of 157 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:54:30] [INFO ] Deduced a trap composed of 149 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:54:30] [INFO ] Deduced a trap composed of 157 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:54:30] [INFO ] Deduced a trap composed of 143 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:54:30] [INFO ] Deduced a trap composed of 175 places in 140 ms of which 3 ms to minimize.
[2024-06-01 13:54:30] [INFO ] Deduced a trap composed of 141 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:54:31] [INFO ] Deduced a trap composed of 136 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:54:31] [INFO ] Deduced a trap composed of 173 places in 181 ms of which 2 ms to minimize.
[2024-06-01 13:54:31] [INFO ] Deduced a trap composed of 167 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:54:31] [INFO ] Deduced a trap composed of 172 places in 162 ms of which 3 ms to minimize.
[2024-06-01 13:54:31] [INFO ] Deduced a trap composed of 169 places in 150 ms of which 3 ms to minimize.
[2024-06-01 13:54:32] [INFO ] Deduced a trap composed of 147 places in 163 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-06-01 13:54:32] [INFO ] Deduced a trap composed of 46 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:54:32] [INFO ] Deduced a trap composed of 151 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:54:32] [INFO ] Deduced a trap composed of 143 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:54:32] [INFO ] Deduced a trap composed of 159 places in 189 ms of which 3 ms to minimize.
[2024-06-01 13:54:33] [INFO ] Deduced a trap composed of 158 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:54:33] [INFO ] Deduced a trap composed of 163 places in 173 ms of which 2 ms to minimize.
[2024-06-01 13:54:33] [INFO ] Deduced a trap composed of 155 places in 208 ms of which 2 ms to minimize.
[2024-06-01 13:54:33] [INFO ] Deduced a trap composed of 150 places in 174 ms of which 2 ms to minimize.
[2024-06-01 13:54:33] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:54:34] [INFO ] Deduced a trap composed of 162 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:54:34] [INFO ] Deduced a trap composed of 154 places in 183 ms of which 2 ms to minimize.
[2024-06-01 13:54:34] [INFO ] Deduced a trap composed of 150 places in 182 ms of which 2 ms to minimize.
[2024-06-01 13:54:34] [INFO ] Deduced a trap composed of 163 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:54:35] [INFO ] Deduced a trap composed of 157 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:54:35] [INFO ] Deduced a trap composed of 165 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:54:35] [INFO ] Deduced a trap composed of 163 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:54:35] [INFO ] Deduced a trap composed of 150 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:54:35] [INFO ] Deduced a trap composed of 159 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:54:35] [INFO ] Deduced a trap composed of 164 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:54:36] [INFO ] Deduced a trap composed of 159 places in 144 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-06-01 13:54:41] [INFO ] Deduced a trap composed of 142 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:54:41] [INFO ] Deduced a trap composed of 148 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:54:41] [INFO ] Deduced a trap composed of 155 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:54:41] [INFO ] Deduced a trap composed of 155 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:54:41] [INFO ] Deduced a trap composed of 141 places in 173 ms of which 2 ms to minimize.
[2024-06-01 13:54:42] [INFO ] Deduced a trap composed of 156 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:54:42] [INFO ] Deduced a trap composed of 141 places in 208 ms of which 2 ms to minimize.
[2024-06-01 13:54:42] [INFO ] Deduced a trap composed of 142 places in 173 ms of which 3 ms to minimize.
[2024-06-01 13:54:42] [INFO ] Deduced a trap composed of 145 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:54:42] [INFO ] Deduced a trap composed of 173 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:54:42] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:54:43] [INFO ] Deduced a trap composed of 161 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:54:43] [INFO ] Deduced a trap composed of 134 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:54:43] [INFO ] Deduced a trap composed of 179 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:54:43] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 2 ms to minimize.
[2024-06-01 13:54:43] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:54:44] [INFO ] Deduced a trap composed of 145 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:54:44] [INFO ] Deduced a trap composed of 154 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:54:44] [INFO ] Deduced a trap composed of 154 places in 216 ms of which 3 ms to minimize.
SMT process timed out in 21131ms, After SMT, problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 21142ms
[2024-06-01 13:54:44] [INFO ] Flow matrix only has 844 transitions (discarded 24 similar events)
[2024-06-01 13:54:44] [INFO ] Invariant cache hit.
[2024-06-01 13:54:44] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-06-01 13:54:44] [INFO ] Flow matrix only has 844 transitions (discarded 24 similar events)
[2024-06-01 13:54:44] [INFO ] Invariant cache hit.
[2024-06-01 13:54:45] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:55:06] [INFO ] Implicit Places using invariants and state equation in 21795 ms returned []
Implicit Place search using SMT with State Equation took 22099 ms to find 0 implicit places.
[2024-06-01 13:55:06] [INFO ] Redundant transitions in 11 ms returned []
Running 864 sub problems to find dead transitions.
[2024-06-01 13:55:06] [INFO ] Flow matrix only has 844 transitions (discarded 24 similar events)
[2024-06-01 13:55:06] [INFO ] Invariant cache hit.
[2024-06-01 13:55:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-06-01 13:55:12] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:55:12] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:55:12] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:55:12] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:55:12] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:55:12] [INFO ] Deduced a trap composed of 157 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:55:13] [INFO ] Deduced a trap composed of 150 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:55:13] [INFO ] Deduced a trap composed of 147 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:55:13] [INFO ] Deduced a trap composed of 175 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:55:13] [INFO ] Deduced a trap composed of 158 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:55:13] [INFO ] Deduced a trap composed of 156 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:55:13] [INFO ] Deduced a trap composed of 152 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:55:14] [INFO ] Deduced a trap composed of 163 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:55:14] [INFO ] Deduced a trap composed of 143 places in 151 ms of which 1 ms to minimize.
[2024-06-01 13:55:14] [INFO ] Deduced a trap composed of 144 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:55:14] [INFO ] Deduced a trap composed of 182 places in 248 ms of which 2 ms to minimize.
[2024-06-01 13:55:14] [INFO ] Deduced a trap composed of 144 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:55:15] [INFO ] Deduced a trap composed of 144 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:55:15] [INFO ] Deduced a trap composed of 165 places in 205 ms of which 2 ms to minimize.
[2024-06-01 13:55:15] [INFO ] Deduced a trap composed of 162 places in 176 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-06-01 13:55:15] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:55:16] [INFO ] Deduced a trap composed of 124 places in 198 ms of which 2 ms to minimize.
[2024-06-01 13:55:16] [INFO ] Deduced a trap composed of 177 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:55:16] [INFO ] Deduced a trap composed of 181 places in 173 ms of which 2 ms to minimize.
[2024-06-01 13:55:16] [INFO ] Deduced a trap composed of 156 places in 166 ms of which 2 ms to minimize.
[2024-06-01 13:55:16] [INFO ] Deduced a trap composed of 142 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:55:16] [INFO ] Deduced a trap composed of 135 places in 181 ms of which 2 ms to minimize.
[2024-06-01 13:55:17] [INFO ] Deduced a trap composed of 154 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:55:17] [INFO ] Deduced a trap composed of 171 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:55:17] [INFO ] Deduced a trap composed of 133 places in 174 ms of which 2 ms to minimize.
[2024-06-01 13:55:17] [INFO ] Deduced a trap composed of 160 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:55:17] [INFO ] Deduced a trap composed of 154 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:55:17] [INFO ] Deduced a trap composed of 142 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:55:18] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 2 ms to minimize.
[2024-06-01 13:55:18] [INFO ] Deduced a trap composed of 148 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:55:18] [INFO ] Deduced a trap composed of 146 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:55:18] [INFO ] Deduced a trap composed of 172 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:55:18] [INFO ] Deduced a trap composed of 146 places in 202 ms of which 2 ms to minimize.
[2024-06-01 13:55:19] [INFO ] Deduced a trap composed of 169 places in 173 ms of which 2 ms to minimize.
[2024-06-01 13:55:19] [INFO ] Deduced a trap composed of 150 places in 192 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-06-01 13:55:25] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 2 ms to minimize.
[2024-06-01 13:55:25] [INFO ] Deduced a trap composed of 147 places in 200 ms of which 2 ms to minimize.
[2024-06-01 13:55:26] [INFO ] Deduced a trap composed of 168 places in 186 ms of which 3 ms to minimize.
[2024-06-01 13:55:26] [INFO ] Deduced a trap composed of 149 places in 164 ms of which 2 ms to minimize.
[2024-06-01 13:55:26] [INFO ] Deduced a trap composed of 167 places in 184 ms of which 3 ms to minimize.
[2024-06-01 13:55:26] [INFO ] Deduced a trap composed of 148 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:55:26] [INFO ] Deduced a trap composed of 177 places in 200 ms of which 2 ms to minimize.
[2024-06-01 13:55:27] [INFO ] Deduced a trap composed of 171 places in 196 ms of which 3 ms to minimize.
[2024-06-01 13:55:27] [INFO ] Deduced a trap composed of 170 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:55:27] [INFO ] Deduced a trap composed of 160 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:55:27] [INFO ] Deduced a trap composed of 150 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:55:27] [INFO ] Deduced a trap composed of 181 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:55:27] [INFO ] Deduced a trap composed of 149 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:55:28] [INFO ] Deduced a trap composed of 167 places in 195 ms of which 2 ms to minimize.
[2024-06-01 13:55:28] [INFO ] Deduced a trap composed of 181 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:55:28] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:55:28] [INFO ] Deduced a trap composed of 150 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:55:28] [INFO ] Deduced a trap composed of 170 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:55:29] [INFO ] Deduced a trap composed of 168 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:55:29] [INFO ] Deduced a trap composed of 156 places in 166 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-06-01 13:55:30] [INFO ] Deduced a trap composed of 182 places in 161 ms of which 2 ms to minimize.
[2024-06-01 13:55:30] [INFO ] Deduced a trap composed of 157 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:55:30] [INFO ] Deduced a trap composed of 151 places in 152 ms of which 1 ms to minimize.
[2024-06-01 13:55:30] [INFO ] Deduced a trap composed of 153 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:55:30] [INFO ] Deduced a trap composed of 160 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:55:31] [INFO ] Deduced a trap composed of 176 places in 156 ms of which 3 ms to minimize.
[2024-06-01 13:55:31] [INFO ] Deduced a trap composed of 157 places in 152 ms of which 5 ms to minimize.
[2024-06-01 13:55:31] [INFO ] Deduced a trap composed of 158 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:55:31] [INFO ] Deduced a trap composed of 157 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:55:31] [INFO ] Deduced a trap composed of 148 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:55:32] [INFO ] Deduced a trap composed of 162 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:55:32] [INFO ] Deduced a trap composed of 133 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:55:32] [INFO ] Deduced a trap composed of 165 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:55:32] [INFO ] Deduced a trap composed of 160 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:55:32] [INFO ] Deduced a trap composed of 147 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:55:32] [INFO ] Deduced a trap composed of 174 places in 186 ms of which 2 ms to minimize.
[2024-06-01 13:55:33] [INFO ] Deduced a trap composed of 139 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:55:33] [INFO ] Deduced a trap composed of 179 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:55:33] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:55:33] [INFO ] Deduced a trap composed of 145 places in 202 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-06-01 13:55:34] [INFO ] Deduced a trap composed of 143 places in 208 ms of which 1 ms to minimize.
[2024-06-01 13:55:34] [INFO ] Deduced a trap composed of 136 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:55:34] [INFO ] Deduced a trap composed of 149 places in 151 ms of which 1 ms to minimize.
[2024-06-01 13:55:34] [INFO ] Deduced a trap composed of 136 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:55:35] [INFO ] Deduced a trap composed of 147 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:55:35] [INFO ] Deduced a trap composed of 198 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:55:35] [INFO ] Deduced a trap composed of 146 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:55:35] [INFO ] Deduced a trap composed of 163 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:55:36] [INFO ] Deduced a trap composed of 133 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:55:36] [INFO ] Deduced a trap composed of 167 places in 211 ms of which 2 ms to minimize.
[2024-06-01 13:55:36] [INFO ] Deduced a trap composed of 194 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:55:36] [INFO ] Deduced a trap composed of 172 places in 178 ms of which 3 ms to minimize.
[2024-06-01 13:55:36] [INFO ] Deduced a trap composed of 181 places in 173 ms of which 2 ms to minimize.
[2024-06-01 13:55:37] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1208 variables, and 130 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 864/864 constraints, Known Traps: 94/94 constraints]
Escalating to Integer solving :Problem set: 0 solved, 864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 94/130 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-06-01 13:55:39] [INFO ] Deduced a trap composed of 172 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:55:39] [INFO ] Deduced a trap composed of 158 places in 164 ms of which 3 ms to minimize.
[2024-06-01 13:55:39] [INFO ] Deduced a trap composed of 172 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:55:40] [INFO ] Deduced a trap composed of 172 places in 201 ms of which 2 ms to minimize.
[2024-06-01 13:55:40] [INFO ] Deduced a trap composed of 151 places in 185 ms of which 3 ms to minimize.
[2024-06-01 13:55:40] [INFO ] Deduced a trap composed of 155 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:55:40] [INFO ] Deduced a trap composed of 138 places in 184 ms of which 3 ms to minimize.
[2024-06-01 13:55:40] [INFO ] Deduced a trap composed of 143 places in 182 ms of which 2 ms to minimize.
[2024-06-01 13:55:41] [INFO ] Deduced a trap composed of 150 places in 252 ms of which 2 ms to minimize.
[2024-06-01 13:55:41] [INFO ] Deduced a trap composed of 152 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:55:41] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:55:41] [INFO ] Deduced a trap composed of 159 places in 214 ms of which 2 ms to minimize.
[2024-06-01 13:55:42] [INFO ] Deduced a trap composed of 154 places in 244 ms of which 3 ms to minimize.
[2024-06-01 13:55:42] [INFO ] Deduced a trap composed of 141 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:55:43] [INFO ] Deduced a trap composed of 173 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:55:43] [INFO ] Deduced a trap composed of 167 places in 226 ms of which 2 ms to minimize.
[2024-06-01 13:55:43] [INFO ] Deduced a trap composed of 151 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:55:43] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:55:43] [INFO ] Deduced a trap composed of 168 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:55:44] [INFO ] Deduced a trap composed of 167 places in 167 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-06-01 13:55:45] [INFO ] Deduced a trap composed of 156 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:55:45] [INFO ] Deduced a trap composed of 169 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:55:45] [INFO ] Deduced a trap composed of 187 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:55:45] [INFO ] Deduced a trap composed of 155 places in 174 ms of which 2 ms to minimize.
[2024-06-01 13:55:46] [INFO ] Deduced a trap composed of 150 places in 178 ms of which 3 ms to minimize.
[2024-06-01 13:55:46] [INFO ] Deduced a trap composed of 174 places in 174 ms of which 2 ms to minimize.
[2024-06-01 13:55:46] [INFO ] Deduced a trap composed of 162 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:55:46] [INFO ] Deduced a trap composed of 179 places in 174 ms of which 2 ms to minimize.
[2024-06-01 13:55:46] [INFO ] Deduced a trap composed of 173 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:55:46] [INFO ] Deduced a trap composed of 148 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:55:47] [INFO ] Deduced a trap composed of 183 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:55:47] [INFO ] Deduced a trap composed of 167 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:55:47] [INFO ] Deduced a trap composed of 176 places in 163 ms of which 2 ms to minimize.
[2024-06-01 13:55:47] [INFO ] Deduced a trap composed of 176 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:55:47] [INFO ] Deduced a trap composed of 187 places in 153 ms of which 3 ms to minimize.
[2024-06-01 13:55:47] [INFO ] Deduced a trap composed of 163 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:55:48] [INFO ] Deduced a trap composed of 169 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:55:48] [INFO ] Deduced a trap composed of 162 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:55:48] [INFO ] Deduced a trap composed of 190 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:55:48] [INFO ] Deduced a trap composed of 161 places in 202 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-06-01 13:55:50] [INFO ] Deduced a trap composed of 178 places in 253 ms of which 2 ms to minimize.
[2024-06-01 13:55:50] [INFO ] Deduced a trap composed of 161 places in 199 ms of which 2 ms to minimize.
[2024-06-01 13:55:51] [INFO ] Deduced a trap composed of 144 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:55:51] [INFO ] Deduced a trap composed of 185 places in 230 ms of which 3 ms to minimize.
[2024-06-01 13:55:51] [INFO ] Deduced a trap composed of 164 places in 232 ms of which 2 ms to minimize.
[2024-06-01 13:55:52] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 2 ms to minimize.
[2024-06-01 13:55:52] [INFO ] Deduced a trap composed of 160 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:55:52] [INFO ] Deduced a trap composed of 133 places in 182 ms of which 2 ms to minimize.
[2024-06-01 13:55:52] [INFO ] Deduced a trap composed of 150 places in 189 ms of which 3 ms to minimize.
[2024-06-01 13:55:52] [INFO ] Deduced a trap composed of 143 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:55:53] [INFO ] Deduced a trap composed of 171 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:55:53] [INFO ] Deduced a trap composed of 163 places in 166 ms of which 3 ms to minimize.
[2024-06-01 13:55:54] [INFO ] Deduced a trap composed of 163 places in 199 ms of which 2 ms to minimize.
[2024-06-01 13:55:54] [INFO ] Deduced a trap composed of 175 places in 149 ms of which 3 ms to minimize.
[2024-06-01 13:55:54] [INFO ] Deduced a trap composed of 175 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:55:54] [INFO ] Deduced a trap composed of 180 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:55:56] [INFO ] Deduced a trap composed of 183 places in 189 ms of which 2 ms to minimize.
[2024-06-01 13:55:56] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:55:57] [INFO ] Deduced a trap composed of 171 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:55:57] [INFO ] Deduced a trap composed of 162 places in 179 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-06-01 13:55:58] [INFO ] Deduced a trap composed of 179 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:55:58] [INFO ] Deduced a trap composed of 188 places in 195 ms of which 2 ms to minimize.
[2024-06-01 13:55:59] [INFO ] Deduced a trap composed of 185 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:55:59] [INFO ] Deduced a trap composed of 168 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:55:59] [INFO ] Deduced a trap composed of 171 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:55:59] [INFO ] Deduced a trap composed of 162 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:56:00] [INFO ] Deduced a trap composed of 162 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:56:00] [INFO ] Deduced a trap composed of 189 places in 171 ms of which 3 ms to minimize.
[2024-06-01 13:56:00] [INFO ] Deduced a trap composed of 184 places in 163 ms of which 2 ms to minimize.
[2024-06-01 13:56:00] [INFO ] Deduced a trap composed of 185 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:56:00] [INFO ] Deduced a trap composed of 177 places in 205 ms of which 2 ms to minimize.
[2024-06-01 13:56:01] [INFO ] Deduced a trap composed of 181 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:56:01] [INFO ] Deduced a trap composed of 205 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:56:01] [INFO ] Deduced a trap composed of 183 places in 194 ms of which 2 ms to minimize.
[2024-06-01 13:56:01] [INFO ] Deduced a trap composed of 180 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:56:01] [INFO ] Deduced a trap composed of 182 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:56:01] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:56:02] [INFO ] Deduced a trap composed of 158 places in 185 ms of which 3 ms to minimize.
[2024-06-01 13:56:02] [INFO ] Deduced a trap composed of 168 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:56:02] [INFO ] Deduced a trap composed of 197 places in 191 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-06-01 13:56:04] [INFO ] Deduced a trap composed of 163 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:56:04] [INFO ] Deduced a trap composed of 199 places in 209 ms of which 2 ms to minimize.
[2024-06-01 13:56:04] [INFO ] Deduced a trap composed of 176 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:56:04] [INFO ] Deduced a trap composed of 172 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:56:05] [INFO ] Deduced a trap composed of 206 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:56:05] [INFO ] Deduced a trap composed of 164 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:56:05] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 2 ms to minimize.
[2024-06-01 13:56:05] [INFO ] Deduced a trap composed of 171 places in 209 ms of which 2 ms to minimize.
[2024-06-01 13:56:06] [INFO ] Deduced a trap composed of 179 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:56:06] [INFO ] Deduced a trap composed of 167 places in 204 ms of which 2 ms to minimize.
[2024-06-01 13:56:06] [INFO ] Deduced a trap composed of 181 places in 166 ms of which 2 ms to minimize.
[2024-06-01 13:56:06] [INFO ] Deduced a trap composed of 165 places in 131 ms of which 1 ms to minimize.
[2024-06-01 13:56:07] [INFO ] Deduced a trap composed of 194 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:56:07] [INFO ] Deduced a trap composed of 197 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:56:07] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 2 ms to minimize.
[2024-06-01 13:56:07] [INFO ] Deduced a trap composed of 159 places in 215 ms of which 3 ms to minimize.
[2024-06-01 13:56:08] [INFO ] Deduced a trap composed of 177 places in 191 ms of which 2 ms to minimize.
SMT process timed out in 61245ms, After SMT, problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 61253ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 104538 ms. Remains : 364/364 places, 868/868 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 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 61 steps (0 resets) in 6 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2116 reset in 364 ms.
Product exploration explored 100000 steps with 2123 reset in 367 ms.
Support contains 5 out of 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 868/868 transitions.
Applied a total of 0 rules in 16 ms. Remains 364 /364 variables (removed 0) and now considering 868/868 (removed 0) transitions.
Running 864 sub problems to find dead transitions.
[2024-06-01 13:56:09] [INFO ] Flow matrix only has 844 transitions (discarded 24 similar events)
[2024-06-01 13:56:09] [INFO ] Invariant cache hit.
[2024-06-01 13:56:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-06-01 13:56:14] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:56:14] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:56:14] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:56:14] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:56:14] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:56:15] [INFO ] Deduced a trap composed of 157 places in 182 ms of which 2 ms to minimize.
[2024-06-01 13:56:15] [INFO ] Deduced a trap composed of 150 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:56:15] [INFO ] Deduced a trap composed of 147 places in 196 ms of which 2 ms to minimize.
[2024-06-01 13:56:15] [INFO ] Deduced a trap composed of 175 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:56:15] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:56:16] [INFO ] Deduced a trap composed of 156 places in 173 ms of which 2 ms to minimize.
[2024-06-01 13:56:16] [INFO ] Deduced a trap composed of 152 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:56:16] [INFO ] Deduced a trap composed of 163 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:56:16] [INFO ] Deduced a trap composed of 143 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:56:16] [INFO ] Deduced a trap composed of 144 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:56:17] [INFO ] Deduced a trap composed of 182 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:56:17] [INFO ] Deduced a trap composed of 144 places in 161 ms of which 2 ms to minimize.
[2024-06-01 13:56:17] [INFO ] Deduced a trap composed of 144 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:56:17] [INFO ] Deduced a trap composed of 165 places in 187 ms of which 2 ms to minimize.
[2024-06-01 13:56:17] [INFO ] Deduced a trap composed of 162 places in 167 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-06-01 13:56:17] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:56:18] [INFO ] Deduced a trap composed of 124 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:56:18] [INFO ] Deduced a trap composed of 177 places in 163 ms of which 4 ms to minimize.
[2024-06-01 13:56:18] [INFO ] Deduced a trap composed of 181 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:56:18] [INFO ] Deduced a trap composed of 156 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:56:18] [INFO ] Deduced a trap composed of 142 places in 204 ms of which 3 ms to minimize.
[2024-06-01 13:56:19] [INFO ] Deduced a trap composed of 135 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:56:19] [INFO ] Deduced a trap composed of 154 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:56:19] [INFO ] Deduced a trap composed of 171 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:56:19] [INFO ] Deduced a trap composed of 133 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:56:19] [INFO ] Deduced a trap composed of 160 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:56:19] [INFO ] Deduced a trap composed of 154 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:56:20] [INFO ] Deduced a trap composed of 142 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:56:20] [INFO ] Deduced a trap composed of 158 places in 170 ms of which 2 ms to minimize.
[2024-06-01 13:56:20] [INFO ] Deduced a trap composed of 148 places in 189 ms of which 3 ms to minimize.
[2024-06-01 13:56:20] [INFO ] Deduced a trap composed of 146 places in 164 ms of which 3 ms to minimize.
[2024-06-01 13:56:20] [INFO ] Deduced a trap composed of 172 places in 161 ms of which 2 ms to minimize.
[2024-06-01 13:56:21] [INFO ] Deduced a trap composed of 146 places in 161 ms of which 2 ms to minimize.
[2024-06-01 13:56:21] [INFO ] Deduced a trap composed of 169 places in 161 ms of which 2 ms to minimize.
[2024-06-01 13:56:21] [INFO ] Deduced a trap composed of 150 places in 158 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-06-01 13:56:26] [INFO ] Deduced a trap composed of 164 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:56:27] [INFO ] Deduced a trap composed of 147 places in 217 ms of which 2 ms to minimize.
[2024-06-01 13:56:27] [INFO ] Deduced a trap composed of 168 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:56:27] [INFO ] Deduced a trap composed of 149 places in 210 ms of which 2 ms to minimize.
[2024-06-01 13:56:28] [INFO ] Deduced a trap composed of 167 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:56:28] [INFO ] Deduced a trap composed of 148 places in 189 ms of which 2 ms to minimize.
[2024-06-01 13:56:28] [INFO ] Deduced a trap composed of 177 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:56:28] [INFO ] Deduced a trap composed of 171 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:56:28] [INFO ] Deduced a trap composed of 170 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:56:28] [INFO ] Deduced a trap composed of 160 places in 180 ms of which 2 ms to minimize.
[2024-06-01 13:56:29] [INFO ] Deduced a trap composed of 150 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:56:29] [INFO ] Deduced a trap composed of 181 places in 192 ms of which 2 ms to minimize.
[2024-06-01 13:56:29] [INFO ] Deduced a trap composed of 149 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:56:29] [INFO ] Deduced a trap composed of 167 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:56:29] [INFO ] Deduced a trap composed of 181 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:56:30] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:56:30] [INFO ] Deduced a trap composed of 150 places in 161 ms of which 3 ms to minimize.
SMT process timed out in 20946ms, After SMT, problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 20954ms
[2024-06-01 13:56:30] [INFO ] Flow matrix only has 844 transitions (discarded 24 similar events)
[2024-06-01 13:56:30] [INFO ] Invariant cache hit.
[2024-06-01 13:56:30] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-06-01 13:56:30] [INFO ] Flow matrix only has 844 transitions (discarded 24 similar events)
[2024-06-01 13:56:30] [INFO ] Invariant cache hit.
[2024-06-01 13:56:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:57:06] [INFO ] Performed 104/364 implicitness test of which 0 returned IMPLICIT in 35 seconds.
[2024-06-01 13:57:10] [INFO ] Implicit Places using invariants and state equation in 39837 ms returned []
Implicit Place search using SMT with State Equation took 40126 ms to find 0 implicit places.
[2024-06-01 13:57:10] [INFO ] Redundant transitions in 8 ms returned []
Running 864 sub problems to find dead transitions.
[2024-06-01 13:57:10] [INFO ] Flow matrix only has 844 transitions (discarded 24 similar events)
[2024-06-01 13:57:10] [INFO ] Invariant cache hit.
[2024-06-01 13:57:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-06-01 13:57:16] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:57:16] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:57:16] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:57:16] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:57:16] [INFO ] Deduced a trap composed of 46 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:57:17] [INFO ] Deduced a trap composed of 157 places in 166 ms of which 3 ms to minimize.
[2024-06-01 13:57:17] [INFO ] Deduced a trap composed of 150 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:57:17] [INFO ] Deduced a trap composed of 147 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:57:17] [INFO ] Deduced a trap composed of 175 places in 164 ms of which 2 ms to minimize.
[2024-06-01 13:57:17] [INFO ] Deduced a trap composed of 158 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:57:17] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 2 ms to minimize.
[2024-06-01 13:57:18] [INFO ] Deduced a trap composed of 152 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:57:18] [INFO ] Deduced a trap composed of 163 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:57:18] [INFO ] Deduced a trap composed of 143 places in 183 ms of which 2 ms to minimize.
[2024-06-01 13:57:18] [INFO ] Deduced a trap composed of 144 places in 175 ms of which 2 ms to minimize.
[2024-06-01 13:57:18] [INFO ] Deduced a trap composed of 182 places in 190 ms of which 2 ms to minimize.
[2024-06-01 13:57:19] [INFO ] Deduced a trap composed of 144 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:57:19] [INFO ] Deduced a trap composed of 144 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:57:19] [INFO ] Deduced a trap composed of 165 places in 186 ms of which 2 ms to minimize.
[2024-06-01 13:57:19] [INFO ] Deduced a trap composed of 162 places in 272 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-06-01 13:57:20] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 0 ms to minimize.
[2024-06-01 13:57:20] [INFO ] Deduced a trap composed of 124 places in 237 ms of which 3 ms to minimize.
[2024-06-01 13:57:20] [INFO ] Deduced a trap composed of 177 places in 244 ms of which 2 ms to minimize.
[2024-06-01 13:57:20] [INFO ] Deduced a trap composed of 181 places in 223 ms of which 2 ms to minimize.
[2024-06-01 13:57:21] [INFO ] Deduced a trap composed of 156 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:57:21] [INFO ] Deduced a trap composed of 142 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:57:21] [INFO ] Deduced a trap composed of 135 places in 202 ms of which 2 ms to minimize.
[2024-06-01 13:57:21] [INFO ] Deduced a trap composed of 154 places in 192 ms of which 2 ms to minimize.
[2024-06-01 13:57:21] [INFO ] Deduced a trap composed of 171 places in 178 ms of which 2 ms to minimize.
[2024-06-01 13:57:22] [INFO ] Deduced a trap composed of 133 places in 170 ms of which 2 ms to minimize.
[2024-06-01 13:57:22] [INFO ] Deduced a trap composed of 160 places in 178 ms of which 3 ms to minimize.
[2024-06-01 13:57:22] [INFO ] Deduced a trap composed of 154 places in 178 ms of which 2 ms to minimize.
[2024-06-01 13:57:22] [INFO ] Deduced a trap composed of 142 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:57:22] [INFO ] Deduced a trap composed of 158 places in 166 ms of which 2 ms to minimize.
[2024-06-01 13:57:23] [INFO ] Deduced a trap composed of 148 places in 190 ms of which 2 ms to minimize.
[2024-06-01 13:57:23] [INFO ] Deduced a trap composed of 146 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:57:23] [INFO ] Deduced a trap composed of 172 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:57:23] [INFO ] Deduced a trap composed of 146 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:57:23] [INFO ] Deduced a trap composed of 169 places in 193 ms of which 2 ms to minimize.
[2024-06-01 13:57:24] [INFO ] Deduced a trap composed of 150 places in 179 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-06-01 13:57:29] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:57:29] [INFO ] Deduced a trap composed of 147 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:57:30] [INFO ] Deduced a trap composed of 168 places in 248 ms of which 3 ms to minimize.
[2024-06-01 13:57:30] [INFO ] Deduced a trap composed of 149 places in 224 ms of which 2 ms to minimize.
[2024-06-01 13:57:30] [INFO ] Deduced a trap composed of 167 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:57:31] [INFO ] Deduced a trap composed of 148 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:57:31] [INFO ] Deduced a trap composed of 177 places in 180 ms of which 2 ms to minimize.
[2024-06-01 13:57:31] [INFO ] Deduced a trap composed of 171 places in 170 ms of which 2 ms to minimize.
[2024-06-01 13:57:31] [INFO ] Deduced a trap composed of 170 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:57:31] [INFO ] Deduced a trap composed of 160 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:57:31] [INFO ] Deduced a trap composed of 150 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:57:32] [INFO ] Deduced a trap composed of 181 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:57:32] [INFO ] Deduced a trap composed of 149 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:57:32] [INFO ] Deduced a trap composed of 167 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:57:32] [INFO ] Deduced a trap composed of 181 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:57:32] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:57:32] [INFO ] Deduced a trap composed of 150 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:57:33] [INFO ] Deduced a trap composed of 170 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:57:33] [INFO ] Deduced a trap composed of 168 places in 244 ms of which 2 ms to minimize.
[2024-06-01 13:57:33] [INFO ] Deduced a trap composed of 156 places in 157 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-06-01 13:57:34] [INFO ] Deduced a trap composed of 182 places in 216 ms of which 2 ms to minimize.
[2024-06-01 13:57:34] [INFO ] Deduced a trap composed of 157 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:57:34] [INFO ] Deduced a trap composed of 151 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:57:34] [INFO ] Deduced a trap composed of 153 places in 127 ms of which 2 ms to minimize.
[2024-06-01 13:57:34] [INFO ] Deduced a trap composed of 160 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:57:35] [INFO ] Deduced a trap composed of 176 places in 205 ms of which 4 ms to minimize.
[2024-06-01 13:57:35] [INFO ] Deduced a trap composed of 157 places in 174 ms of which 2 ms to minimize.
[2024-06-01 13:57:35] [INFO ] Deduced a trap composed of 158 places in 170 ms of which 2 ms to minimize.
[2024-06-01 13:57:36] [INFO ] Deduced a trap composed of 157 places in 170 ms of which 3 ms to minimize.
[2024-06-01 13:57:36] [INFO ] Deduced a trap composed of 148 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:57:36] [INFO ] Deduced a trap composed of 162 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:57:36] [INFO ] Deduced a trap composed of 133 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:57:36] [INFO ] Deduced a trap composed of 165 places in 131 ms of which 2 ms to minimize.
[2024-06-01 13:57:36] [INFO ] Deduced a trap composed of 160 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:57:37] [INFO ] Deduced a trap composed of 147 places in 152 ms of which 3 ms to minimize.
[2024-06-01 13:57:37] [INFO ] Deduced a trap composed of 174 places in 161 ms of which 2 ms to minimize.
[2024-06-01 13:57:37] [INFO ] Deduced a trap composed of 139 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:57:37] [INFO ] Deduced a trap composed of 179 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:57:37] [INFO ] Deduced a trap composed of 156 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:57:37] [INFO ] Deduced a trap composed of 145 places in 147 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-06-01 13:57:38] [INFO ] Deduced a trap composed of 143 places in 239 ms of which 3 ms to minimize.
[2024-06-01 13:57:39] [INFO ] Deduced a trap composed of 136 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:57:39] [INFO ] Deduced a trap composed of 149 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:57:39] [INFO ] Deduced a trap composed of 136 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:57:39] [INFO ] Deduced a trap composed of 147 places in 201 ms of which 2 ms to minimize.
[2024-06-01 13:57:40] [INFO ] Deduced a trap composed of 198 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:57:40] [INFO ] Deduced a trap composed of 146 places in 167 ms of which 3 ms to minimize.
[2024-06-01 13:57:40] [INFO ] Deduced a trap composed of 163 places in 170 ms of which 2 ms to minimize.
[2024-06-01 13:57:40] [INFO ] Deduced a trap composed of 133 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:57:40] [INFO ] Deduced a trap composed of 167 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:57:41] [INFO ] Deduced a trap composed of 194 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:57:41] [INFO ] Deduced a trap composed of 172 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:57:41] [INFO ] Deduced a trap composed of 181 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:57:41] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
SMT process timed out in 31226ms, After SMT, problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 31241ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 92354 ms. Remains : 364/364 places, 868/868 transitions.
Treatment of property PolyORBLF-COL-S04J04T06-LTLCardinality-10 finished in 315523 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 6 out of 542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 542/542 places, 1366/1366 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 538 transition count 1324
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 496 transition count 1324
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 84 place count 496 transition count 1264
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 204 place count 436 transition count 1264
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 324 place count 376 transition count 1204
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 330 place count 370 transition count 1198
Iterating global reduction 2 with 6 rules applied. Total rules applied 336 place count 370 transition count 1198
Applied a total of 336 rules in 144 ms. Remains 370 /542 variables (removed 172) and now considering 1198/1366 (removed 168) transitions.
Running 1194 sub problems to find dead transitions.
[2024-06-01 13:57:42] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
// Phase 1: matrix 1174 rows 370 cols
[2024-06-01 13:57:42] [INFO ] Computed 40 invariants in 17 ms
[2024-06-01 13:57:42] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-06-01 13:57:55] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:57:55] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:57:55] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:57:55] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:57:55] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:57:56] [INFO ] Deduced a trap composed of 164 places in 256 ms of which 2 ms to minimize.
[2024-06-01 13:57:56] [INFO ] Deduced a trap composed of 145 places in 309 ms of which 3 ms to minimize.
[2024-06-01 13:57:57] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:57:58] [INFO ] Deduced a trap composed of 184 places in 197 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1544 variables, and 45 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 20/22 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-06-01 13:58:13] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-06-01 13:58:21] [INFO ] Deduced a trap composed of 213 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:58:21] [INFO ] Deduced a trap composed of 120 places in 187 ms of which 2 ms to minimize.
[2024-06-01 13:58:22] [INFO ] Deduced a trap composed of 118 places in 186 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1544 variables, and 49 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 20/22 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 13/13 constraints]
After SMT, in 46570ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 46613ms
[2024-06-01 13:58:28] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-06-01 13:58:28] [INFO ] Invariant cache hit.
[2024-06-01 13:58:29] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-06-01 13:58:29] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-06-01 13:58:29] [INFO ] Invariant cache hit.
[2024-06-01 13:58:29] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:58:33] [INFO ] Implicit Places using invariants and state equation in 4264 ms returned []
Implicit Place search using SMT with State Equation took 4655 ms to find 0 implicit places.
[2024-06-01 13:58:33] [INFO ] Redundant transitions in 9 ms returned []
Running 1194 sub problems to find dead transitions.
[2024-06-01 13:58:33] [INFO ] Flow matrix only has 1174 transitions (discarded 24 similar events)
[2024-06-01 13:58:33] [INFO ] Invariant cache hit.
[2024-06-01 13:58:33] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 2 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 168 places in 281 ms of which 3 ms to minimize.
[2024-06-01 13:58:46] [INFO ] Deduced a trap composed of 151 places in 256 ms of which 3 ms to minimize.
[2024-06-01 13:58:47] [INFO ] Deduced a trap composed of 184 places in 185 ms of which 2 ms to minimize.
[2024-06-01 13:58:57] [INFO ] Deduced a trap composed of 120 places in 239 ms of which 2 ms to minimize.
[2024-06-01 13:58:58] [INFO ] Deduced a trap composed of 103 places in 231 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-06-01 13:59:00] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 1 ms to minimize.
[2024-06-01 13:59:00] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1544 variables, and 49 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 20/22 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1194/1194 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-06-01 13:59:09] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-06-01 13:59:17] [INFO ] Deduced a trap composed of 57 places in 272 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1194 unsolved
[2024-06-01 13:59:26] [INFO ] Deduced a trap composed of 126 places in 210 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/1544 variables, and 52 constraints, problems are : Problem set: 0 solved, 1194 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 20/22 constraints, State Equation: 0/370 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1194 constraints, Known Traps: 16/16 constraints]
After SMT, in 64820ms problems are : Problem set: 0 solved, 1194 unsolved
Search for dead transitions found 0 dead transitions in 64832ms
Starting structural reductions in SI_LTL mode, iteration 1 : 370/542 places, 1198/1366 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116268 ms. Remains : 370/542 places, 1198/1366 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLCardinality-12
Product exploration explored 100000 steps with 13 reset in 344 ms.
Stack based approach found an accepted trace after 3300 steps with 0 reset with depth 3301 and stack size 3301 in 15 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S04J04T06-LTLCardinality-12 finished in 116682 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)||G(F(p1)))))'
Support contains 65 out of 542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 542/542 places, 1366/1366 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 538 transition count 1324
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 496 transition count 1324
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 84 place count 496 transition count 1288
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 156 place count 460 transition count 1288
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 228 place count 424 transition count 1252
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 234 place count 418 transition count 1246
Iterating global reduction 2 with 6 rules applied. Total rules applied 240 place count 418 transition count 1246
Applied a total of 240 rules in 67 ms. Remains 418 /542 variables (removed 124) and now considering 1246/1366 (removed 120) transitions.
Running 1242 sub problems to find dead transitions.
[2024-06-01 13:59:38] [INFO ] Flow matrix only has 1222 transitions (discarded 24 similar events)
// Phase 1: matrix 1222 rows 418 cols
[2024-06-01 13:59:38] [INFO ] Computed 40 invariants in 37 ms
[2024-06-01 13:59:38] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
[2024-06-01 13:59:51] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:59:51] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:59:51] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:59:51] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:59:52] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:59:52] [INFO ] Deduced a trap composed of 89 places in 251 ms of which 3 ms to minimize.
[2024-06-01 13:59:52] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:59:53] [INFO ] Deduced a trap composed of 240 places in 327 ms of which 3 ms to minimize.
[2024-06-01 13:59:53] [INFO ] Deduced a trap composed of 196 places in 311 ms of which 3 ms to minimize.
[2024-06-01 13:59:54] [INFO ] Deduced a trap composed of 195 places in 285 ms of which 3 ms to minimize.
[2024-06-01 14:00:01] [INFO ] Deduced a trap composed of 252 places in 239 ms of which 3 ms to minimize.
[2024-06-01 14:00:02] [INFO ] Deduced a trap composed of 160 places in 290 ms of which 3 ms to minimize.
[2024-06-01 14:00:03] [INFO ] Deduced a trap composed of 174 places in 297 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 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 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 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 10.0)
(s105 1.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 1.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 1.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 1.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 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(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 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/1640 variables, and 49 constraints, problems are : Problem set: 0 solved, 1242 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1242/1242 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
[2024-06-01 14:00:05] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 2 ms to minimize.
[2024-06-01 14:00:06] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 1 ms to minimize.
[2024-06-01 14:00:06] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-06-01 14:00:08] [INFO ] Deduced a trap composed of 208 places in 250 ms of which 3 ms to minimize.
[2024-06-01 14:00:19] [INFO ] Deduced a trap composed of 174 places in 210 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/1640 variables, and 54 constraints, problems are : Problem set: 0 solved, 1242 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1242 constraints, Known Traps: 18/18 constraints]
After SMT, in 45171ms problems are : Problem set: 0 solved, 1242 unsolved
Search for dead transitions found 0 dead transitions in 45186ms
[2024-06-01 14:00:23] [INFO ] Flow matrix only has 1222 transitions (discarded 24 similar events)
[2024-06-01 14:00:23] [INFO ] Invariant cache hit.
[2024-06-01 14:00:24] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-06-01 14:00:24] [INFO ] Flow matrix only has 1222 transitions (discarded 24 similar events)
[2024-06-01 14:00:24] [INFO ] Invariant cache hit.
[2024-06-01 14:00:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:00:29] [INFO ] Implicit Places using invariants and state equation in 4991 ms returned []
Implicit Place search using SMT with State Equation took 5433 ms to find 0 implicit places.
[2024-06-01 14:00:29] [INFO ] Redundant transitions in 21 ms returned []
Running 1242 sub problems to find dead transitions.
[2024-06-01 14:00:29] [INFO ] Flow matrix only has 1222 transitions (discarded 24 similar events)
[2024-06-01 14:00:29] [INFO ] Invariant cache hit.
[2024-06-01 14:00:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
[2024-06-01 14:00:42] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 2 ms to minimize.
[2024-06-01 14:00:43] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 2 ms to minimize.
[2024-06-01 14:00:43] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:00:43] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:00:43] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:00:43] [INFO ] Deduced a trap composed of 87 places in 243 ms of which 3 ms to minimize.
[2024-06-01 14:00:43] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:00:44] [INFO ] Deduced a trap composed of 200 places in 254 ms of which 3 ms to minimize.
[2024-06-01 14:00:45] [INFO ] Deduced a trap composed of 221 places in 300 ms of which 3 ms to minimize.
[2024-06-01 14:00:45] [INFO ] Deduced a trap composed of 207 places in 280 ms of which 3 ms to minimize.
[2024-06-01 14:00:45] [INFO ] Deduced a trap composed of 195 places in 271 ms of which 3 ms to minimize.
[2024-06-01 14:00:45] [INFO ] Deduced a trap composed of 215 places in 276 ms of which 3 ms to minimize.
[2024-06-01 14:00:46] [INFO ] Deduced a trap composed of 202 places in 274 ms of which 3 ms to minimize.
[2024-06-01 14:00:46] [INFO ] Deduced a trap composed of 228 places in 253 ms of which 2 ms to minimize.
[2024-06-01 14:00:46] [INFO ] Deduced a trap composed of 194 places in 273 ms of which 3 ms to minimize.
[2024-06-01 14:00:47] [INFO ] Deduced a trap composed of 212 places in 272 ms of which 2 ms to minimize.
[2024-06-01 14:00:47] [INFO ] Deduced a trap composed of 51 places in 189 ms of which 2 ms to minimize.
[2024-06-01 14:00:58] [INFO ] Deduced a trap composed of 207 places in 264 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/1640 variables, and 54 constraints, problems are : Problem set: 0 solved, 1242 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1242/1242 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
[2024-06-01 14:01:08] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:01:16] [INFO ] Deduced a trap composed of 36 places in 303 ms of which 6 ms to minimize.
[2024-06-01 14:01:21] [INFO ] Deduced a trap composed of 174 places in 230 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/1640 variables, and 57 constraints, problems are : Problem set: 0 solved, 1242 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1242 constraints, Known Traps: 21/21 constraints]
After SMT, in 66443ms problems are : Problem set: 0 solved, 1242 unsolved
Search for dead transitions found 0 dead transitions in 66465ms
Starting structural reductions in SI_LTL mode, iteration 1 : 418/542 places, 1246/1366 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117186 ms. Remains : 418/542 places, 1246/1366 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLCardinality-13
Product exploration explored 100000 steps with 670 reset in 377 ms.
Product exploration explored 100000 steps with 622 reset in 393 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 p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 245 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 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 626 ms. (63 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 229 ms. (173 steps per ms) remains 1/1 properties
[2024-06-01 14:01:37] [INFO ] Flow matrix only has 1222 transitions (discarded 24 similar events)
[2024-06-01 14:01:37] [INFO ] Invariant cache hit.
[2024-06-01 14:01:37] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 176/241 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/251 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 158/409 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/413 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/416 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1222/1638 variables, 416/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1638 variables, 120/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1638 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1640 variables, 2/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1640 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1640 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1640 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1640/1640 variables, and 578 constraints, problems are : Problem set: 0 solved, 1 unsolved in 719 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 418/418 constraints, ReadFeed: 120/120 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/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 241/1640 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 5/15 constraints, Generalized P Invariants (flows): 0/25 constraints, State Equation: 0/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 846ms 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 p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 324 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Support contains 40 out of 418 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 : 418/418 places, 1246/1246 transitions.
Applied a total of 0 rules in 31 ms. Remains 418 /418 variables (removed 0) and now considering 1246/1246 (removed 0) transitions.
Running 1242 sub problems to find dead transitions.
[2024-06-01 14:01:38] [INFO ] Flow matrix only has 1222 transitions (discarded 24 similar events)
[2024-06-01 14:01:38] [INFO ] Invariant cache hit.
[2024-06-01 14:01:38] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
[2024-06-01 14:01:50] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:01:50] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:01:51] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:01:51] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:01:51] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:01:51] [INFO ] Deduced a trap composed of 87 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:01:51] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:01:51] [INFO ] Deduced a trap composed of 200 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:01:52] [INFO ] Deduced a trap composed of 221 places in 210 ms of which 2 ms to minimize.
[2024-06-01 14:01:52] [INFO ] Deduced a trap composed of 207 places in 210 ms of which 2 ms to minimize.
[2024-06-01 14:01:52] [INFO ] Deduced a trap composed of 195 places in 222 ms of which 2 ms to minimize.
[2024-06-01 14:01:53] [INFO ] Deduced a trap composed of 215 places in 288 ms of which 3 ms to minimize.
[2024-06-01 14:01:53] [INFO ] Deduced a trap composed of 202 places in 289 ms of which 3 ms to minimize.
[2024-06-01 14:01:53] [INFO ] Deduced a trap composed of 228 places in 215 ms of which 2 ms to minimize.
[2024-06-01 14:01:54] [INFO ] Deduced a trap composed of 194 places in 208 ms of which 2 ms to minimize.
[2024-06-01 14:01:54] [INFO ] Deduced a trap composed of 212 places in 209 ms of which 2 ms to minimize.
[2024-06-01 14:01:55] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/1640 variables, and 53 constraints, problems are : Problem set: 0 solved, 1242 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1242/1242 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
[2024-06-01 14:02:16] [INFO ] Deduced a trap composed of 36 places in 302 ms of which 2 ms to minimize.
[2024-06-01 14:02:19] [INFO ] Deduced a trap composed of 245 places in 267 ms of which 4 ms to minimize.
[2024-06-01 14:02:19] [INFO ] Deduced a trap composed of 174 places in 190 ms of which 2 ms to minimize.
[2024-06-01 14:02:20] [INFO ] Deduced a trap composed of 208 places in 239 ms of which 3 ms to minimize.
[2024-06-01 14:02:20] [INFO ] Deduced a trap composed of 190 places in 236 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/1640 variables, and 58 constraints, problems are : Problem set: 0 solved, 1242 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1242 constraints, Known Traps: 22/22 constraints]
After SMT, in 45148ms problems are : Problem set: 0 solved, 1242 unsolved
Search for dead transitions found 0 dead transitions in 45171ms
[2024-06-01 14:02:23] [INFO ] Flow matrix only has 1222 transitions (discarded 24 similar events)
[2024-06-01 14:02:23] [INFO ] Invariant cache hit.
[2024-06-01 14:02:24] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-06-01 14:02:24] [INFO ] Flow matrix only has 1222 transitions (discarded 24 similar events)
[2024-06-01 14:02:24] [INFO ] Invariant cache hit.
[2024-06-01 14:02:24] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:02:29] [INFO ] Implicit Places using invariants and state equation in 4836 ms returned []
Implicit Place search using SMT with State Equation took 5341 ms to find 0 implicit places.
[2024-06-01 14:02:29] [INFO ] Redundant transitions in 25 ms returned []
Running 1242 sub problems to find dead transitions.
[2024-06-01 14:02:29] [INFO ] Flow matrix only has 1222 transitions (discarded 24 similar events)
[2024-06-01 14:02:29] [INFO ] Invariant cache hit.
[2024-06-01 14:02:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
[2024-06-01 14:02:41] [INFO ] Deduced a trap composed of 55 places in 136 ms of which 2 ms to minimize.
[2024-06-01 14:02:41] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 2 ms to minimize.
[2024-06-01 14:02:41] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 0 ms to minimize.
[2024-06-01 14:02:41] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 0 ms to minimize.
[2024-06-01 14:02:41] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 0 ms to minimize.
[2024-06-01 14:02:41] [INFO ] Deduced a trap composed of 87 places in 245 ms of which 3 ms to minimize.
[2024-06-01 14:02:42] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:02:42] [INFO ] Deduced a trap composed of 200 places in 259 ms of which 2 ms to minimize.
[2024-06-01 14:02:43] [INFO ] Deduced a trap composed of 221 places in 299 ms of which 3 ms to minimize.
[2024-06-01 14:02:43] [INFO ] Deduced a trap composed of 207 places in 318 ms of which 3 ms to minimize.
[2024-06-01 14:02:43] [INFO ] Deduced a trap composed of 195 places in 273 ms of which 2 ms to minimize.
[2024-06-01 14:02:44] [INFO ] Deduced a trap composed of 215 places in 242 ms of which 2 ms to minimize.
[2024-06-01 14:02:44] [INFO ] Deduced a trap composed of 202 places in 232 ms of which 2 ms to minimize.
[2024-06-01 14:02:44] [INFO ] Deduced a trap composed of 228 places in 236 ms of which 10 ms to minimize.
[2024-06-01 14:02:44] [INFO ] Deduced a trap composed of 194 places in 274 ms of which 3 ms to minimize.
[2024-06-01 14:02:45] [INFO ] Deduced a trap composed of 212 places in 267 ms of which 2 ms to minimize.
[2024-06-01 14:02:46] [INFO ] Deduced a trap composed of 51 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:02:56] [INFO ] Deduced a trap composed of 207 places in 264 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/1640 variables, and 54 constraints, problems are : Problem set: 0 solved, 1242 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1242/1242 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 1242 unsolved
[2024-06-01 14:03:06] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2024-06-01 14:03:14] [INFO ] Deduced a trap composed of 36 places in 280 ms of which 2 ms to minimize.
[2024-06-01 14:03:18] [INFO ] Deduced a trap composed of 174 places in 207 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1242 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 414/1640 variables, and 57 constraints, problems are : Problem set: 0 solved, 1242 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1242 constraints, Known Traps: 21/21 constraints]
After SMT, in 64955ms problems are : Problem set: 0 solved, 1242 unsolved
Search for dead transitions found 0 dead transitions in 64980ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 115563 ms. Remains : 418/418 places, 1246/1246 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 545 steps (0 resets) in 9 ms. (54 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 635 reset in 313 ms.
Product exploration explored 100000 steps with 642 reset in 314 ms.
Support contains 40 out of 418 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 418/418 places, 1246/1246 transitions.
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 0 place count 418 transition count 1222
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 394 transition count 1222
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 388 transition count 1216
Applied a total of 60 rules in 26 ms. Remains 388 /418 variables (removed 30) and now considering 1216/1246 (removed 30) transitions.
Running 1212 sub problems to find dead transitions.
[2024-06-01 14:03:35] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
// Phase 1: matrix 1192 rows 388 cols
[2024-06-01 14:03:35] [INFO ] Computed 40 invariants in 30 ms
[2024-06-01 14:03:35] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-06-01 14:03:47] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 2 ms to minimize.
[2024-06-01 14:03:47] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 1 ms to minimize.
[2024-06-01 14:03:47] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:03:47] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 0 ms to minimize.
[2024-06-01 14:03:47] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:03:47] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:03:48] [INFO ] Deduced a trap composed of 177 places in 290 ms of which 3 ms to minimize.
[2024-06-01 14:03:57] [INFO ] Deduced a trap composed of 83 places in 243 ms of which 3 ms to minimize.
[2024-06-01 14:03:58] [INFO ] Deduced a trap composed of 198 places in 318 ms of which 3 ms to minimize.
[2024-06-01 14:03:58] [INFO ] Deduced a trap composed of 182 places in 280 ms of which 2 ms to minimize.
[2024-06-01 14:03:58] [INFO ] Deduced a trap composed of 177 places in 319 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-06-01 14:03:59] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 1 ms to minimize.
[2024-06-01 14:04:00] [INFO ] Deduced a trap composed of 127 places in 237 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/1580 variables, and 49 constraints, problems are : Problem set: 0 solved, 1212 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1212/1212 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-06-01 14:04:02] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 2 ms to minimize.
[2024-06-01 14:04:02] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:04:16] [INFO ] Deduced a trap composed of 144 places in 310 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/1580 variables, and 52 constraints, problems are : Problem set: 0 solved, 1212 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1212 constraints, Known Traps: 16/16 constraints]
After SMT, in 44739ms problems are : Problem set: 0 solved, 1212 unsolved
Search for dead transitions found 0 dead transitions in 44750ms
[2024-06-01 14:04:20] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
[2024-06-01 14:04:20] [INFO ] Invariant cache hit.
[2024-06-01 14:04:20] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-06-01 14:04:20] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
[2024-06-01 14:04:20] [INFO ] Invariant cache hit.
[2024-06-01 14:04:20] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:04:25] [INFO ] Implicit Places using invariants and state equation in 5241 ms returned []
Implicit Place search using SMT with State Equation took 5564 ms to find 0 implicit places.
[2024-06-01 14:04:25] [INFO ] Redundant transitions in 18 ms returned []
Running 1212 sub problems to find dead transitions.
[2024-06-01 14:04:25] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
[2024-06-01 14:04:25] [INFO ] Invariant cache hit.
[2024-06-01 14:04:25] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-06-01 14:04:38] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 2 ms to minimize.
[2024-06-01 14:04:38] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-06-01 14:04:38] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:04:38] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 0 ms to minimize.
[2024-06-01 14:04:38] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:04:39] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 0 ms to minimize.
[2024-06-01 14:04:39] [INFO ] Deduced a trap composed of 149 places in 289 ms of which 3 ms to minimize.
[2024-06-01 14:04:40] [INFO ] Deduced a trap composed of 173 places in 384 ms of which 2 ms to minimize.
[2024-06-01 14:04:40] [INFO ] Deduced a trap composed of 180 places in 230 ms of which 2 ms to minimize.
[2024-06-01 14:04:49] [INFO ] Deduced a trap composed of 155 places in 276 ms of which 3 ms to minimize.
[2024-06-01 14:04:49] [INFO ] Deduced a trap composed of 144 places in 224 ms of which 2 ms to minimize.
[2024-06-01 14:04:50] [INFO ] Deduced a trap composed of 50 places in 437 ms of which 3 ms to minimize.
[2024-06-01 14:04:50] [INFO ] Deduced a trap composed of 81 places in 369 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-06-01 14:04:53] [INFO ] Deduced a trap composed of 155 places in 185 ms of which 2 ms to minimize.
[2024-06-01 14:04:53] [INFO ] Deduced a trap composed of 154 places in 172 ms of which 2 ms to minimize.
[2024-06-01 14:04:53] [INFO ] Deduced a trap composed of 154 places in 256 ms of which 3 ms to minimize.
[2024-06-01 14:04:54] [INFO ] Deduced a trap composed of 202 places in 230 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 5.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 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 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 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 9.0)
(s105 1.0)
(s106 0.0)
(s107 1.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 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.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)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/1580 variables, and 53 constraints, problems are : Problem set: 0 solved, 1212 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1212/1212 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-06-01 14:05:02] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-06-01 14:05:14] [INFO ] Deduced a trap composed of 193 places in 194 ms of which 3 ms to minimize.
[2024-06-01 14:05:14] [INFO ] Deduced a trap composed of 179 places in 193 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/1580 variables, and 56 constraints, problems are : Problem set: 0 solved, 1212 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/388 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1212 constraints, Known Traps: 20/20 constraints]
After SMT, in 65027ms problems are : Problem set: 0 solved, 1212 unsolved
Search for dead transitions found 0 dead transitions in 65043ms
Starting structural reductions in SI_LTL mode, iteration 1 : 388/418 places, 1216/1246 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115415 ms. Remains : 388/418 places, 1216/1246 transitions.
Treatment of property PolyORBLF-COL-S04J04T06-LTLCardinality-13 finished in 352255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0) U p1))||G(p2)))'
Support contains 19 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 1366/1366 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 538 transition count 1366
Applied a total of 4 rules in 9 ms. Remains 538 /542 variables (removed 4) and now considering 1366/1366 (removed 0) transitions.
Running 1362 sub problems to find dead transitions.
[2024-06-01 14:05:30] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
// Phase 1: matrix 1342 rows 538 cols
[2024-06-01 14:05:31] [INFO ] Computed 40 invariants in 18 ms
[2024-06-01 14:05:31] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-06-01 14:05:46] [INFO ] Deduced a trap composed of 75 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:05:46] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 1 ms to minimize.
[2024-06-01 14:05:46] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:05:46] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:05:46] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:05:47] [INFO ] Deduced a trap composed of 356 places in 300 ms of which 4 ms to minimize.
[2024-06-01 14:05:47] [INFO ] Deduced a trap composed of 313 places in 271 ms of which 4 ms to minimize.
[2024-06-01 14:05:48] [INFO ] Deduced a trap composed of 133 places in 303 ms of which 4 ms to minimize.
[2024-06-01 14:05:48] [INFO ] Deduced a trap composed of 149 places in 248 ms of which 4 ms to minimize.
[2024-06-01 14:05:48] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:05:49] [INFO ] Deduced a trap composed of 284 places in 325 ms of which 4 ms to minimize.
[2024-06-01 14:05:49] [INFO ] Deduced a trap composed of 315 places in 297 ms of which 3 ms to minimize.
[2024-06-01 14:05:50] [INFO ] Deduced a trap composed of 322 places in 361 ms of which 4 ms to minimize.
[2024-06-01 14:05:55] [INFO ] Deduced a trap composed of 298 places in 312 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/1880 variables, and 50 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1362/1362 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-06-01 14:05:58] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 3 ms to minimize.
[2024-06-01 14:05:59] [INFO ] Deduced a trap composed of 63 places in 216 ms of which 2 ms to minimize.
[2024-06-01 14:06:05] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 2 ms to minimize.
[2024-06-01 14:06:05] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:06:13] [INFO ] Deduced a trap composed of 296 places in 219 ms of which 3 ms to minimize.
[2024-06-01 14:06:13] [INFO ] Deduced a trap composed of 275 places in 243 ms of which 3 ms to minimize.
[2024-06-01 14:06:14] [INFO ] Deduced a trap composed of 42 places in 262 ms of which 3 ms to minimize.
[2024-06-01 14:06:15] [INFO ] Deduced a trap composed of 295 places in 245 ms of which 3 ms to minimize.
[2024-06-01 14:06:15] [INFO ] Deduced a trap composed of 290 places in 265 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/1880 variables, and 59 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1362 constraints, Known Traps: 23/23 constraints]
After SMT, in 45403ms problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 45416ms
[2024-06-01 14:06:16] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2024-06-01 14:06:16] [INFO ] Invariant cache hit.
[2024-06-01 14:06:16] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-06-01 14:06:16] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2024-06-01 14:06:16] [INFO ] Invariant cache hit.
[2024-06-01 14:06:17] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:06:23] [INFO ] Implicit Places using invariants and state equation in 6846 ms returned []
Implicit Place search using SMT with State Equation took 7302 ms to find 0 implicit places.
Running 1362 sub problems to find dead transitions.
[2024-06-01 14:06:23] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2024-06-01 14:06:23] [INFO ] Invariant cache hit.
[2024-06-01 14:06:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-06-01 14:06:39] [INFO ] Deduced a trap composed of 75 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:06:40] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 2 ms to minimize.
[2024-06-01 14:06:40] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:06:40] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:06:41] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:06:42] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 2 ms to minimize.
[2024-06-01 14:06:44] [INFO ] Deduced a trap composed of 305 places in 366 ms of which 5 ms to minimize.
[2024-06-01 14:06:44] [INFO ] Deduced a trap composed of 328 places in 422 ms of which 4 ms to minimize.
[2024-06-01 14:06:44] [INFO ] Deduced a trap composed of 43 places in 316 ms of which 4 ms to minimize.
[2024-06-01 14:06:45] [INFO ] Deduced a trap composed of 321 places in 287 ms of which 3 ms to minimize.
[2024-06-01 14:06:45] [INFO ] Deduced a trap composed of 308 places in 372 ms of which 4 ms to minimize.
[2024-06-01 14:06:45] [INFO ] Deduced a trap composed of 314 places in 308 ms of which 4 ms to minimize.
[2024-06-01 14:06:46] [INFO ] Deduced a trap composed of 300 places in 363 ms of which 4 ms to minimize.
[2024-06-01 14:06:46] [INFO ] Deduced a trap composed of 40 places in 409 ms of which 3 ms to minimize.
[2024-06-01 14:06:47] [INFO ] Deduced a trap composed of 15 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:06:47] [INFO ] Deduced a trap composed of 338 places in 262 ms of which 3 ms to minimize.
[2024-06-01 14:06:47] [INFO ] Deduced a trap composed of 318 places in 259 ms of which 3 ms to minimize.
[2024-06-01 14:06:48] [INFO ] Deduced a trap composed of 289 places in 324 ms of which 3 ms to minimize.
[2024-06-01 14:06:55] [INFO ] Deduced a trap composed of 299 places in 399 ms of which 3 ms to minimize.
[2024-06-01 14:06:55] [INFO ] Deduced a trap composed of 292 places in 225 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-06-01 14:06:57] [INFO ] Deduced a trap composed of 170 places in 296 ms of which 4 ms to minimize.
[2024-06-01 14:06:57] [INFO ] Deduced a trap composed of 143 places in 271 ms of which 3 ms to minimize.
[2024-06-01 14:06:58] [INFO ] Deduced a trap composed of 275 places in 278 ms of which 4 ms to minimize.
[2024-06-01 14:06:58] [INFO ] Deduced a trap composed of 63 places in 147 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/1880 variables, and 60 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1362/1362 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-06-01 14:07:00] [INFO ] Deduced a trap composed of 306 places in 260 ms of which 2 ms to minimize.
[2024-06-01 14:07:01] [INFO ] Deduced a trap composed of 299 places in 278 ms of which 4 ms to minimize.
[2024-06-01 14:07:01] [INFO ] Deduced a trap composed of 286 places in 281 ms of which 3 ms to minimize.
[2024-06-01 14:07:13] [INFO ] Deduced a trap composed of 276 places in 311 ms of which 4 ms to minimize.
[2024-06-01 14:07:14] [INFO ] Deduced a trap composed of 382 places in 246 ms of which 2 ms to minimize.
[2024-06-01 14:07:14] [INFO ] Deduced a trap composed of 295 places in 323 ms of which 4 ms to minimize.
[2024-06-01 14:07:15] [INFO ] Deduced a trap composed of 285 places in 267 ms of which 4 ms to minimize.
[2024-06-01 14:07:15] [INFO ] Deduced a trap composed of 259 places in 259 ms of which 3 ms to minimize.
[2024-06-01 14:07:18] [INFO ] Deduced a trap composed of 315 places in 242 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/534 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-06-01 14:07:27] [INFO ] Deduced a trap composed of 314 places in 294 ms of which 4 ms to minimize.
[2024-06-01 14:07:27] [INFO ] Deduced a trap composed of 278 places in 290 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/1880 variables, and 71 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1362 constraints, Known Traps: 35/35 constraints]
After SMT, in 65260ms problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 65273ms
Starting structural reductions in LTL mode, iteration 1 : 538/542 places, 1366/1366 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118006 ms. Remains : 538/542 places, 1366/1366 transitions.
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S04J04T06-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 107 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S04J04T06-LTLCardinality-14 finished in 118246 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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)))))'
[2024-06-01 14:07:29] [INFO ] Flatten gal took : 112 ms
[2024-06-01 14:07:29] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 14:07:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 542 places, 1366 transitions and 6972 arcs took 30 ms.
Total runtime 1214126 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-COL-S04J04T06-LTLCardinality-13

BK_STOP 1717250979776

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBLF-COL-S04J04T06-LTLCardinality-10
ltl formula formula --ltl=/tmp/3354/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 542 places, 1366 transitions and 6972 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.330 real 0.080 user 0.090 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3354/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3354/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3354/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3354/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 563 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 543, there are 1369 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): ~68 levels ~10000 states ~16164 transitions
pnml2lts-mc( 2/ 4): ~68 levels ~20000 states ~32636 transitions
pnml2lts-mc( 2/ 4): ~75 levels ~40000 states ~61272 transitions
pnml2lts-mc( 0/ 4): ~363 levels ~80000 states ~120632 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~604!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 103568
pnml2lts-mc( 0/ 4): unique states count: 104767
pnml2lts-mc( 0/ 4): unique transitions count: 154881
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 48470
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 104771
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1246
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 104771 states 154901 transitions, fanout: 1.478
pnml2lts-mc( 0/ 4): Total exploration time 3.200 sec (3.190 sec minimum, 3.195 sec on average)
pnml2lts-mc( 0/ 4): States per second: 32741, Transitions per second: 48407
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.4MB, 13.6 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1396 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.4MB (~256.0MB paged-in)
ltl formula name PolyORBLF-COL-S04J04T06-LTLCardinality-13
ltl formula formula --ltl=/tmp/3354/ltl_1_
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 542 places, 1366 transitions and 6972 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.240 real 0.060 user 0.070 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3354/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3354/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3354/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3354/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 562 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 543, there are 1372 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( 3/ 4): ~2444 levels ~10000 states ~21832 transitions
pnml2lts-mc( 3/ 4): ~4728 levels ~20000 states ~43220 transitions
pnml2lts-mc( 3/ 4): ~9370 levels ~40000 states ~84948 transitions
pnml2lts-mc( 3/ 4): ~18587 levels ~80000 states ~169148 transitions
pnml2lts-mc( 3/ 4): ~36869 levels ~160000 states ~331044 transitions
pnml2lts-mc( 0/ 4): ~72281 levels ~320000 states ~649876 transitions
pnml2lts-mc( 0/ 4): ~138400 levels ~640000 states ~1247908 transitions
pnml2lts-mc( 0/ 4): ~271102 levels ~1280000 states ~2516572 transitions
pnml2lts-mc( 0/ 4): ~539611 levels ~2560000 states ~5159808 transitions
pnml2lts-mc( 0/ 4): ~1052706 levels ~5120000 states ~10381780 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 133528
pnml2lts-mc( 0/ 4): unique states count: 5582288
pnml2lts-mc( 0/ 4): unique transitions count: 12547146
pnml2lts-mc( 0/ 4): - self-loop count: 553
pnml2lts-mc( 0/ 4): - claim dead count: 194260
pnml2lts-mc( 0/ 4): - claim found count: 2069351
pnml2lts-mc( 0/ 4): - claim success count: 5582297
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4551575
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5582302 states 12547178 transitions, fanout: 2.248
pnml2lts-mc( 0/ 4): Total exploration time 125.090 sec (125.050 sec minimum, 125.062 sec on average)
pnml2lts-mc( 0/ 4): States per second: 44626, Transitions per second: 100305
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 138.6MB, 14.9 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 29.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1396 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 138.6MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-COL-S04J04T06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446400123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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