Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 20:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Apr 12 20:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 20:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 174K 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 ParamProductionCell-PT-4-LTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716650716241

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 15:25:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 15:25:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:25:18] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2024-05-25 15:25:18] [INFO ] Transformed 231 places.
[2024-05-25 15:25:18] [INFO ] Transformed 202 transitions.
[2024-05-25 15:25:18] [INFO ] Found NUPN structural information;
[2024-05-25 15:25:18] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 322 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ParamProductionCell-PT-4-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 226 transition count 197
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 226 transition count 197
Applied a total of 10 rules in 68 ms. Remains 226 /231 variables (removed 5) and now considering 197/202 (removed 5) transitions.
// Phase 1: matrix 197 rows 226 cols
[2024-05-25 15:25:18] [INFO ] Computed 59 invariants in 47 ms
[2024-05-25 15:25:19] [INFO ] Implicit Places using invariants in 708 ms returned [15, 16, 18, 19, 24, 31, 35, 36, 41, 42, 46, 47, 59, 64, 65, 78, 79, 98, 99, 101, 113, 114, 116, 118, 119, 160, 161, 163, 165, 166, 191, 192, 195, 196, 201, 202, 206, 217]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 760 ms to find 38 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/231 places, 197/202 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 195
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 195
Applied a total of 4 rules in 26 ms. Remains 186 /188 variables (removed 2) and now considering 195/197 (removed 2) transitions.
// Phase 1: matrix 195 rows 186 cols
[2024-05-25 15:25:19] [INFO ] Computed 21 invariants in 4 ms
[2024-05-25 15:25:19] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-25 15:25:19] [INFO ] Invariant cache hit.
[2024-05-25 15:25:19] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:25:20] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/231 places, 195/202 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1477 ms. Remains : 186/231 places, 195/202 transitions.
Support contains 21 out of 186 places after structural reductions.
[2024-05-25 15:25:20] [INFO ] Flatten gal took : 59 ms
[2024-05-25 15:25:20] [INFO ] Flatten gal took : 25 ms
[2024-05-25 15:25:20] [INFO ] Input system was already deterministic with 195 transitions.
Support contains 19 out of 186 places (down from 21) after GAL structural reductions.
RANDOM walk for 24502 steps (5 resets) in 648 ms. (37 steps per ms) remains 0/13 properties
FORMULA ParamProductionCell-PT-4-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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(p0))'
Support contains 1 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 195/195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 194
Applied a total of 2 rules in 13 ms. Remains 185 /186 variables (removed 1) and now considering 194/195 (removed 1) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-25 15:25:21] [INFO ] Computed 21 invariants in 4 ms
[2024-05-25 15:25:21] [INFO ] Implicit Places using invariants in 169 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 171 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 194/195 transitions.
Applied a total of 0 rules in 7 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 193 ms. Remains : 184/186 places, 194/195 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLCardinality-02 finished in 558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 195/195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 194
Applied a total of 2 rules in 10 ms. Remains 185 /186 variables (removed 1) and now considering 194/195 (removed 1) transitions.
[2024-05-25 15:25:21] [INFO ] Invariant cache hit.
[2024-05-25 15:25:21] [INFO ] Implicit Places using invariants in 131 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 133 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 194/195 transitions.
Applied a total of 0 rules in 11 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 184/186 places, 194/195 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLCardinality-08 finished in 305 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||F(p1)))))'
Support contains 4 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 195/195 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 186 transition count 157
Reduce places removed 38 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 77 place count 148 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 147 transition count 156
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 78 place count 147 transition count 143
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 104 place count 134 transition count 143
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 133 transition count 142
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 133 transition count 142
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 190 place count 91 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 194 place count 89 transition count 98
Applied a total of 194 rules in 58 ms. Remains 89 /186 variables (removed 97) and now considering 98/195 (removed 97) transitions.
// Phase 1: matrix 98 rows 89 cols
[2024-05-25 15:25:21] [INFO ] Computed 21 invariants in 2 ms
[2024-05-25 15:25:22] [INFO ] Implicit Places using invariants in 95 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/186 places, 98/195 transitions.
Applied a total of 0 rules in 5 ms. Remains 88 /88 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 162 ms. Remains : 88/186 places, 98/195 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-09
Product exploration explored 100000 steps with 2129 reset in 699 ms.
Product exploration explored 100000 steps with 2110 reset in 291 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 130 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 27818 steps (6 resets) in 283 ms. (97 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 331 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 98/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 88 /88 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 88 cols
[2024-05-25 15:25:23] [INFO ] Computed 20 invariants in 2 ms
[2024-05-25 15:25:24] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-25 15:25:24] [INFO ] Invariant cache hit.
[2024-05-25 15:25:24] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:25:24] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
[2024-05-25 15:25:24] [INFO ] Redundant transitions in 2 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-25 15:25:24] [INFO ] Invariant cache hit.
[2024-05-25 15:25:24] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-25 15:25:25] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 14 ms to minimize.
[2024-05-25 15:25:25] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-05-25 15:25:25] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:25:25] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 2 ms to minimize.
[2024-05-25 15:25:25] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:25:25] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:25:25] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:25:25] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:25:25] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:25:25] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:25:25] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:25:25] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:25:25] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:25:25] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:25:25] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:25:25] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:25:26] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:25:26] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:25:26] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:25:26] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-25 15:25:26] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 2 ms to minimize.
[2024-05-25 15:25:26] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 2 ms to minimize.
[2024-05-25 15:25:26] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:25:26] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:25:26] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:25:26] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:25:26] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:25:26] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 2 ms to minimize.
[2024-05-25 15:25:26] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:25:26] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:25:26] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:25:26] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-25 15:25:26] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:25:26] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
[2024-05-25 15:25:27] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-25 15:25:27] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 2 ms to minimize.
[2024-05-25 15:25:27] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 2/88 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-25 15:25:28] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:25:28] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:25:28] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
[2024-05-25 15:25:28] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 98/186 variables, 88/149 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 66/215 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 95 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/186 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 215 constraints, problems are : Problem set: 0 solved, 95 unsolved in 7546 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 39/57 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 2/88 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 98/186 variables, 88/149 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 66/215 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 95/310 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-25 15:25:33] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:25:34] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (OVERLAPS) 0/186 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 312 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4679 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 43/43 constraints]
After SMT, in 12314ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 12329ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12900 ms. Remains : 88/88 places, 98/98 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 125 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 19765 steps (4 resets) in 58 ms. (335 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 249 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2156 reset in 147 ms.
Product exploration explored 100000 steps with 2183 reset in 386 ms.
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 88 /88 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-25 15:25:38] [INFO ] Invariant cache hit.
[2024-05-25 15:25:38] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-25 15:25:38] [INFO ] Invariant cache hit.
[2024-05-25 15:25:38] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:25:38] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2024-05-25 15:25:38] [INFO ] Redundant transitions in 2 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-25 15:25:38] [INFO ] Invariant cache hit.
[2024-05-25 15:25:38] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-25 15:25:38] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-25 15:25:39] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:25:39] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:25:39] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:25:39] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 2 ms to minimize.
[2024-05-25 15:25:39] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-25 15:25:39] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:25:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
[2024-05-25 15:25:39] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:25:39] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:25:39] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
[2024-05-25 15:25:39] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:25:39] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:25:39] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:25:39] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:25:39] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:25:39] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:25:39] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:25:39] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:25:39] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-25 15:25:39] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:25:40] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:25:40] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 2 ms to minimize.
[2024-05-25 15:25:40] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:25:40] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:25:40] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:25:40] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-25 15:25:40] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:25:40] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:25:40] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:25:40] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-25 15:25:40] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:25:40] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:25:40] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:25:40] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-25 15:25:41] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:25:41] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 2/88 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-25 15:25:42] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:25:42] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:25:42] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:25:42] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 98/186 variables, 88/149 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 66/215 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 95 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/186 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 215 constraints, problems are : Problem set: 0 solved, 95 unsolved in 6859 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 39/57 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 2/88 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 98/186 variables, 88/149 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 66/215 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 95/310 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-25 15:25:47] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:25:47] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 32 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (OVERLAPS) 0/186 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 312 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4596 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 43/43 constraints]
After SMT, in 11489ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 11496ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11890 ms. Remains : 88/88 places, 98/98 transitions.
Treatment of property ParamProductionCell-PT-4-LTLCardinality-09 finished in 28244 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(F(p0)))) U G(p1)))'
Support contains 4 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 195/195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 194
Applied a total of 2 rules in 5 ms. Remains 185 /186 variables (removed 1) and now considering 194/195 (removed 1) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-25 15:25:50] [INFO ] Computed 21 invariants in 2 ms
[2024-05-25 15:25:50] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-25 15:25:50] [INFO ] Invariant cache hit.
[2024-05-25 15:25:50] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:25:50] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-05-25 15:25:50] [INFO ] Invariant cache hit.
[2024-05-25 15:25:50] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:25:51] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:25:51] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-25 15:25:51] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 2 ms to minimize.
[2024-05-25 15:25:51] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:25:51] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-05-25 15:25:51] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:25:51] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 2 ms to minimize.
[2024-05-25 15:25:52] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:25:52] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:25:52] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 2 ms to minimize.
[2024-05-25 15:25:52] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:25:52] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 2 ms to minimize.
[2024-05-25 15:25:52] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:25:52] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:25:52] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:25:52] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 2 ms to minimize.
[2024-05-25 15:25:52] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:25:52] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
[2024-05-25 15:25:52] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:25:52] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:25:53] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 2 ms to minimize.
[2024-05-25 15:25:53] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-25 15:25:53] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 2 ms to minimize.
[2024-05-25 15:25:53] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:25:53] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:25:53] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 2 ms to minimize.
[2024-05-25 15:25:53] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:25:54] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 5/184 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:25:56] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:25:56] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:25:56] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-25 15:25:56] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 2 ms to minimize.
[2024-05-25 15:25:56] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-05-25 15:25:56] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:25:56] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 2 ms to minimize.
[2024-05-25 15:25:56] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:25:56] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 2 ms to minimize.
[2024-05-25 15:25:56] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:25:56] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:25:57] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
[2024-05-25 15:25:57] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:25:57] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:25:57] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:25:57] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:25:57] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:25:57] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:25:58] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 5 ms to minimize.
[2024-05-25 15:25:58] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:25:59] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 3 ms to minimize.
[2024-05-25 15:25:59] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-05-25 15:25:59] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 2 ms to minimize.
[2024-05-25 15:26:00] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:26:00] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (OVERLAPS) 1/185 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (OVERLAPS) 194/379 variables, 185/259 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 68/327 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/379 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/379 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 327 constraints, problems are : Problem set: 0 solved, 190 unsolved in 26151 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 45/59 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 5/184 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 1/185 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 194/379 variables, 185/259 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 68/327 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 190/517 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (OVERLAPS) 0/379 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 517 constraints, problems are : Problem set: 0 solved, 190 unsolved in 15733 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 53/53 constraints]
After SMT, in 41924ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 41928ms
Starting structural reductions in LTL mode, iteration 1 : 185/186 places, 194/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42450 ms. Remains : 185/186 places, 194/195 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-12
Product exploration explored 100000 steps with 25042 reset in 139 ms.
Product exploration explored 100000 steps with 24975 reset in 148 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 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1246 steps (0 resets) in 8 ms. (138 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 4 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2024-05-25 15:26:34] [INFO ] Invariant cache hit.
[2024-05-25 15:26:34] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-25 15:26:34] [INFO ] Invariant cache hit.
[2024-05-25 15:26:34] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:26:34] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-05-25 15:26:34] [INFO ] Invariant cache hit.
[2024-05-25 15:26:34] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:26:35] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 2 ms to minimize.
[2024-05-25 15:26:35] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:26:35] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 2 ms to minimize.
[2024-05-25 15:26:35] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 3 ms to minimize.
[2024-05-25 15:26:35] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:26:35] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:26:35] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 2 ms to minimize.
[2024-05-25 15:26:36] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:26:36] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 2 ms to minimize.
[2024-05-25 15:26:36] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:26:36] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
[2024-05-25 15:26:36] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:26:36] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:26:36] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:26:36] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 2 ms to minimize.
[2024-05-25 15:26:36] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
[2024-05-25 15:26:36] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:26:36] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
[2024-05-25 15:26:36] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:26:36] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:26:37] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:26:37] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:26:37] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 2 ms to minimize.
[2024-05-25 15:26:37] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:26:37] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 2 ms to minimize.
[2024-05-25 15:26:37] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 2 ms to minimize.
[2024-05-25 15:26:37] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:26:38] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 5/184 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:26:40] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:26:40] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
[2024-05-25 15:26:40] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-25 15:26:40] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 2 ms to minimize.
[2024-05-25 15:26:40] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-25 15:26:40] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:26:40] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:26:40] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 2 ms to minimize.
[2024-05-25 15:26:40] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
[2024-05-25 15:26:40] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:26:40] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:26:40] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:26:41] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:26:41] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:26:41] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:26:41] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:26:41] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:26:41] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:26:42] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:26:42] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:26:43] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 2 ms to minimize.
[2024-05-25 15:26:43] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-25 15:26:43] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:26:44] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:26:44] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (OVERLAPS) 1/185 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (OVERLAPS) 194/379 variables, 185/259 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 68/327 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/379 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/379 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 327 constraints, problems are : Problem set: 0 solved, 190 unsolved in 25655 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 45/59 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 5/184 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 1/185 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 194/379 variables, 185/259 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 68/327 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 190/517 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (OVERLAPS) 0/379 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 517 constraints, problems are : Problem set: 0 solved, 190 unsolved in 16398 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 53/53 constraints]
After SMT, in 42089ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 42093ms
Finished structural reductions in LTL mode , in 1 iterations and 42568 ms. Remains : 185/185 places, 194/194 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 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 537 steps (0 resets) in 5 ms. (89 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25094 reset in 139 ms.
Product exploration explored 100000 steps with 24992 reset in 159 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 185 transition count 194
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 36 place count 185 transition count 194
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 47 place count 185 transition count 194
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 175 transition count 184
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 175 transition count 184
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 108 place count 175 transition count 184
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 133 place count 150 transition count 159
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 158 place count 150 transition count 159
Deduced a syphon composed of 53 places in 0 ms
Applied a total of 158 rules in 57 ms. Remains 150 /185 variables (removed 35) and now considering 159/194 (removed 35) transitions.
[2024-05-25 15:27:18] [INFO ] Redundant transitions in 5 ms returned []
Running 155 sub problems to find dead transitions.
// Phase 1: matrix 159 rows 150 cols
[2024-05-25 15:27:18] [INFO ] Computed 21 invariants in 2 ms
[2024-05-25 15:27:18] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-25 15:27:19] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:27:19] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
[2024-05-25 15:27:19] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:27:19] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
[2024-05-25 15:27:19] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:27:19] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
[2024-05-25 15:27:19] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:27:19] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
[2024-05-25 15:27:19] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:27:20] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-25 15:27:20] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:27:20] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
[2024-05-25 15:27:20] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:27:20] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 2 ms to minimize.
[2024-05-25 15:27:20] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
[2024-05-25 15:27:20] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-25 15:27:20] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 2 ms to minimize.
[2024-05-25 15:27:20] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:27:20] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
[2024-05-25 15:27:20] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 20/34 constraints. Problems are: Problem set: 28 solved, 127 unsolved
[2024-05-25 15:27:20] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
[2024-05-25 15:27:21] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:27:21] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:27:21] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 4/38 constraints. Problems are: Problem set: 28 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/38 constraints. Problems are: Problem set: 28 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 5/149 variables, 5/43 constraints. Problems are: Problem set: 28 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 1/44 constraints. Problems are: Problem set: 28 solved, 127 unsolved
[2024-05-25 15:27:22] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
[2024-05-25 15:27:22] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
[2024-05-25 15:27:22] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-25 15:27:22] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
[2024-05-25 15:27:22] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-25 15:27:22] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
[2024-05-25 15:27:22] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:27:22] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-25 15:27:23] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:27:23] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:27:23] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
[2024-05-25 15:27:23] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
[2024-05-25 15:27:23] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
[2024-05-25 15:27:23] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-25 15:27:23] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:27:23] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 2 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-25 15:27:23] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 2 ms to minimize.
[2024-05-25 15:27:23] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD80 is UNSAT
[2024-05-25 15:27:23] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
[2024-05-25 15:27:23] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 20/64 constraints. Problems are: Problem set: 53 solved, 102 unsolved
[2024-05-25 15:27:24] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:27:24] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:27:24] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-25 15:27:24] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:27:24] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 5/69 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/69 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/150 variables, 1/70 constraints. Problems are: Problem set: 53 solved, 102 unsolved
[2024-05-25 15:27:26] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:27:26] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 2/72 constraints. Problems are: Problem set: 53 solved, 102 unsolved
[2024-05-25 15:27:26] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 1/73 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/150 variables, 0/73 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 13 (OVERLAPS) 159/309 variables, 150/223 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/309 variables, 68/291 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/309 variables, 0/291 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 16 (OVERLAPS) 0/309 variables, 0/291 constraints. Problems are: Problem set: 53 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 291 constraints, problems are : Problem set: 53 solved, 102 unsolved in 12055 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 150/150 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 53 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 10/10 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 39/49 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/49 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 58/149 variables, 9/58 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 1/59 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 13/72 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/72 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/150 variables, 1/73 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/73 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 159/309 variables, 150/223 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 68/291 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 102/393 constraints. Problems are: Problem set: 53 solved, 102 unsolved
[2024-05-25 15:27:33] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/309 variables, 1/394 constraints. Problems are: Problem set: 53 solved, 102 unsolved
[2024-05-25 15:27:36] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/309 variables, 1/395 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/309 variables, 0/395 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 15 (OVERLAPS) 0/309 variables, 0/395 constraints. Problems are: Problem set: 53 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 395 constraints, problems are : Problem set: 53 solved, 102 unsolved in 11244 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 150/150 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 102/155 constraints, Known Traps: 54/54 constraints]
After SMT, in 23333ms problems are : Problem set: 53 solved, 102 unsolved
Search for dead transitions found 53 dead transitions in 23336ms
Found 53 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 53 transitions
Dead transitions reduction (with SMT) removed 53 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 150/185 places, 106/194 transitions.
Graph (complete) has 311 edges and 150 vertex of which 97 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.3 ms
Discarding 53 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 97 transition count 106
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 97 transition count 106
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 4 rules in 17 ms. Remains 97 /150 variables (removed 53) and now considering 106/106 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/185 places, 106/194 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 23425 ms. Remains : 97/185 places, 106/194 transitions.
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-25 15:27:42] [INFO ] Computed 21 invariants in 2 ms
[2024-05-25 15:27:42] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-25 15:27:42] [INFO ] Invariant cache hit.
[2024-05-25 15:27:42] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:27:42] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-05-25 15:27:42] [INFO ] Invariant cache hit.
[2024-05-25 15:27:42] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:27:43] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-25 15:27:43] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 2 ms to minimize.
[2024-05-25 15:27:43] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:27:43] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-25 15:27:43] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-05-25 15:27:44] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-05-25 15:27:44] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
[2024-05-25 15:27:44] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:27:44] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-25 15:27:44] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 5 ms to minimize.
[2024-05-25 15:27:44] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:27:44] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 2 ms to minimize.
[2024-05-25 15:27:44] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:27:44] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:27:44] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 2 ms to minimize.
[2024-05-25 15:27:44] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-25 15:27:44] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:27:45] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-25 15:27:45] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:27:45] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:27:45] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:27:45] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-25 15:27:45] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 2 ms to minimize.
[2024-05-25 15:27:45] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:27:45] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:27:46] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-05-25 15:27:46] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:27:46] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 5/184 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:27:48] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:27:48] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:27:48] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 2 ms to minimize.
[2024-05-25 15:27:48] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-05-25 15:27:48] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 2 ms to minimize.
[2024-05-25 15:27:49] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-25 15:27:49] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 2 ms to minimize.
[2024-05-25 15:27:49] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:27:49] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:27:49] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:27:49] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:27:49] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:27:49] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:27:49] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:27:49] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:27:49] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:27:49] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
[2024-05-25 15:27:50] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:27:50] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-25 15:27:50] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:27:52] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 1 ms to minimize.
[2024-05-25 15:27:52] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-25 15:27:52] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 2 ms to minimize.
[2024-05-25 15:27:52] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-25 15:27:53] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (OVERLAPS) 1/185 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (OVERLAPS) 194/379 variables, 185/259 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 68/327 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/379 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/379 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 327 constraints, problems are : Problem set: 0 solved, 190 unsolved in 26426 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 45/59 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 5/184 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 1/185 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 194/379 variables, 185/259 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 68/327 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 190/517 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (OVERLAPS) 0/379 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 517 constraints, problems are : Problem set: 0 solved, 190 unsolved in 16198 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 53/53 constraints]
After SMT, in 42662ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 42665ms
Finished structural reductions in LTL mode , in 1 iterations and 43208 ms. Remains : 185/185 places, 194/194 transitions.
Treatment of property ParamProductionCell-PT-4-LTLCardinality-12 finished in 155178 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)&&(p1||X(X(p2))))))'
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 195/195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 194
Applied a total of 2 rules in 8 ms. Remains 185 /186 variables (removed 1) and now considering 194/195 (removed 1) transitions.
[2024-05-25 15:28:25] [INFO ] Invariant cache hit.
[2024-05-25 15:28:25] [INFO ] Implicit Places using invariants in 242 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 245 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 194/195 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 259 ms. Remains : 184/186 places, 194/195 transitions.
Stuttering acceptance computed with spot in 431 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-13
Product exploration explored 100000 steps with 391 reset in 127 ms.
Stack based approach found an accepted trace after 310 steps with 2 reset with depth 207 and stack size 207 in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLCardinality-13 finished in 867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 195/195 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 186 transition count 153
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 144 transition count 153
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 84 place count 144 transition count 143
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 104 place count 134 transition count 143
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 196 place count 88 transition count 97
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 200 place count 86 transition count 95
Applied a total of 200 rules in 17 ms. Remains 86 /186 variables (removed 100) and now considering 95/195 (removed 100) transitions.
// Phase 1: matrix 95 rows 86 cols
[2024-05-25 15:28:26] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 15:28:26] [INFO ] Implicit Places using invariants in 113 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/186 places, 95/195 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 150 ms. Remains : 85/186 places, 95/195 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-15
Product exploration explored 100000 steps with 731 reset in 174 ms.
Stack based approach found an accepted trace after 160 steps with 0 reset with depth 161 and stack size 161 in 0 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLCardinality-15 finished in 422 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||F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(F(p0)))) U G(p1)))'
Found a Shortening insensitive property : ParamProductionCell-PT-4-LTLCardinality-12
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 186 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 186/186 places, 195/195 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 186 transition count 155
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 146 transition count 155
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 80 place count 146 transition count 145
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 100 place count 136 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 135 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 135 transition count 144
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 184 place count 94 transition count 103
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 188 place count 92 transition count 101
Applied a total of 188 rules in 22 ms. Remains 92 /186 variables (removed 94) and now considering 101/195 (removed 94) transitions.
// Phase 1: matrix 101 rows 92 cols
[2024-05-25 15:28:27] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 15:28:27] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-25 15:28:27] [INFO ] Invariant cache hit.
[2024-05-25 15:28:27] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:28:27] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-25 15:28:27] [INFO ] Invariant cache hit.
[2024-05-25 15:28:27] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:28:27] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-25 15:28:27] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:28:27] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:28:27] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:28:28] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-25 15:28:28] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:28:28] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:28:28] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:28:28] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:28:28] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:28:28] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:28:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:28:28] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:28:28] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:28:28] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:28:28] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 2 ms to minimize.
[2024-05-25 15:28:28] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:28:28] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:28:28] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:28:28] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:28:28] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:28:28] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
[2024-05-25 15:28:28] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 2 ms to minimize.
[2024-05-25 15:28:28] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:28:29] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:28:29] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:28:29] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:28:29] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:28:29] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-25 15:28:29] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-25 15:28:29] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:28:29] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:28:29] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:28:29] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:28:29] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-25 15:28:29] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:28:29] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:28:29] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:28:29] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:28:30] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:28:30] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 4/92 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:28:31] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:28:31] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-25 15:28:31] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-25 15:28:31] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-25 15:28:31] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:28:31] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 101/193 variables, 92/160 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 66/226 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:28:33] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 0/193 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 227 constraints, problems are : Problem set: 0 solved, 97 unsolved in 7432 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 47/62 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:28:35] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:28:35] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 4/92 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:28:36] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 101/193 variables, 92/164 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 66/230 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 97/327 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:28:37] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 0/193 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 328 constraints, problems are : Problem set: 0 solved, 97 unsolved in 7384 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 52/52 constraints]
After SMT, in 14836ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 14838ms
Starting structural reductions in LI_LTL mode, iteration 1 : 92/186 places, 101/195 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 15206 ms. Remains : 92/186 places, 101/195 transitions.
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-12
Product exploration explored 100000 steps with 24955 reset in 137 ms.
Product exploration explored 100000 steps with 24964 reset in 155 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 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 359 steps (0 resets) in 5 ms. (59 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 92 /92 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-25 15:28:43] [INFO ] Invariant cache hit.
[2024-05-25 15:28:43] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-25 15:28:43] [INFO ] Invariant cache hit.
[2024-05-25 15:28:43] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:28:43] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-25 15:28:43] [INFO ] Invariant cache hit.
[2024-05-25 15:28:43] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:28:44] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:28:44] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:28:44] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:28:44] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:28:44] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:28:44] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:28:44] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:28:44] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:28:44] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:28:44] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:28:44] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:28:44] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:28:44] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:28:44] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:28:44] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-25 15:28:44] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:28:44] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:28:44] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:28:45] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:28:45] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:28:45] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:28:45] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:28:45] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:28:45] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-25 15:28:45] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:28:45] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
[2024-05-25 15:28:45] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:28:45] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:28:45] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-25 15:28:45] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:28:45] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:28:45] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-25 15:28:45] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:28:45] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:28:45] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:28:45] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:28:45] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:28:46] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:28:46] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:28:46] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:28:46] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 4/92 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:28:47] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-25 15:28:47] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-25 15:28:47] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-25 15:28:47] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:28:47] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:28:47] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 101/193 variables, 92/160 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 66/226 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:28:49] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 0/193 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 227 constraints, problems are : Problem set: 0 solved, 97 unsolved in 7276 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 47/62 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:28:51] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:28:51] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 4/92 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:28:52] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 101/193 variables, 92/164 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 66/230 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 97/327 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:28:53] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 0/193 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 328 constraints, problems are : Problem set: 0 solved, 97 unsolved in 7242 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 52/52 constraints]
After SMT, in 14540ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 14542ms
Finished structural reductions in LTL mode , in 1 iterations and 14914 ms. Remains : 92/92 places, 101/101 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 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 625 steps (0 resets) in 6 ms. (89 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25038 reset in 128 ms.
Product exploration explored 100000 steps with 25090 reset in 144 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 101/101 transitions.
Applied a total of 0 rules in 4 ms. Remains 92 /92 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-25 15:29:00] [INFO ] Redundant transitions in 2 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-25 15:29:00] [INFO ] Invariant cache hit.
[2024-05-25 15:29:00] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:29:00] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:29:00] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:29:00] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:29:00] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:29:00] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:29:00] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:29:00] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:29:00] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-25 15:29:00] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:29:01] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:29:01] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:29:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:29:01] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:29:01] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:29:01] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:29:01] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:29:01] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 2 ms to minimize.
[2024-05-25 15:29:01] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:29:01] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:29:01] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:29:01] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:29:01] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:29:01] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:29:01] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-25 15:29:01] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:29:01] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:29:01] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:29:01] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-25 15:29:01] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-25 15:29:01] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:29:01] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:29:02] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:29:02] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:29:02] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:29:02] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:29:02] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:29:02] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:29:02] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:29:02] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:29:02] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:29:03] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 4/92 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:29:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-25 15:29:03] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:29:04] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-25 15:29:04] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:29:04] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:29:04] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 101/193 variables, 92/160 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 66/226 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:29:05] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 0/193 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 227 constraints, problems are : Problem set: 0 solved, 97 unsolved in 7123 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 47/62 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:29:07] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:29:07] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 4/92 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:29:08] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 101/193 variables, 92/164 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 66/230 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 97/327 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:29:10] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 0/193 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 328 constraints, problems are : Problem set: 0 solved, 97 unsolved in 7323 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 52/52 constraints]
After SMT, in 14474ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 14477ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14489 ms. Remains : 92/92 places, 101/101 transitions.
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 92 /92 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-25 15:29:14] [INFO ] Invariant cache hit.
[2024-05-25 15:29:14] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-25 15:29:14] [INFO ] Invariant cache hit.
[2024-05-25 15:29:14] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-25 15:29:15] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-25 15:29:15] [INFO ] Invariant cache hit.
[2024-05-25 15:29:15] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:29:15] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:29:15] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:29:15] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:29:15] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:29:15] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:29:15] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:29:15] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:29:15] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:29:15] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-25 15:29:15] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:29:15] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:29:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:29:15] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:29:15] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:29:15] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:29:16] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:29:16] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:29:16] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:29:16] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-25 15:29:16] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:29:16] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:29:16] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:29:16] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
[2024-05-25 15:29:16] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-25 15:29:16] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:29:16] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:29:16] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:29:16] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-25 15:29:16] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-25 15:29:16] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:29:16] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:29:16] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:29:16] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:29:16] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-25 15:29:16] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:29:16] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:29:16] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:29:17] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:29:17] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:29:17] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:29:17] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 4/92 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:29:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:29:18] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-25 15:29:18] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-25 15:29:18] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:29:18] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:29:19] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 101/193 variables, 92/160 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 66/226 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:29:20] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 0/193 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 227 constraints, problems are : Problem set: 0 solved, 97 unsolved in 7418 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 47/62 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:29:22] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:29:22] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 4/92 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:29:23] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 101/193 variables, 92/164 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 66/230 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 97/327 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 15:29:25] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 0/193 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 328 constraints, problems are : Problem set: 0 solved, 97 unsolved in 7358 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 52/52 constraints]
After SMT, in 14794ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 14797ms
Finished structural reductions in LTL mode , in 1 iterations and 15140 ms. Remains : 92/92 places, 101/101 transitions.
Treatment of property ParamProductionCell-PT-4-LTLCardinality-12 finished in 63089 ms.
[2024-05-25 15:29:29] [INFO ] Flatten gal took : 16 ms
[2024-05-25 15:29:29] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-05-25 15:29:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 186 places, 195 transitions and 588 arcs took 5 ms.
Total runtime 251838 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ParamProductionCell-PT-4

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 186
TRANSITIONS: 195
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.003s]


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


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

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

Process ID: 2932
MODEL NAME: /home/mcc/execution/413/model
186 places, 195 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ParamProductionCell-PT-4-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ParamProductionCell-PT-4-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716651306495

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ParamProductionCell-PT-4, 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 r267-smll-171654405600043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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