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-171654446400099.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-S02J06T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446400099
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.9K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 11 16:55 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 5.1K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 9.8K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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-S02J06T06-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717248760439

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-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:32:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:32:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:32:41] [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:32:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:32:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 701 ms
[2024-06-01 13:32:42] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 536 PT places and 1096.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 13:32:42] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-06-01 13:32:42] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 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 2105 ms. (18 steps per ms) remains 8/29 properties
BEST_FIRST walk for 40000 steps (23 resets) in 438 ms. (91 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (9 resets) in 325 ms. (122 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (9 resets) in 185 ms. (215 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (10 resets) in 239 ms. (166 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 190 ms. (209 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (13 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (12 resets) in 110 ms. (360 steps per ms) remains 8/8 properties
[2024-06-01 13:32:44] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:32:44] [INFO ] Computed 26 invariants in 10 ms
[2024-06-01 13:32:44] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 37/51 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 4 (OVERLAPS) 4/55 variables, 3/10 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 6 (OVERLAPS) 22/77 variables, 13/23 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/23 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/78 variables, 1/24 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/24 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/79 variables, 1/25 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 64/143 variables, 79/104 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/143 variables, 8/112 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/143 variables, 0/112 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/145 variables, 2/114 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/145 variables, 1/115 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 7 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 7 solved, 1 unsolved in 255 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: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/16 variables, 2/2 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/25 variables, 2/4 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/48 variables, 3/7 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/51 variables, 2/9 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 22/73 variables, 12/21 constraints. Problems are: Problem set: 7 solved, 1 unsolved
[2024-06-01 13:32:44] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 7 ms to minimize.
[2024-06-01 13:32:44] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 2/23 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/26 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/26 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/27 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/106 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/114 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 0/114 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/145 variables, 2/116 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/145 variables, 1/117 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 1/118 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 0/118 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/145 variables, 0/118 constraints. Problems are: Problem set: 7 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 118 constraints, problems are : Problem set: 7 solved, 1 unsolved in 297 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: 1/8 constraints, Known Traps: 2/2 constraints]
After SMT, in 596ms problems are : Problem set: 7 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 19 place count 71 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 68 transition count 53
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 2 with 12 rules applied. Total rules applied 37 place count 62 transition count 47
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 62 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 60 transition count 45
Applied a total of 41 rules in 27 ms. Remains 60 /81 variables (removed 21) and now considering 45/65 (removed 20) transitions.
Running 44 sub problems to find dead transitions.
[2024-06-01 13:32:44] [INFO ] Flow matrix only has 44 transitions (discarded 1 similar events)
// Phase 1: matrix 44 rows 60 cols
[2024-06-01 13:32:44] [INFO ] Computed 25 invariants in 2 ms
[2024-06-01 13:32:44] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 13:32:45] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:32:45] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 13:32:45] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/60 variables, 1/28 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-06-01 13:32:45] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:32:45] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 2/30 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 44/104 variables, 60/90 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 8/98 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/98 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 0/104 variables, 0/98 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 98 constraints, problems are : Problem set: 2 solved, 42 unsolved in 1133 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 2 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 4/28 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-06-01 13:32:46] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
[2024-06-01 13:32:46] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 2/30 constraints. Problems are: Problem set: 2 solved, 42 unsolved
[2024-06-01 13:32:46] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/31 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 1/60 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 1/33 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 44/104 variables, 60/93 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 8/101 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 42/143 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/104 variables, 0/143 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 13 (OVERLAPS) 0/104 variables, 0/143 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 143 constraints, problems are : Problem set: 2 solved, 42 unsolved in 1244 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 42/44 constraints, Known Traps: 8/8 constraints]
After SMT, in 2400ms problems are : Problem set: 2 solved, 42 unsolved
Search for dead transitions found 2 dead transitions in 2402ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/81 places, 43/65 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 58 transition count 41
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 57 transition count 39
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 11 ms. Remains 57 /60 variables (removed 3) and now considering 39/43 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2453 ms. Remains : 57/81 places, 39/65 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:32:47] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2024-06-01 13:32:47] [INFO ] Flatten gal took : 28 ms
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:32:47] [INFO ] Flatten gal took : 11 ms
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 13:32:47] [INFO ] Unfolded HLPN to a Petri net with 536 places and 1064 transitions 4866 arcs in 34 ms.
[2024-06-01 13:32:47] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 175 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Applied a total of 0 rules in 21 ms. Remains 536 /536 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2024-06-01 13:32:47] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2024-06-01 13:32:47] [INFO ] Computed 50 invariants in 51 ms
[2024-06-01 13:32:47] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 2 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 2 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 2 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:32:57] [INFO ] Deduced a trap composed of 280 places in 279 ms of which 4 ms to minimize.
[2024-06-01 13:32:57] [INFO ] Deduced a trap composed of 280 places in 254 ms of which 3 ms to minimize.
[2024-06-01 13:32:57] [INFO ] Deduced a trap composed of 146 places in 230 ms of which 3 ms to minimize.
[2024-06-01 13:32:58] [INFO ] Deduced a trap composed of 292 places in 296 ms of which 5 ms to minimize.
[2024-06-01 13:32:58] [INFO ] Deduced a trap composed of 298 places in 312 ms of which 4 ms to minimize.
[2024-06-01 13:32:59] [INFO ] Deduced a trap composed of 268 places in 286 ms of which 4 ms to minimize.
[2024-06-01 13:32:59] [INFO ] Deduced a trap composed of 261 places in 275 ms of which 4 ms to minimize.
[2024-06-01 13:32:59] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:33:08] [INFO ] Deduced a trap composed of 276 places in 249 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1492 variables, and 60 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 13:33:10] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 2 ms to minimize.
[2024-06-01 13:33:11] [INFO ] Deduced a trap composed of 247 places in 294 ms of which 4 ms to minimize.
[2024-06-01 13:33:15] [INFO ] Deduced a trap composed of 364 places in 256 ms of which 4 ms to minimize.
[2024-06-01 13:33:15] [INFO ] Deduced a trap composed of 371 places in 223 ms of which 4 ms to minimize.
[2024-06-01 13:33:15] [INFO ] Deduced a trap composed of 350 places in 223 ms of which 4 ms to minimize.
[2024-06-01 13:33:16] [INFO ] Deduced a trap composed of 364 places in 216 ms of which 2 ms to minimize.
[2024-06-01 13:33:20] [INFO ] Deduced a trap composed of 63 places in 258 ms of which 4 ms to minimize.
[2024-06-01 13:33:20] [INFO ] Deduced a trap composed of 158 places in 251 ms of which 3 ms to minimize.
[2024-06-01 13:33:20] [INFO ] Deduced a trap composed of 267 places in 223 ms of which 4 ms to minimize.
[2024-06-01 13:33:22] [INFO ] Deduced a trap composed of 372 places in 259 ms of which 4 ms to minimize.
[2024-06-01 13:33:22] [INFO ] Deduced a trap composed of 310 places in 204 ms of which 3 ms to minimize.
[2024-06-01 13:33:22] [INFO ] Deduced a trap composed of 291 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:33:22] [INFO ] Deduced a trap composed of 311 places in 249 ms of which 4 ms to minimize.
[2024-06-01 13:33:23] [INFO ] Deduced a trap composed of 373 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:33:23] [INFO ] Deduced a trap composed of 319 places in 190 ms of which 5 ms to minimize.
[2024-06-01 13:33:23] [INFO ] Deduced a trap composed of 423 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:33:23] [INFO ] Deduced a trap composed of 420 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:33:24] [INFO ] Deduced a trap composed of 413 places in 267 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 8)
(s1 2)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 1)
(s11 1)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1492 variables, and 78 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 32/32 constraints]
After SMT, in 41345ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 41365ms
[2024-06-01 13:33:28] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-06-01 13:33:28] [INFO ] Invariant cache hit.
[2024-06-01 13:33:29] [INFO ] Implicit Places using invariants in 299 ms returned [416, 417, 418, 419, 420, 421]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 307 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 530/536 places, 968/968 transitions.
Applied a total of 0 rules in 11 ms. Remains 530 /530 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41710 ms. Remains : 530/536 places, 968/968 transitions.
Support contains 175 out of 530 places after structural reductions.
[2024-06-01 13:33:29] [INFO ] Flatten gal took : 70 ms
[2024-06-01 13:33:29] [INFO ] Flatten gal took : 54 ms
[2024-06-01 13:33:29] [INFO ] Input system was already deterministic with 968 transitions.
RANDOM walk for 40000 steps (11 resets) in 750 ms. (53 steps per ms) remains 1/16 properties
BEST_FIRST walk for 40002 steps (8 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
[2024-06-01 13:33:29] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 530 cols
[2024-06-01 13:33:29] [INFO ] Computed 44 invariants in 36 ms
[2024-06-01 13:33:29] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 241/259 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/279 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 176/455 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 527/1486 variables, and 42 constraints, problems are : Problem set: 1 solved, 0 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/530 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 191ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 8 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(G(p0)))'
Support contains 13 out of 530 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 528 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 522 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 516 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 516 transition count 956
Applied a total of 26 rules in 59 ms. Remains 516 /530 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-06-01 13:33:30] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2024-06-01 13:33:30] [INFO ] Computed 42 invariants in 18 ms
[2024-06-01 13:33:30] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 13:33:37] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 1 ms to minimize.
[2024-06-01 13:33:37] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:33:38] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 2 ms to minimize.
[2024-06-01 13:33:38] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:33:38] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 2 ms to minimize.
[2024-06-01 13:33:38] [INFO ] Deduced a trap composed of 293 places in 262 ms of which 4 ms to minimize.
[2024-06-01 13:33:38] [INFO ] Deduced a trap composed of 281 places in 279 ms of which 3 ms to minimize.
[2024-06-01 13:33:39] [INFO ] Deduced a trap composed of 272 places in 263 ms of which 4 ms to minimize.
[2024-06-01 13:33:39] [INFO ] Deduced a trap composed of 124 places in 204 ms of which 4 ms to minimize.
[2024-06-01 13:33:39] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:33:40] [INFO ] Deduced a trap composed of 289 places in 273 ms of which 3 ms to minimize.
[2024-06-01 13:33:40] [INFO ] Deduced a trap composed of 284 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:33:40] [INFO ] Deduced a trap composed of 15 places in 258 ms of which 4 ms to minimize.
[2024-06-01 13:33:41] [INFO ] Deduced a trap composed of 349 places in 236 ms of which 4 ms to minimize.
[2024-06-01 13:33:41] [INFO ] Deduced a trap composed of 273 places in 276 ms of which 5 ms to minimize.
[2024-06-01 13:33:41] [INFO ] Deduced a trap composed of 269 places in 302 ms of which 3 ms to minimize.
[2024-06-01 13:33:47] [INFO ] Deduced a trap composed of 268 places in 249 ms of which 4 ms to minimize.
[2024-06-01 13:33:48] [INFO ] Deduced a trap composed of 275 places in 256 ms of which 4 ms to minimize.
[2024-06-01 13:33:48] [INFO ] Deduced a trap composed of 260 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:33:49] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 13:33:50] [INFO ] Deduced a trap composed of 249 places in 240 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 61 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 21/61 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 13:33:53] [INFO ] Deduced a trap composed of 292 places in 234 ms of which 4 ms to minimize.
[2024-06-01 13:34:00] [INFO ] Deduced a trap composed of 269 places in 237 ms of which 4 ms to minimize.
[2024-06-01 13:34:02] [INFO ] Deduced a trap composed of 95 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:34:02] [INFO ] Deduced a trap composed of 288 places in 190 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 13:34:09] [INFO ] Deduced a trap composed of 278 places in 280 ms of which 4 ms to minimize.
[2024-06-01 13:34:09] [INFO ] Deduced a trap composed of 348 places in 254 ms of which 3 ms to minimize.
[2024-06-01 13:34:10] [INFO ] Deduced a trap composed of 280 places in 269 ms of which 4 ms to minimize.
[2024-06-01 13:34:10] [INFO ] Deduced a trap composed of 275 places in 231 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 69 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 29/29 constraints]
After SMT, in 41259ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41274ms
[2024-06-01 13:34:11] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 13:34:11] [INFO ] Invariant cache hit.
[2024-06-01 13:34:11] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-06-01 13:34:11] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 13:34:11] [INFO ] Invariant cache hit.
[2024-06-01 13:34:12] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:34:16] [INFO ] Implicit Places using invariants and state equation in 4106 ms returned []
Implicit Place search using SMT with State Equation took 4530 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2024-06-01 13:34:16] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 13:34:16] [INFO ] Invariant cache hit.
[2024-06-01 13:34:16] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 13:34:23] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:34:23] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:34:23] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:34:23] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:34:23] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:34:23] [INFO ] Deduced a trap composed of 288 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:34:24] [INFO ] Deduced a trap composed of 276 places in 242 ms of which 4 ms to minimize.
[2024-06-01 13:34:24] [INFO ] Deduced a trap composed of 274 places in 215 ms of which 4 ms to minimize.
[2024-06-01 13:34:24] [INFO ] Deduced a trap composed of 294 places in 218 ms of which 4 ms to minimize.
[2024-06-01 13:34:24] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:34:25] [INFO ] Deduced a trap composed of 290 places in 237 ms of which 6 ms to minimize.
[2024-06-01 13:34:25] [INFO ] Deduced a trap composed of 289 places in 254 ms of which 4 ms to minimize.
[2024-06-01 13:34:26] [INFO ] Deduced a trap composed of 314 places in 299 ms of which 4 ms to minimize.
[2024-06-01 13:34:26] [INFO ] Deduced a trap composed of 294 places in 274 ms of which 4 ms to minimize.
[2024-06-01 13:34:26] [INFO ] Deduced a trap composed of 280 places in 258 ms of which 3 ms to minimize.
[2024-06-01 13:34:26] [INFO ] Deduced a trap composed of 42 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:34:27] [INFO ] Deduced a trap composed of 261 places in 221 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 13:34:35] [INFO ] Deduced a trap composed of 117 places in 215 ms of which 4 ms to minimize.
[2024-06-01 13:34:35] [INFO ] Deduced a trap composed of 149 places in 199 ms of which 4 ms to minimize.
[2024-06-01 13:34:36] [INFO ] Deduced a trap composed of 283 places in 302 ms of which 4 ms to minimize.
[2024-06-01 13:34:42] [INFO ] Deduced a trap composed of 247 places in 245 ms of which 4 ms to minimize.
[2024-06-01 13:34:42] [INFO ] Deduced a trap composed of 258 places in 215 ms of which 3 ms to minimize.
[2024-06-01 13:34:42] [INFO ] Deduced a trap composed of 266 places in 216 ms of which 5 ms to minimize.
[2024-06-01 13:34:43] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 3 ms to minimize.
(s378 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 7.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 1.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 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 9.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 (/ 1.0 3.0))
(s178 (/ 1.0 3.0))
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 (/ 2.0 3.0))
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 (/ 2.0 3.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 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.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)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 4.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 1.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 64 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 13:34:52] [INFO ] Deduced a trap composed of 343 places in 277 ms of which 3 ms to minimize.
[2024-06-01 13:34:55] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 66 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 26/26 constraints]
After SMT, in 60912ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60921ms
Starting structural reductions in LTL mode, iteration 1 : 516/530 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106793 ms. Remains : 516/530 places, 956/968 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T06-LTLCardinality-00 finished in 107056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 528 transition count 914
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 474 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 474 transition count 854
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 228 place count 414 transition count 854
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 234 place count 408 transition count 848
Iterating global reduction 2 with 6 rules applied. Total rules applied 240 place count 408 transition count 848
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 312 place count 372 transition count 812
Applied a total of 312 rules in 84 ms. Remains 372 /530 variables (removed 158) and now considering 812/968 (removed 156) transitions.
Running 810 sub problems to find dead transitions.
[2024-06-01 13:35:17] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 372 cols
[2024-06-01 13:35:17] [INFO ] Computed 42 invariants in 15 ms
[2024-06-01 13:35:17] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:35:22] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 2 ms to minimize.
[2024-06-01 13:35:22] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:35:22] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:35:22] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:35:22] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:35:22] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:35:22] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:35:22] [INFO ] Deduced a trap composed of 145 places in 170 ms of which 2 ms to minimize.
[2024-06-01 13:35:23] [INFO ] Deduced a trap composed of 160 places in 187 ms of which 2 ms to minimize.
[2024-06-01 13:35:26] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 2 ms to minimize.
[2024-06-01 13:35:26] [INFO ] Deduced a trap composed of 67 places in 124 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:35:30] [INFO ] Deduced a trap composed of 228 places in 128 ms of which 2 ms to minimize.
[2024-06-01 13:35:34] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 2 ms to minimize.
[2024-06-01 13:35:34] [INFO ] Deduced a trap composed of 157 places in 180 ms of which 2 ms to minimize.
[2024-06-01 13:35:35] [INFO ] Deduced a trap composed of 54 places in 170 ms of which 3 ms to minimize.
[2024-06-01 13:35:35] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/1172 variables, and 56 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:35:40] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:35:47] [INFO ] Deduced a trap composed of 132 places in 198 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 5 (OVERLAPS) 1/371 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/1172 variables, and 59 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 18/18 constraints]
After SMT, in 40898ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40908ms
[2024-06-01 13:35:58] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:35:58] [INFO ] Invariant cache hit.
[2024-06-01 13:35:58] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-06-01 13:35:58] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:35:58] [INFO ] Invariant cache hit.
[2024-06-01 13:35:59] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:36:01] [INFO ] Implicit Places using invariants and state equation in 2964 ms returned []
Implicit Place search using SMT with State Equation took 3330 ms to find 0 implicit places.
[2024-06-01 13:36:01] [INFO ] Redundant transitions in 42 ms returned []
Running 810 sub problems to find dead transitions.
[2024-06-01 13:36:01] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-06-01 13:36:01] [INFO ] Invariant cache hit.
[2024-06-01 13:36:01] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:36:06] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:36:06] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:36:06] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:36:06] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:36:06] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:36:07] [INFO ] Deduced a trap composed of 130 places in 159 ms of which 3 ms to minimize.
[2024-06-01 13:36:07] [INFO ] Deduced a trap composed of 146 places in 191 ms of which 2 ms to minimize.
[2024-06-01 13:36:07] [INFO ] Deduced a trap composed of 160 places in 211 ms of which 3 ms to minimize.
[2024-06-01 13:36:07] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:36:09] [INFO ] Deduced a trap composed of 228 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:36:11] [INFO ] Deduced a trap composed of 67 places in 176 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:36:18] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:36:19] [INFO ] Deduced a trap composed of 136 places in 205 ms of which 2 ms to minimize.
[2024-06-01 13:36:19] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:36:27] [INFO ] Deduced a trap composed of 132 places in 147 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/1172 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-06-01 13:36:34] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-06-01 13:36:36] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 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 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
At refinement iteration 5 (OVERLAPS) 1/371 variables, 1/58 constraints. Problems are: Problem set: 36 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/1172 variables, and 58 constraints, problems are : Problem set: 36 solved, 774 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 17/17 constraints]
After SMT, in 60997ms problems are : Problem set: 36 solved, 774 unsolved
Search for dead transitions found 36 dead transitions in 61006ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 372/530 places, 776/968 transitions.
Applied a total of 0 rules in 17 ms. Remains 372 /372 variables (removed 0) and now considering 776/776 (removed 0) transitions.
[2024-06-01 13:37:02] [INFO ] Redundant transitions in 6 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 105412 ms. Remains : 372/530 places, 776/968 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLCardinality-01
Stuttering criterion allowed to conclude after 504 steps with 0 reset in 6 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T06-LTLCardinality-01 finished in 105500 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((F(G(!p0)) U p1))))'
Support contains 21 out of 530 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 528 transition count 968
Applied a total of 2 rules in 6 ms. Remains 528 /530 variables (removed 2) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2024-06-01 13:37:02] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 528 cols
[2024-06-01 13:37:02] [INFO ] Computed 42 invariants in 16 ms
[2024-06-01 13:37:02] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 13:37:10] [INFO ] Deduced a trap composed of 74 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:37:10] [INFO ] Deduced a trap composed of 74 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:37:10] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:37:10] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:37:10] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:37:11] [INFO ] Deduced a trap composed of 289 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:37:11] [INFO ] Deduced a trap composed of 135 places in 170 ms of which 2 ms to minimize.
[2024-06-01 13:37:11] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 3 ms to minimize.
[2024-06-01 13:37:11] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 2 ms to minimize.
[2024-06-01 13:37:12] [INFO ] Deduced a trap composed of 311 places in 238 ms of which 4 ms to minimize.
[2024-06-01 13:37:12] [INFO ] Deduced a trap composed of 382 places in 305 ms of which 6 ms to minimize.
[2024-06-01 13:37:13] [INFO ] Deduced a trap composed of 293 places in 247 ms of which 4 ms to minimize.
[2024-06-01 13:37:13] [INFO ] Deduced a trap composed of 276 places in 252 ms of which 4 ms to minimize.
[2024-06-01 13:37:13] [INFO ] Deduced a trap composed of 53 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:37:13] [INFO ] Deduced a trap composed of 248 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:37:14] [INFO ] Deduced a trap composed of 328 places in 215 ms of which 4 ms to minimize.
[2024-06-01 13:37:14] [INFO ] Deduced a trap composed of 288 places in 189 ms of which 3 ms to minimize.
[2024-06-01 13:37:14] [INFO ] Deduced a trap composed of 306 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:37:14] [INFO ] Deduced a trap composed of 302 places in 284 ms of which 3 ms to minimize.
[2024-06-01 13:37:15] [INFO ] Deduced a trap composed of 318 places in 277 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 13:37:15] [INFO ] Deduced a trap composed of 283 places in 254 ms of which 4 ms to minimize.
[2024-06-01 13:37:16] [INFO ] Deduced a trap composed of 281 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:37:22] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:37:23] [INFO ] Deduced a trap composed of 243 places in 267 ms of which 4 ms to minimize.
[2024-06-01 13:37:23] [INFO ] Deduced a trap composed of 271 places in 256 ms of which 4 ms to minimize.
SMT process timed out in 21058ms, After SMT, problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 21068ms
[2024-06-01 13:37:23] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-06-01 13:37:23] [INFO ] Invariant cache hit.
[2024-06-01 13:37:24] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-06-01 13:37:24] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-06-01 13:37:24] [INFO ] Invariant cache hit.
[2024-06-01 13:37:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:37:28] [INFO ] Implicit Places using invariants and state equation in 4028 ms returned []
Implicit Place search using SMT with State Equation took 4400 ms to find 0 implicit places.
Running 966 sub problems to find dead transitions.
[2024-06-01 13:37:28] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-06-01 13:37:28] [INFO ] Invariant cache hit.
[2024-06-01 13:37:28] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 13:37:35] [INFO ] Deduced a trap composed of 74 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:37:35] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 2 ms to minimize.
[2024-06-01 13:37:35] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:37:35] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 2 ms to minimize.
[2024-06-01 13:37:35] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:37:36] [INFO ] Deduced a trap composed of 283 places in 247 ms of which 4 ms to minimize.
[2024-06-01 13:37:36] [INFO ] Deduced a trap composed of 294 places in 262 ms of which 4 ms to minimize.
[2024-06-01 13:37:36] [INFO ] Deduced a trap composed of 250 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:37:37] [INFO ] Deduced a trap composed of 129 places in 236 ms of which 4 ms to minimize.
[2024-06-01 13:37:37] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 4 ms to minimize.
[2024-06-01 13:37:37] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:37:37] [INFO ] Deduced a trap composed of 262 places in 244 ms of which 4 ms to minimize.
[2024-06-01 13:37:38] [INFO ] Deduced a trap composed of 309 places in 251 ms of which 4 ms to minimize.
[2024-06-01 13:37:38] [INFO ] Deduced a trap composed of 284 places in 285 ms of which 4 ms to minimize.
[2024-06-01 13:37:38] [INFO ] Deduced a trap composed of 285 places in 261 ms of which 4 ms to minimize.
[2024-06-01 13:37:45] [INFO ] Deduced a trap composed of 285 places in 256 ms of which 3 ms to minimize.
[2024-06-01 13:37:45] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:37:46] [INFO ] Deduced a trap composed of 163 places in 233 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 243 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 273 places in 238 ms of which 6 ms to minimize.
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 271 places in 185 ms of which 3 ms to minimize.
[2024-06-01 13:37:58] [INFO ] Deduced a trap composed of 63 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:37:58] [INFO ] Deduced a trap composed of 158 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:37:58] [INFO ] Deduced a trap composed of 282 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:37:58] [INFO ] Deduced a trap composed of 264 places in 243 ms of which 4 ms to minimize.
[2024-06-01 13:37:59] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 2 ms to minimize.
SMT process timed out in 31110ms, After SMT, problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 31128ms
Starting structural reductions in LTL mode, iteration 1 : 528/530 places, 968/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56608 ms. Remains : 528/530 places, 968/968 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p1), (NOT p1), p0]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLCardinality-02
Product exploration explored 100000 steps with 32 reset in 291 ms.
Stack based approach found an accepted trace after 1877 steps with 0 reset with depth 1878 and stack size 1872 in 7 ms.
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S02J06T06-LTLCardinality-02 finished in 57069 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(F(p0))))'
Support contains 18 out of 530 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 528 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 522 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 516 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 516 transition count 956
Applied a total of 26 rules in 16 ms. Remains 516 /530 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-06-01 13:37:59] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2024-06-01 13:37:59] [INFO ] Computed 42 invariants in 10 ms
[2024-06-01 13:37:59] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 13:38:08] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 1 ms to minimize.
[2024-06-01 13:38:08] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 2 ms to minimize.
[2024-06-01 13:38:08] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:38:08] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:38:08] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:38:09] [INFO ] Deduced a trap composed of 293 places in 254 ms of which 3 ms to minimize.
[2024-06-01 13:38:09] [INFO ] Deduced a trap composed of 281 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:38:09] [INFO ] Deduced a trap composed of 272 places in 234 ms of which 4 ms to minimize.
[2024-06-01 13:38:10] [INFO ] Deduced a trap composed of 124 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:38:10] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:38:11] [INFO ] Deduced a trap composed of 289 places in 286 ms of which 3 ms to minimize.
[2024-06-01 13:38:11] [INFO ] Deduced a trap composed of 284 places in 352 ms of which 4 ms to minimize.
[2024-06-01 13:38:11] [INFO ] Deduced a trap composed of 15 places in 261 ms of which 4 ms to minimize.
[2024-06-01 13:38:11] [INFO ] Deduced a trap composed of 349 places in 211 ms of which 2 ms to minimize.
[2024-06-01 13:38:12] [INFO ] Deduced a trap composed of 273 places in 192 ms of which 3 ms to minimize.
[2024-06-01 13:38:12] [INFO ] Deduced a trap composed of 269 places in 184 ms of which 3 ms to minimize.
[2024-06-01 13:38:19] [INFO ] Deduced a trap composed of 268 places in 181 ms of which 2 ms to minimize.
[2024-06-01 13:38:19] [INFO ] Deduced a trap composed of 275 places in 238 ms of which 4 ms to minimize.
[2024-06-01 13:38:20] [INFO ] Deduced a trap composed of 260 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:38:20] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 60 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 13:38:22] [INFO ] Deduced a trap composed of 299 places in 262 ms of which 3 ms to minimize.
[2024-06-01 13:38:30] [INFO ] Deduced a trap composed of 257 places in 250 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 62 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 22/22 constraints]
After SMT, in 40896ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40907ms
[2024-06-01 13:38:40] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 13:38:40] [INFO ] Invariant cache hit.
[2024-06-01 13:38:41] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-06-01 13:38:41] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 13:38:41] [INFO ] Invariant cache hit.
[2024-06-01 13:38:41] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:38:45] [INFO ] Implicit Places using invariants and state equation in 4404 ms returned []
Implicit Place search using SMT with State Equation took 4697 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2024-06-01 13:38:45] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 13:38:45] [INFO ] Invariant cache hit.
[2024-06-01 13:38:45] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 13:38:53] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:38:53] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:38:53] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:38:53] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:38:53] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:38:54] [INFO ] Deduced a trap composed of 288 places in 282 ms of which 5 ms to minimize.
[2024-06-01 13:38:54] [INFO ] Deduced a trap composed of 276 places in 263 ms of which 4 ms to minimize.
[2024-06-01 13:38:54] [INFO ] Deduced a trap composed of 274 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:38:55] [INFO ] Deduced a trap composed of 294 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:38:55] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:38:55] [INFO ] Deduced a trap composed of 290 places in 303 ms of which 4 ms to minimize.
[2024-06-01 13:38:56] [INFO ] Deduced a trap composed of 289 places in 275 ms of which 5 ms to minimize.
[2024-06-01 13:38:56] [INFO ] Deduced a trap composed of 314 places in 222 ms of which 3 ms to minimize.
[2024-06-01 13:38:56] [INFO ] Deduced a trap composed of 294 places in 311 ms of which 4 ms to minimize.
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 280 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 42 places in 261 ms of which 4 ms to minimize.
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 261 places in 221 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 13:39:07] [INFO ] Deduced a trap composed of 117 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:39:07] [INFO ] Deduced a trap composed of 149 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:39:07] [INFO ] Deduced a trap composed of 283 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:39:13] [INFO ] Deduced a trap composed of 247 places in 185 ms of which 3 ms to minimize.
[2024-06-01 13:39:13] [INFO ] Deduced a trap composed of 258 places in 202 ms of which 2 ms to minimize.
[2024-06-01 13:39:13] [INFO ] Deduced a trap composed of 266 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:39:14] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 64 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 13:39:22] [INFO ] Deduced a trap composed of 343 places in 203 ms of which 16 ms to minimize.
[2024-06-01 13:39:25] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 66 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 26/26 constraints]
After SMT, in 61319ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 61338ms
Starting structural reductions in LTL mode, iteration 1 : 516/530 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106966 ms. Remains : 516/530 places, 956/968 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLCardinality-05
Product exploration explored 100000 steps with 33333 reset in 326 ms.
Product exploration explored 100000 steps with 33333 reset in 305 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 22 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J06T06-LTLCardinality-05 finished in 107749 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((X(F(p0))||G(p1)))))'
Support contains 6 out of 530 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 528 transition count 968
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 522 transition count 962
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 516 transition count 956
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 516 transition count 956
Applied a total of 26 rules in 30 ms. Remains 516 /530 variables (removed 14) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2024-06-01 13:39:47] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 13:39:47] [INFO ] Invariant cache hit.
[2024-06-01 13:39:47] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 13:39:55] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 2 ms to minimize.
[2024-06-01 13:39:55] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:39:55] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:39:55] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:39:55] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:39:55] [INFO ] Deduced a trap composed of 288 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:39:56] [INFO ] Deduced a trap composed of 276 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:39:56] [INFO ] Deduced a trap composed of 274 places in 215 ms of which 3 ms to minimize.
[2024-06-01 13:39:56] [INFO ] Deduced a trap composed of 294 places in 221 ms of which 2 ms to minimize.
[2024-06-01 13:39:56] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:39:56] [INFO ] Deduced a trap composed of 290 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:39:57] [INFO ] Deduced a trap composed of 289 places in 222 ms of which 3 ms to minimize.
[2024-06-01 13:39:57] [INFO ] Deduced a trap composed of 314 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:39:57] [INFO ] Deduced a trap composed of 294 places in 211 ms of which 3 ms to minimize.
[2024-06-01 13:39:58] [INFO ] Deduced a trap composed of 280 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:39:58] [INFO ] Deduced a trap composed of 42 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:39:58] [INFO ] Deduced a trap composed of 261 places in 222 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 13:40:07] [INFO ] Deduced a trap composed of 117 places in 195 ms of which 4 ms to minimize.
[2024-06-01 13:40:07] [INFO ] Deduced a trap composed of 149 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:40:07] [INFO ] Deduced a trap composed of 283 places in 258 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 60 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 13:40:17] [INFO ] Deduced a trap composed of 337 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:40:20] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:40:21] [INFO ] Deduced a trap composed of 59 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:40:25] [INFO ] Deduced a trap composed of 349 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:40:26] [INFO ] Deduced a trap composed of 352 places in 258 ms of which 17 ms to minimize.
[2024-06-01 13:40:26] [INFO ] Deduced a trap composed of 358 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:40:27] [INFO ] Deduced a trap composed of 246 places in 258 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 67 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 27/27 constraints]
After SMT, in 41014ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 41024ms
[2024-06-01 13:40:28] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 13:40:28] [INFO ] Invariant cache hit.
[2024-06-01 13:40:28] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-06-01 13:40:28] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 13:40:29] [INFO ] Invariant cache hit.
[2024-06-01 13:40:29] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:40:34] [INFO ] Implicit Places using invariants and state equation in 5384 ms returned []
Implicit Place search using SMT with State Equation took 5783 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2024-06-01 13:40:34] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2024-06-01 13:40:34] [INFO ] Invariant cache hit.
[2024-06-01 13:40:34] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 13:40:42] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:40:42] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:40:42] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:40:42] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:40:42] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:40:42] [INFO ] Deduced a trap composed of 288 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:40:43] [INFO ] Deduced a trap composed of 276 places in 193 ms of which 2 ms to minimize.
[2024-06-01 13:40:43] [INFO ] Deduced a trap composed of 274 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:40:43] [INFO ] Deduced a trap composed of 294 places in 193 ms of which 2 ms to minimize.
[2024-06-01 13:40:43] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:40:44] [INFO ] Deduced a trap composed of 290 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:40:44] [INFO ] Deduced a trap composed of 289 places in 175 ms of which 2 ms to minimize.
[2024-06-01 13:40:44] [INFO ] Deduced a trap composed of 314 places in 196 ms of which 3 ms to minimize.
[2024-06-01 13:40:44] [INFO ] Deduced a trap composed of 294 places in 196 ms of which 3 ms to minimize.
[2024-06-01 13:40:45] [INFO ] Deduced a trap composed of 280 places in 196 ms of which 2 ms to minimize.
[2024-06-01 13:40:45] [INFO ] Deduced a trap composed of 42 places in 204 ms of which 2 ms to minimize.
[2024-06-01 13:40:45] [INFO ] Deduced a trap composed of 261 places in 204 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 13:40:53] [INFO ] Deduced a trap composed of 117 places in 178 ms of which 3 ms to minimize.
[2024-06-01 13:40:53] [INFO ] Deduced a trap composed of 149 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:40:53] [INFO ] Deduced a trap composed of 283 places in 194 ms of which 3 ms to minimize.
[2024-06-01 13:41:00] [INFO ] Deduced a trap composed of 247 places in 268 ms of which 4 ms to minimize.
[2024-06-01 13:41:00] [INFO ] Deduced a trap composed of 258 places in 223 ms of which 4 ms to minimize.
[2024-06-01 13:41:00] [INFO ] Deduced a trap composed of 266 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:41:00] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 64 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 954 unsolved
[2024-06-01 13:41:11] [INFO ] Deduced a trap composed of 343 places in 251 ms of which 4 ms to minimize.
[2024-06-01 13:41:13] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 66 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 26/26 constraints]
After SMT, in 61202ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 61218ms
Starting structural reductions in LTL mode, iteration 1 : 516/530 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108071 ms. Remains : 516/530 places, 956/968 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLCardinality-08
Product exploration explored 100000 steps with 5384 reset in 286 ms.
Product exploration explored 100000 steps with 5263 reset in 296 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 p1 p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 138 steps (0 resets) in 5 ms. (23 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 6 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 956/956 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 516 transition count 914
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 474 transition count 914
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 474 transition count 854
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 204 place count 414 transition count 854
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 300 place count 366 transition count 806
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 306 place count 360 transition count 800
Iterating global reduction 2 with 6 rules applied. Total rules applied 312 place count 360 transition count 800
Applied a total of 312 rules in 51 ms. Remains 360 /516 variables (removed 156) and now considering 800/956 (removed 156) transitions.
Running 798 sub problems to find dead transitions.
[2024-06-01 13:41:36] [INFO ] Flow matrix only has 788 transitions (discarded 12 similar events)
// Phase 1: matrix 788 rows 360 cols
[2024-06-01 13:41:36] [INFO ] Computed 42 invariants in 8 ms
[2024-06-01 13:41:36] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-06-01 13:41:41] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 0 ms to minimize.
[2024-06-01 13:41:41] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:41:42] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:41:42] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:41:42] [INFO ] Deduced a trap composed of 46 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:41:42] [INFO ] Deduced a trap composed of 141 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:41:42] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:41:42] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:41:44] [INFO ] Deduced a trap composed of 216 places in 176 ms of which 2 ms to minimize.
[2024-06-01 13:41:48] [INFO ] Deduced a trap composed of 120 places in 163 ms of which 2 ms to minimize.
[2024-06-01 13:41:48] [INFO ] Deduced a trap composed of 153 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:41:49] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:41:49] [INFO ] Deduced a trap composed of 77 places in 197 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-06-01 13:41:50] [INFO ] Deduced a trap composed of 133 places in 178 ms of which 14 ms to minimize.
[2024-06-01 13:41:50] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-06-01 13:41:55] [INFO ] Deduced a trap composed of 143 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:41:56] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/1148 variables, and 57 constraints, problems are : Problem set: 0 solved, 798 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 798/798 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 798 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-06-01 13:42:01] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 798 unsolved
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
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 TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
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 TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 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 TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/360 variables, 2/60 constraints. Problems are: Problem set: 66 solved, 732 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/1148 variables, and 60 constraints, problems are : Problem set: 66 solved, 732 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/798 constraints, Known Traps: 18/18 constraints]
After SMT, in 40954ms problems are : Problem set: 66 solved, 732 unsolved
Search for dead transitions found 66 dead transitions in 40963ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
[2024-06-01 13:42:17] [INFO ] Flow matrix only has 722 transitions (discarded 12 similar events)
// Phase 1: matrix 722 rows 360 cols
[2024-06-01 13:42:17] [INFO ] Computed 42 invariants in 8 ms
[2024-06-01 13:42:18] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-06-01 13:42:18] [INFO ] Flow matrix only has 722 transitions (discarded 12 similar events)
[2024-06-01 13:42:18] [INFO ] Invariant cache hit.
[2024-06-01 13:42:18] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:42:20] [INFO ] Implicit Places using invariants and state equation in 2774 ms returned []
Implicit Place search using SMT with State Equation took 3033 ms to find 0 implicit places.
[2024-06-01 13:42:20] [INFO ] Redundant transitions in 6 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 360/516 places, 734/956 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 346 transition count 710
Applied a total of 12 rules in 24 ms. Remains 346 /360 variables (removed 14) and now considering 710/734 (removed 24) transitions.
[2024-06-01 13:42:20] [INFO ] Flow matrix only has 698 transitions (discarded 12 similar events)
// Phase 1: matrix 698 rows 346 cols
[2024-06-01 13:42:20] [INFO ] Computed 42 invariants in 6 ms
[2024-06-01 13:42:21] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-06-01 13:42:21] [INFO ] Flow matrix only has 698 transitions (discarded 12 similar events)
[2024-06-01 13:42:21] [INFO ] Invariant cache hit.
[2024-06-01 13:42:21] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:42:23] [INFO ] Implicit Places using invariants and state equation in 2540 ms returned []
Implicit Place search using SMT with State Equation took 2966 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 346/516 places, 710/956 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47065 ms. Remains : 346/516 places, 710/956 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 98 steps (0 resets) in 4 ms. (19 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 5747 reset in 288 ms.
Product exploration explored 100000 steps with 5757 reset in 239 ms.
Support contains 6 out of 346 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 346/346 places, 710/710 transitions.
Applied a total of 0 rules in 11 ms. Remains 346 /346 variables (removed 0) and now considering 710/710 (removed 0) transitions.
Running 708 sub problems to find dead transitions.
[2024-06-01 13:42:24] [INFO ] Flow matrix only has 698 transitions (discarded 12 similar events)
[2024-06-01 13:42:24] [INFO ] Invariant cache hit.
[2024-06-01 13:42:24] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 708 unsolved
[2024-06-01 13:42:29] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:42:29] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:42:29] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:42:29] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:42:29] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:42:29] [INFO ] Deduced a trap composed of 134 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:42:29] [INFO ] Deduced a trap composed of 123 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:42:29] [INFO ] Deduced a trap composed of 161 places in 130 ms of which 2 ms to minimize.
[2024-06-01 13:42:30] [INFO ] Deduced a trap composed of 160 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:42:30] [INFO ] Deduced a trap composed of 135 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:42:30] [INFO ] Deduced a trap composed of 168 places in 135 ms of which 1 ms to minimize.
[2024-06-01 13:42:30] [INFO ] Deduced a trap composed of 123 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:42:30] [INFO ] Deduced a trap composed of 149 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:42:30] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:42:31] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:42:31] [INFO ] Deduced a trap composed of 132 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:42:31] [INFO ] Deduced a trap composed of 158 places in 133 ms of which 3 ms to minimize.
[2024-06-01 13:42:31] [INFO ] Deduced a trap composed of 142 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:42:32] [INFO ] Deduced a trap composed of 146 places in 185 ms of which 3 ms to minimize.
[2024-06-01 13:42:32] [INFO ] Deduced a trap composed of 142 places in 165 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/344 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 708 unsolved
[2024-06-01 13:42:32] [INFO ] Deduced a trap composed of 138 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:42:33] [INFO ] Deduced a trap composed of 136 places in 169 ms of which 3 ms to minimize.
[2024-06-01 13:42:33] [INFO ] Deduced a trap composed of 139 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:42:33] [INFO ] Deduced a trap composed of 134 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:42:33] [INFO ] Deduced a trap composed of 135 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:42:34] [INFO ] Deduced a trap composed of 139 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:42:34] [INFO ] Deduced a trap composed of 134 places in 174 ms of which 2 ms to minimize.
[2024-06-01 13:42:34] [INFO ] Deduced a trap composed of 130 places in 117 ms of which 2 ms to minimize.
[2024-06-01 13:42:35] [INFO ] Deduced a trap composed of 179 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:42:35] [INFO ] Deduced a trap composed of 183 places in 189 ms of which 3 ms to minimize.
[2024-06-01 13:42:36] [INFO ] Deduced a trap composed of 149 places in 169 ms of which 3 ms to minimize.
[2024-06-01 13:42:36] [INFO ] Deduced a trap composed of 135 places in 186 ms of which 3 ms to minimize.
[2024-06-01 13:42:36] [INFO ] Deduced a trap composed of 136 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:42:36] [INFO ] Deduced a trap composed of 161 places in 161 ms of which 3 ms to minimize.
[2024-06-01 13:42:36] [INFO ] Deduced a trap composed of 172 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:42:37] [INFO ] Deduced a trap composed of 168 places in 136 ms of which 1 ms to minimize.
[2024-06-01 13:42:37] [INFO ] Deduced a trap composed of 161 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:42:37] [INFO ] Deduced a trap composed of 112 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:42:37] [INFO ] Deduced a trap composed of 175 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:42:37] [INFO ] Deduced a trap composed of 161 places in 202 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/344 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 708 unsolved
[2024-06-01 13:42:41] [INFO ] Deduced a trap composed of 158 places in 122 ms of which 2 ms to minimize.
[2024-06-01 13:42:41] [INFO ] Deduced a trap composed of 142 places in 185 ms of which 3 ms to minimize.
[2024-06-01 13:42:41] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:42:42] [INFO ] Deduced a trap composed of 152 places in 130 ms of which 1 ms to minimize.
[2024-06-01 13:42:42] [INFO ] Deduced a trap composed of 174 places in 183 ms of which 2 ms to minimize.
[2024-06-01 13:42:42] [INFO ] Deduced a trap composed of 156 places in 163 ms of which 3 ms to minimize.
[2024-06-01 13:42:42] [INFO ] Deduced a trap composed of 152 places in 192 ms of which 3 ms to minimize.
[2024-06-01 13:42:42] [INFO ] Deduced a trap composed of 167 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:42:42] [INFO ] Deduced a trap composed of 163 places in 179 ms of which 4 ms to minimize.
[2024-06-01 13:42:43] [INFO ] Deduced a trap composed of 166 places in 131 ms of which 2 ms to minimize.
[2024-06-01 13:42:43] [INFO ] Deduced a trap composed of 163 places in 172 ms of which 3 ms to minimize.
[2024-06-01 13:42:43] [INFO ] Deduced a trap composed of 150 places in 133 ms of which 1 ms to minimize.
[2024-06-01 13:42:43] [INFO ] Deduced a trap composed of 148 places in 136 ms of which 1 ms to minimize.
[2024-06-01 13:42:43] [INFO ] Deduced a trap composed of 142 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:42:44] [INFO ] Deduced a trap composed of 149 places in 197 ms of which 3 ms to minimize.
[2024-06-01 13:42:44] [INFO ] Deduced a trap composed of 128 places in 162 ms of which 3 ms to minimize.
[2024-06-01 13:42:44] [INFO ] Deduced a trap composed of 127 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:42:44] [INFO ] Deduced a trap composed of 130 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:42:44] [INFO ] Deduced a trap composed of 132 places in 154 ms of which 3 ms to minimize.
[2024-06-01 13:42:44] [INFO ] Deduced a trap composed of 124 places in 130 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 708 unsolved
[2024-06-01 13:42:45] [INFO ] Deduced a trap composed of 153 places in 168 ms of which 3 ms to minimize.
SMT process timed out in 20799ms, After SMT, problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 20805ms
[2024-06-01 13:42:45] [INFO ] Flow matrix only has 698 transitions (discarded 12 similar events)
[2024-06-01 13:42:45] [INFO ] Invariant cache hit.
[2024-06-01 13:42:45] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-06-01 13:42:45] [INFO ] Flow matrix only has 698 transitions (discarded 12 similar events)
[2024-06-01 13:42:45] [INFO ] Invariant cache hit.
[2024-06-01 13:42:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:42:48] [INFO ] Implicit Places using invariants and state equation in 2557 ms returned []
Implicit Place search using SMT with State Equation took 2819 ms to find 0 implicit places.
[2024-06-01 13:42:48] [INFO ] Redundant transitions in 8 ms returned []
Running 708 sub problems to find dead transitions.
[2024-06-01 13:42:48] [INFO ] Flow matrix only has 698 transitions (discarded 12 similar events)
[2024-06-01 13:42:48] [INFO ] Invariant cache hit.
[2024-06-01 13:42:48] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 708 unsolved
[2024-06-01 13:42:52] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-06-01 13:42:52] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:42:52] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:42:52] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:42:52] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:42:52] [INFO ] Deduced a trap composed of 134 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:42:53] [INFO ] Deduced a trap composed of 123 places in 169 ms of which 3 ms to minimize.
[2024-06-01 13:42:53] [INFO ] Deduced a trap composed of 161 places in 161 ms of which 3 ms to minimize.
[2024-06-01 13:42:53] [INFO ] Deduced a trap composed of 160 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:42:53] [INFO ] Deduced a trap composed of 135 places in 154 ms of which 3 ms to minimize.
[2024-06-01 13:42:53] [INFO ] Deduced a trap composed of 168 places in 161 ms of which 3 ms to minimize.
[2024-06-01 13:42:54] [INFO ] Deduced a trap composed of 123 places in 155 ms of which 3 ms to minimize.
[2024-06-01 13:42:54] [INFO ] Deduced a trap composed of 149 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:42:54] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:42:54] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:42:54] [INFO ] Deduced a trap composed of 132 places in 166 ms of which 3 ms to minimize.
[2024-06-01 13:42:55] [INFO ] Deduced a trap composed of 158 places in 185 ms of which 3 ms to minimize.
[2024-06-01 13:42:55] [INFO ] Deduced a trap composed of 142 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:42:55] [INFO ] Deduced a trap composed of 146 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:42:55] [INFO ] Deduced a trap composed of 142 places in 141 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/344 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 708 unsolved
[2024-06-01 13:42:56] [INFO ] Deduced a trap composed of 138 places in 209 ms of which 2 ms to minimize.
[2024-06-01 13:42:57] [INFO ] Deduced a trap composed of 136 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:42:57] [INFO ] Deduced a trap composed of 139 places in 205 ms of which 2 ms to minimize.
[2024-06-01 13:42:57] [INFO ] Deduced a trap composed of 134 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:42:58] [INFO ] Deduced a trap composed of 135 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:42:58] [INFO ] Deduced a trap composed of 139 places in 182 ms of which 2 ms to minimize.
[2024-06-01 13:42:58] [INFO ] Deduced a trap composed of 134 places in 187 ms of which 2 ms to minimize.
[2024-06-01 13:42:58] [INFO ] Deduced a trap composed of 130 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:43:00] [INFO ] Deduced a trap composed of 179 places in 155 ms of which 1 ms to minimize.
[2024-06-01 13:43:00] [INFO ] Deduced a trap composed of 183 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:43:00] [INFO ] Deduced a trap composed of 149 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:43:00] [INFO ] Deduced a trap composed of 135 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:43:00] [INFO ] Deduced a trap composed of 136 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:43:00] [INFO ] Deduced a trap composed of 161 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:43:01] [INFO ] Deduced a trap composed of 172 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:43:01] [INFO ] Deduced a trap composed of 168 places in 147 ms of which 1 ms to minimize.
[2024-06-01 13:43:01] [INFO ] Deduced a trap composed of 161 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:43:01] [INFO ] Deduced a trap composed of 112 places in 137 ms of which 1 ms to minimize.
[2024-06-01 13:43:01] [INFO ] Deduced a trap composed of 175 places in 148 ms of which 22 ms to minimize.
[2024-06-01 13:43:01] [INFO ] Deduced a trap composed of 161 places in 182 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/344 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 708 unsolved
[2024-06-01 13:43:06] [INFO ] Deduced a trap composed of 158 places in 123 ms of which 2 ms to minimize.
[2024-06-01 13:43:06] [INFO ] Deduced a trap composed of 142 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:43:06] [INFO ] Deduced a trap composed of 137 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:43:06] [INFO ] Deduced a trap composed of 152 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:43:06] [INFO ] Deduced a trap composed of 174 places in 130 ms of which 2 ms to minimize.
[2024-06-01 13:43:06] [INFO ] Deduced a trap composed of 156 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:43:07] [INFO ] Deduced a trap composed of 152 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:43:07] [INFO ] Deduced a trap composed of 167 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:43:07] [INFO ] Deduced a trap composed of 163 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:43:07] [INFO ] Deduced a trap composed of 166 places in 130 ms of which 1 ms to minimize.
[2024-06-01 13:43:07] [INFO ] Deduced a trap composed of 163 places in 168 ms of which 3 ms to minimize.
[2024-06-01 13:43:07] [INFO ] Deduced a trap composed of 150 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:43:08] [INFO ] Deduced a trap composed of 148 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:43:08] [INFO ] Deduced a trap composed of 142 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:43:08] [INFO ] Deduced a trap composed of 149 places in 151 ms of which 1 ms to minimize.
[2024-06-01 13:43:08] [INFO ] Deduced a trap composed of 128 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:43:08] [INFO ] Deduced a trap composed of 127 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:43:08] [INFO ] Deduced a trap composed of 130 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:43:09] [INFO ] Deduced a trap composed of 132 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:43:09] [INFO ] Deduced a trap composed of 124 places in 150 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 708 unsolved
[2024-06-01 13:43:10] [INFO ] Deduced a trap composed of 153 places in 196 ms of which 3 ms to minimize.
[2024-06-01 13:43:10] [INFO ] Deduced a trap composed of 157 places in 165 ms of which 3 ms to minimize.
[2024-06-01 13:43:10] [INFO ] Deduced a trap composed of 164 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:43:10] [INFO ] Deduced a trap composed of 162 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:43:10] [INFO ] Deduced a trap composed of 148 places in 164 ms of which 3 ms to minimize.
[2024-06-01 13:43:11] [INFO ] Deduced a trap composed of 156 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:43:11] [INFO ] Deduced a trap composed of 184 places in 158 ms of which 3 ms to minimize.
[2024-06-01 13:43:11] [INFO ] Deduced a trap composed of 176 places in 190 ms of which 2 ms to minimize.
[2024-06-01 13:43:11] [INFO ] Deduced a trap composed of 152 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:43:11] [INFO ] Deduced a trap composed of 169 places in 161 ms of which 2 ms to minimize.
[2024-06-01 13:43:11] [INFO ] Deduced a trap composed of 163 places in 175 ms of which 3 ms to minimize.
[2024-06-01 13:43:12] [INFO ] Deduced a trap composed of 164 places in 154 ms of which 3 ms to minimize.
[2024-06-01 13:43:12] [INFO ] Deduced a trap composed of 140 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:43:12] [INFO ] Deduced a trap composed of 145 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:43:14] [INFO ] Deduced a trap composed of 158 places in 188 ms of which 2 ms to minimize.
[2024-06-01 13:43:14] [INFO ] Deduced a trap composed of 145 places in 167 ms of which 3 ms to minimize.
[2024-06-01 13:43:14] [INFO ] Deduced a trap composed of 160 places in 169 ms of which 3 ms to minimize.
[2024-06-01 13:43:15] [INFO ] Deduced a trap composed of 148 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:43:15] [INFO ] Deduced a trap composed of 165 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:43:15] [INFO ] Deduced a trap composed of 155 places in 197 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 708 unsolved
[2024-06-01 13:43:16] [INFO ] Deduced a trap composed of 150 places in 186 ms of which 2 ms to minimize.
[2024-06-01 13:43:17] [INFO ] Deduced a trap composed of 150 places in 169 ms of which 4 ms to minimize.
[2024-06-01 13:43:17] [INFO ] Deduced a trap composed of 154 places in 171 ms of which 3 ms to minimize.
[2024-06-01 13:43:17] [INFO ] Deduced a trap composed of 172 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:43:17] [INFO ] Deduced a trap composed of 144 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:43:17] [INFO ] Deduced a trap composed of 139 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:43:17] [INFO ] Deduced a trap composed of 138 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:43:18] [INFO ] Deduced a trap composed of 141 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:43:18] [INFO ] Deduced a trap composed of 136 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:43:18] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 344/1044 variables, and 130 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/346 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 90/90 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/344 variables, 90/130 constraints. Problems are: Problem set: 0 solved, 708 unsolved
[2024-06-01 13:43:21] [INFO ] Deduced a trap composed of 157 places in 174 ms of which 2 ms to minimize.
[2024-06-01 13:43:21] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 2 ms to minimize.
[2024-06-01 13:43:21] [INFO ] Deduced a trap composed of 150 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:43:21] [INFO ] Deduced a trap composed of 166 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:43:21] [INFO ] Deduced a trap composed of 150 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:43:22] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:43:22] [INFO ] Deduced a trap composed of 152 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:43:22] [INFO ] Deduced a trap composed of 174 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:43:22] [INFO ] Deduced a trap composed of 169 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:43:22] [INFO ] Deduced a trap composed of 157 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:43:22] [INFO ] Deduced a trap composed of 154 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:43:23] [INFO ] Deduced a trap composed of 161 places in 139 ms of which 2 ms to minimize.
[2024-06-01 13:43:23] [INFO ] Deduced a trap composed of 156 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:43:23] [INFO ] Deduced a trap composed of 155 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:43:23] [INFO ] Deduced a trap composed of 170 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:43:23] [INFO ] Deduced a trap composed of 165 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:43:23] [INFO ] Deduced a trap composed of 142 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:43:23] [INFO ] Deduced a trap composed of 157 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:43:24] [INFO ] Deduced a trap composed of 135 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:43:24] [INFO ] Deduced a trap composed of 124 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/344 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 708 unsolved
[2024-06-01 13:43:25] [INFO ] Deduced a trap composed of 143 places in 200 ms of which 4 ms to minimize.
[2024-06-01 13:43:25] [INFO ] Deduced a trap composed of 148 places in 167 ms of which 3 ms to minimize.
[2024-06-01 13:43:26] [INFO ] Deduced a trap composed of 145 places in 149 ms of which 1 ms to minimize.
[2024-06-01 13:43:26] [INFO ] Deduced a trap composed of 134 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:43:26] [INFO ] Deduced a trap composed of 154 places in 194 ms of which 3 ms to minimize.
[2024-06-01 13:43:26] [INFO ] Deduced a trap composed of 144 places in 132 ms of which 1 ms to minimize.
[2024-06-01 13:43:26] [INFO ] Deduced a trap composed of 148 places in 132 ms of which 1 ms to minimize.
[2024-06-01 13:43:27] [INFO ] Deduced a trap composed of 163 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:43:27] [INFO ] Deduced a trap composed of 166 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:43:27] [INFO ] Deduced a trap composed of 142 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:43:27] [INFO ] Deduced a trap composed of 153 places in 214 ms of which 2 ms to minimize.
[2024-06-01 13:43:28] [INFO ] Deduced a trap composed of 137 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:43:28] [INFO ] Deduced a trap composed of 135 places in 161 ms of which 2 ms to minimize.
[2024-06-01 13:43:28] [INFO ] Deduced a trap composed of 148 places in 175 ms of which 2 ms to minimize.
[2024-06-01 13:43:29] [INFO ] Deduced a trap composed of 153 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:43:29] [INFO ] Deduced a trap composed of 153 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:43:29] [INFO ] Deduced a trap composed of 154 places in 170 ms of which 2 ms to minimize.
[2024-06-01 13:43:29] [INFO ] Deduced a trap composed of 150 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:43:29] [INFO ] Deduced a trap composed of 163 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:43:29] [INFO ] Deduced a trap composed of 167 places in 140 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 708 unsolved
[2024-06-01 13:43:31] [INFO ] Deduced a trap composed of 147 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:43:31] [INFO ] Deduced a trap composed of 148 places in 150 ms of which 1 ms to minimize.
[2024-06-01 13:43:31] [INFO ] Deduced a trap composed of 156 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:43:31] [INFO ] Deduced a trap composed of 169 places in 172 ms of which 2 ms to minimize.
[2024-06-01 13:43:31] [INFO ] Deduced a trap composed of 171 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:43:32] [INFO ] Deduced a trap composed of 151 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:43:32] [INFO ] Deduced a trap composed of 158 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:43:32] [INFO ] Deduced a trap composed of 160 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:43:32] [INFO ] Deduced a trap composed of 156 places in 153 ms of which 1 ms to minimize.
[2024-06-01 13:43:32] [INFO ] Deduced a trap composed of 159 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:43:32] [INFO ] Deduced a trap composed of 144 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:43:33] [INFO ] Deduced a trap composed of 166 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:43:33] [INFO ] Deduced a trap composed of 166 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:43:33] [INFO ] Deduced a trap composed of 172 places in 131 ms of which 1 ms to minimize.
[2024-06-01 13:43:33] [INFO ] Deduced a trap composed of 174 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:43:33] [INFO ] Deduced a trap composed of 173 places in 134 ms of which 1 ms to minimize.
[2024-06-01 13:43:34] [INFO ] Deduced a trap composed of 167 places in 130 ms of which 2 ms to minimize.
[2024-06-01 13:43:34] [INFO ] Deduced a trap composed of 166 places in 171 ms of which 3 ms to minimize.
[2024-06-01 13:43:34] [INFO ] Deduced a trap composed of 175 places in 136 ms of which 18 ms to minimize.
[2024-06-01 13:43:34] [INFO ] Deduced a trap composed of 161 places in 174 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 708 unsolved
[2024-06-01 13:43:36] [INFO ] Deduced a trap composed of 174 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:43:37] [INFO ] Deduced a trap composed of 162 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:43:37] [INFO ] Deduced a trap composed of 161 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:43:37] [INFO ] Deduced a trap composed of 174 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:43:37] [INFO ] Deduced a trap composed of 173 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:43:37] [INFO ] Deduced a trap composed of 168 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:43:37] [INFO ] Deduced a trap composed of 162 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:43:38] [INFO ] Deduced a trap composed of 187 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:43:38] [INFO ] Deduced a trap composed of 165 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:43:38] [INFO ] Deduced a trap composed of 189 places in 148 ms of which 3 ms to minimize.
[2024-06-01 13:43:38] [INFO ] Deduced a trap composed of 181 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:43:38] [INFO ] Deduced a trap composed of 168 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:43:38] [INFO ] Deduced a trap composed of 181 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:43:39] [INFO ] Deduced a trap composed of 168 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:43:39] [INFO ] Deduced a trap composed of 166 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:43:39] [INFO ] Deduced a trap composed of 168 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:43:39] [INFO ] Deduced a trap composed of 171 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:43:39] [INFO ] Deduced a trap composed of 173 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:43:39] [INFO ] Deduced a trap composed of 173 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:43:40] [INFO ] Deduced a trap composed of 178 places in 155 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 708 unsolved
[2024-06-01 13:43:41] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 2 ms to minimize.
[2024-06-01 13:43:41] [INFO ] Deduced a trap composed of 162 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:43:41] [INFO ] Deduced a trap composed of 155 places in 156 ms of which 3 ms to minimize.
[2024-06-01 13:43:42] [INFO ] Deduced a trap composed of 159 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:43:42] [INFO ] Deduced a trap composed of 150 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:43:43] [INFO ] Deduced a trap composed of 161 places in 168 ms of which 3 ms to minimize.
[2024-06-01 13:43:43] [INFO ] Deduced a trap composed of 149 places in 173 ms of which 2 ms to minimize.
[2024-06-01 13:43:43] [INFO ] Deduced a trap composed of 151 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:43:43] [INFO ] Deduced a trap composed of 154 places in 157 ms of which 3 ms to minimize.
[2024-06-01 13:43:43] [INFO ] Deduced a trap composed of 159 places in 156 ms of which 3 ms to minimize.
[2024-06-01 13:43:43] [INFO ] Deduced a trap composed of 154 places in 150 ms of which 3 ms to minimize.
[2024-06-01 13:43:44] [INFO ] Deduced a trap composed of 175 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:43:44] [INFO ] Deduced a trap composed of 163 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:43:44] [INFO ] Deduced a trap composed of 164 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:43:44] [INFO ] Deduced a trap composed of 130 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:43:44] [INFO ] Deduced a trap composed of 142 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:43:45] [INFO ] Deduced a trap composed of 150 places in 186 ms of which 3 ms to minimize.
[2024-06-01 13:43:45] [INFO ] Deduced a trap composed of 163 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:43:45] [INFO ] Deduced a trap composed of 161 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:43:45] [INFO ] Deduced a trap composed of 165 places in 139 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 20/230 constraints. Problems are: Problem set: 0 solved, 708 unsolved
[2024-06-01 13:43:48] [INFO ] Deduced a trap composed of 178 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:43:48] [INFO ] Deduced a trap composed of 185 places in 141 ms of which 3 ms to minimize.
[2024-06-01 13:43:48] [INFO ] Deduced a trap composed of 167 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:43:49] [INFO ] Deduced a trap composed of 165 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:43:49] [INFO ] Deduced a trap composed of 157 places in 134 ms of which 3 ms to minimize.
[2024-06-01 13:43:49] [INFO ] Deduced a trap composed of 166 places in 142 ms of which 2 ms to minimize.
SMT process timed out in 60771ms, After SMT, problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 60782ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 84447 ms. Remains : 346/346 places, 710/710 transitions.
Treatment of property PolyORBLF-COL-S02J06T06-LTLCardinality-08 finished in 241927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 19 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 968/968 transitions.
Ensure Unique test removed 2 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 528 transition count 926
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 486 transition count 920
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 480 transition count 920
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 96 place count 480 transition count 860
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 216 place count 420 transition count 860
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 300 place count 378 transition count 818
Applied a total of 300 rules in 45 ms. Remains 378 /530 variables (removed 152) and now considering 818/968 (removed 150) transitions.
Running 816 sub problems to find dead transitions.
[2024-06-01 13:43:49] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 378 cols
[2024-06-01 13:43:49] [INFO ] Computed 42 invariants in 8 ms
[2024-06-01 13:43:49] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:43:55] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:43:55] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:43:56] [INFO ] Deduced a trap composed of 50 places in 223 ms of which 2 ms to minimize.
[2024-06-01 13:43:56] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:43:56] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:43:57] [INFO ] Deduced a trap composed of 49 places in 182 ms of which 3 ms to minimize.
[2024-06-01 13:43:57] [INFO ] Deduced a trap composed of 236 places in 214 ms of which 4 ms to minimize.
[2024-06-01 13:43:57] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 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 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 9.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 1.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 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 816 unsolved
SMT process timed out in 20914ms, After SMT, problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 20921ms
[2024-06-01 13:44:10] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-06-01 13:44:10] [INFO ] Invariant cache hit.
[2024-06-01 13:44:10] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-06-01 13:44:10] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-06-01 13:44:10] [INFO ] Invariant cache hit.
[2024-06-01 13:44:11] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:44:13] [INFO ] Implicit Places using invariants and state equation in 2347 ms returned []
Implicit Place search using SMT with State Equation took 2694 ms to find 0 implicit places.
[2024-06-01 13:44:13] [INFO ] Redundant transitions in 12 ms returned []
Running 816 sub problems to find dead transitions.
[2024-06-01 13:44:13] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-06-01 13:44:13] [INFO ] Invariant cache hit.
[2024-06-01 13:44:13] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:44:18] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:44:18] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:44:19] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:44:20] [INFO ] Deduced a trap composed of 49 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:44:20] [INFO ] Deduced a trap composed of 49 places in 216 ms of which 2 ms to minimize.
[2024-06-01 13:44:20] [INFO ] Deduced a trap composed of 228 places in 198 ms of which 2 ms to minimize.
[2024-06-01 13:44:21] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:44:25] [INFO ] Deduced a trap composed of 177 places in 233 ms of which 4 ms to minimize.
[2024-06-01 13:44:25] [INFO ] Deduced a trap composed of 161 places in 178 ms of which 3 ms to minimize.
[2024-06-01 13:44:25] [INFO ] Deduced a trap composed of 155 places in 175 ms of which 3 ms to minimize.
[2024-06-01 13:44:26] [INFO ] Deduced a trap composed of 136 places in 174 ms of which 3 ms to minimize.
[2024-06-01 13:44:31] [INFO ] Deduced a trap composed of 132 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:44:32] [INFO ] Deduced a trap composed of 155 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:44:32] [INFO ] Deduced a trap composed of 136 places in 208 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:44:37] [INFO ] Deduced a trap composed of 38 places in 197 ms of which 2 ms to minimize.
[2024-06-01 13:44:37] [INFO ] Deduced a trap composed of 63 places in 197 ms of which 3 ms to minimize.
[2024-06-01 13:44:41] [INFO ] Deduced a trap composed of 169 places in 211 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/1184 variables, and 57 constraints, problems are : Problem set: 0 solved, 816 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/378 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:44:47] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
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 TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
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 TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 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 TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/378 variables, 2/60 constraints. Problems are: Problem set: 66 solved, 750 unsolved
[2024-06-01 13:44:59] [INFO ] Deduced a trap composed of 45 places in 197 ms of which 3 ms to minimize.
[2024-06-01 13:45:06] [INFO ] Deduced a trap composed of 189 places in 215 ms of which 4 ms to minimize.
[2024-06-01 13:45:06] [INFO ] Deduced a trap composed of 130 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:45:06] [INFO ] Deduced a trap composed of 212 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:45:07] [INFO ] Deduced a trap composed of 130 places in 173 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 5/65 constraints. Problems are: Problem set: 66 solved, 750 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1184 variables, and 65 constraints, problems are : Problem set: 66 solved, 750 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/378 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 23/23 constraints]
After SMT, in 61208ms problems are : Problem set: 66 solved, 750 unsolved
Search for dead transitions found 66 dead transitions in 61224ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 378/530 places, 752/968 transitions.
Reduce places removed 2 places and 12 transitions.
Reduce places removed 6 places and 12 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 370 transition count 728
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 6 rules in 18 ms. Remains 370 /378 variables (removed 8) and now considering 728/752 (removed 24) transitions.
[2024-06-01 13:45:14] [INFO ] Flow matrix only has 716 transitions (discarded 12 similar events)
// Phase 1: matrix 716 rows 370 cols
[2024-06-01 13:45:14] [INFO ] Computed 48 invariants in 7 ms
[2024-06-01 13:45:14] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-06-01 13:45:14] [INFO ] Flow matrix only has 716 transitions (discarded 12 similar events)
[2024-06-01 13:45:14] [INFO ] Invariant cache hit.
[2024-06-01 13:45:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:45:17] [INFO ] Implicit Places using invariants and state equation in 2767 ms returned []
Implicit Place search using SMT with State Equation took 3146 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 370/530 places, 728/968 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 88074 ms. Remains : 370/530 places, 728/968 transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T06-LTLCardinality-12
Product exploration explored 100000 steps with 2505 reset in 363 ms.
Product exploration explored 100000 steps with 2500 reset in 367 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Treatment of property PolyORBLF-COL-S02J06T06-LTLCardinality-12 finished in 89020 ms.
Application raised an uncaught exception Index 368 out of bounds for length 364
java.lang.IndexOutOfBoundsException: Index 368 out of bounds for length 364
at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64)
at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:70)
at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:266)
at java.base/java.util.Objects.checkIndex(Objects.java:361)
at java.base/java.util.ArrayList.get(ArrayList.java:427)
at fr.lip6.move.gal.structural.SparsePetriNet.findAndTestSums(SparsePetriNet.java:328)
at fr.lip6.move.gal.structural.SparsePetriNet.findAndTestSums(SparsePetriNet.java:303)
at fr.lip6.move.gal.structural.SparsePetriNet.findAndTestSums(SparsePetriNet.java:350)
at fr.lip6.move.gal.structural.SparsePetriNet.findAndTestSums(SparsePetriNet.java:303)
at fr.lip6.move.gal.structural.SparsePetriNet.rewriteConstantSums(SparsePetriNet.java:292)
at fr.lip6.move.gal.structural.SparsePetriNet.simplifyLogic(SparsePetriNet.java:395)
at fr.lip6.move.gal.application.mcc.MccTranslator.simplifySPN(MccTranslator.java:451)
at fr.lip6.move.gal.application.mcc.MccTranslator.setSpn(MccTranslator.java:443)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:698)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:569)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Total runtime 756698 ms.
Could not compute solution for formula : PolyORBLF-COL-S02J06T06-LTLCardinality-00
Could not compute solution for formula : PolyORBLF-COL-S02J06T06-LTLCardinality-01
Could not compute solution for formula : PolyORBLF-COL-S02J06T06-LTLCardinality-02
Could not compute solution for formula : PolyORBLF-COL-S02J06T06-LTLCardinality-03
Could not compute solution for formula : PolyORBLF-COL-S02J06T06-LTLCardinality-04
Could not compute solution for formula : PolyORBLF-COL-S02J06T06-LTLCardinality-05
Could not compute solution for formula : PolyORBLF-COL-S02J06T06-LTLCardinality-06
Could not compute solution for formula : PolyORBLF-COL-S02J06T06-LTLCardinality-07
Could not compute solution for formula : PolyORBLF-COL-S02J06T06-LTLCardinality-08
Could not compute solution for formula : PolyORBLF-COL-S02J06T06-LTLCardinality-09
Could not compute solution for formula : PolyORBLF-COL-S02J06T06-LTLCardinality-10
Could not compute solution for formula : PolyORBLF-COL-S02J06T06-LTLCardinality-11
Could not compute solution for formula : PolyORBLF-COL-S02J06T06-LTLCardinality-12
Could not compute solution for formula : PolyORBLF-COL-S02J06T06-LTLCardinality-13
Could not compute solution for formula : PolyORBLF-COL-S02J06T06-LTLCardinality-14
Could not compute solution for formula : PolyORBLF-COL-S02J06T06-LTLCardinality-15

BK_STOP 1717249519091

--------------------
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-S02J06T06-LTLCardinality-00
ltl formula formula --ltl=/tmp/2710/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( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 3/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 2/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S02J06T06-LTLCardinality-01
ltl formula formula --ltl=/tmp/2710/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
ltl formula name PolyORBLF-COL-S02J06T06-LTLCardinality-02
ltl formula formula --ltl=/tmp/2710/ltl_2_
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( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S02J06T06-LTLCardinality-03
ltl formula formula --ltl=/tmp/2710/ltl_3_
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( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S02J06T06-LTLCardinality-04
ltl formula formula --ltl=/tmp/2710/ltl_4_
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), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S02J06T06-LTLCardinality-05
ltl formula formula --ltl=/tmp/2710/ltl_5_
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( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S02J06T06-LTLCardinality-06
ltl formula formula --ltl=/tmp/2710/ltl_6_
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), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S02J06T06-LTLCardinality-07
ltl formula formula --ltl=/tmp/2710/ltl_7_
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), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S02J06T06-LTLCardinality-08
ltl formula formula --ltl=/tmp/2710/ltl_8_
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
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
ltl formula name PolyORBLF-COL-S02J06T06-LTLCardinality-09
ltl formula formula --ltl=/tmp/2710/ltl_9_
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( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S02J06T06-LTLCardinality-10
ltl formula formula --ltl=/tmp/2710/ltl_10_
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( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S02J06T06-LTLCardinality-11
ltl formula formula --ltl=/tmp/2710/ltl_11_
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( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S02J06T06-LTLCardinality-12
ltl formula formula --ltl=/tmp/2710/ltl_12_
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), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S02J06T06-LTLCardinality-13
ltl formula formula --ltl=/tmp/2710/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
Warning: program compiled against libxml 210 using older 209
ltl formula name PolyORBLF-COL-S02J06T06-LTLCardinality-14
ltl formula formula --ltl=/tmp/2710/ltl_14_
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( 3/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S02J06T06-LTLCardinality-15
ltl formula formula --ltl=/tmp/2710/ltl_15_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported

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-S02J06T06"
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-S02J06T06, 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-171654446400099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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