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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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 3.0K 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 20K Apr 12 20:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 20:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 20:33 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-1-LTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-1-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717242923359

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-1
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:55:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:55:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:55:26] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2024-06-01 11:55:26] [INFO ] Transformed 231 places.
[2024-06-01 11:55:26] [INFO ] Transformed 202 transitions.
[2024-06-01 11:55:26] [INFO ] Found NUPN structural information;
[2024-06-01 11:55:26] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 547 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 3 formulas.
FORMULA ParamProductionCell-PT-1-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 227 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 227 transition count 198
Applied a total of 8 rules in 181 ms. Remains 227 /231 variables (removed 4) and now considering 198/202 (removed 4) transitions.
// Phase 1: matrix 198 rows 227 cols
[2024-06-01 11:55:26] [INFO ] Computed 59 invariants in 23 ms
[2024-06-01 11:55:27] [INFO ] Implicit Places using invariants in 790 ms returned [1, 15, 16, 18, 19, 31, 35, 36, 41, 42, 47, 59, 64, 65, 73, 78, 98, 101, 113, 114, 116, 118, 119, 160, 161, 163, 165, 166, 190, 192, 193, 196, 197, 202, 203, 207, 218]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 843 ms to find 37 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 190/231 places, 198/202 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 188 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 188 transition count 196
Applied a total of 4 rules in 42 ms. Remains 188 /190 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 188 cols
[2024-06-01 11:55:27] [INFO ] Computed 22 invariants in 7 ms
[2024-06-01 11:55:27] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-06-01 11:55:27] [INFO ] Invariant cache hit.
[2024-06-01 11:55:28] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 11:55:28] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 188/231 places, 196/202 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2061 ms. Remains : 188/231 places, 196/202 transitions.
Support contains 27 out of 188 places after structural reductions.
[2024-06-01 11:55:29] [INFO ] Flatten gal took : 85 ms
[2024-06-01 11:55:29] [INFO ] Flatten gal took : 36 ms
[2024-06-01 11:55:29] [INFO ] Input system was already deterministic with 196 transitions.
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 40000 steps (8 resets) in 2484 ms. (16 steps per ms) remains 3/15 properties
BEST_FIRST walk for 40002 steps (8 resets) in 618 ms. (64 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 386 ms. (103 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 259 ms. (153 steps per ms) remains 3/3 properties
[2024-06-01 11:55:30] [INFO ] Invariant cache hit.
[2024-06-01 11:55:30] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 139/144 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 12/156 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/162 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 159/321 variables, 162/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 37/358 variables, 68/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 26/384 variables, 26/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/384 variables, 10/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/384 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 278 constraints, problems are : Problem set: 0 solved, 3 unsolved in 571 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Int declared 144/384 variables, and 8 constraints, problems are : Problem set: 3 solved, 0 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 8/21 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/188 constraints, ReadFeed: 0/68 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 714ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 8 simplifications.
FORMULA ParamProductionCell-PT-1-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(F(p1))))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 196/196 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 188 transition count 158
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 150 transition count 158
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 76 place count 150 transition count 151
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 90 place count 143 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 142 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 142 transition count 150
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 166 place count 105 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 168 place count 104 transition count 112
Applied a total of 168 rules in 88 ms. Remains 104 /188 variables (removed 84) and now considering 112/196 (removed 84) transitions.
// Phase 1: matrix 112 rows 104 cols
[2024-06-01 11:55:31] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 11:55:31] [INFO ] Implicit Places using invariants in 157 ms returned [0, 3, 5, 8, 19, 32, 38, 43, 66]
[2024-06-01 11:55:31] [INFO ] Actually due to overlaps returned [43, 5, 19, 8, 32, 0, 66]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 161 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/188 places, 112/196 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 97 transition count 108
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 93 transition count 108
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 40 place count 77 transition count 92
Applied a total of 40 rules in 24 ms. Remains 77 /97 variables (removed 20) and now considering 92/112 (removed 20) transitions.
// Phase 1: matrix 92 rows 77 cols
[2024-06-01 11:55:31] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 11:55:31] [INFO ] Implicit Places using invariants in 133 ms returned [1, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 136 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/188 places, 92/196 transitions.
Applied a total of 0 rules in 8 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 419 ms. Remains : 75/188 places, 92/196 transitions.
Stuttering acceptance computed with spot in 406 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLCardinality-01
Product exploration explored 100000 steps with 5263 reset in 631 ms.
Product exploration explored 100000 steps with 5263 reset in 335 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 128 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 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 208 steps (0 resets) in 7 ms. (26 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 299 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 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 92 rows 75 cols
[2024-06-01 11:55:34] [INFO ] Computed 13 invariants in 2 ms
[2024-06-01 11:55:34] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-01 11:55:34] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-06-01 11:55:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:55:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 11:55:34] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-06-01 11:55:34] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 11:55:34] [INFO ] [Nat]Added 67 Read/Feed constraints in 20 ms returned sat
[2024-06-01 11:55:34] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 16 ms to minimize.
[2024-06-01 11:55:34] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 3 ms to minimize.
[2024-06-01 11:55:34] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 2 ms to minimize.
[2024-06-01 11:55:35] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 3 ms to minimize.
[2024-06-01 11:55:35] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
[2024-06-01 11:55:35] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 2 ms to minimize.
[2024-06-01 11:55:35] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 2 ms to minimize.
[2024-06-01 11:55:35] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 2 ms to minimize.
[2024-06-01 11:55:35] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
[2024-06-01 11:55:35] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 2 ms to minimize.
[2024-06-01 11:55:35] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:55:35] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:55:35] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 927 ms
[2024-06-01 11:55:35] [INFO ] Computed and/alt/rep : 91/213/91 causal constraints (skipped 0 transitions) in 17 ms.
[2024-06-01 11:55:35] [INFO ] Added : 89 causal constraints over 19 iterations in 363 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 7 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-01 11:55:35] [INFO ] Invariant cache hit.
[2024-06-01 11:55:36] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-06-01 11:55:36] [INFO ] Invariant cache hit.
[2024-06-01 11:55:36] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 11:55:36] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2024-06-01 11:55:36] [INFO ] Redundant transitions in 3 ms returned []
Running 91 sub problems to find dead transitions.
[2024-06-01 11:55:36] [INFO ] Invariant cache hit.
[2024-06-01 11:55:36] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-01 11:55:37] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-06-01 11:55:37] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 2 ms to minimize.
[2024-06-01 11:55:37] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2024-06-01 11:55:37] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 3 ms to minimize.
[2024-06-01 11:55:37] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 2 ms to minimize.
[2024-06-01 11:55:37] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 4 ms to minimize.
[2024-06-01 11:55:37] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 4 ms to minimize.
[2024-06-01 11:55:37] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-06-01 11:55:37] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:55:37] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
[2024-06-01 11:55:37] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
[2024-06-01 11:55:38] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
[2024-06-01 11:55:38] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
[2024-06-01 11:55:38] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-06-01 11:55:38] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-06-01 11:55:38] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 2 ms to minimize.
[2024-06-01 11:55:38] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
[2024-06-01 11:55:38] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 2 ms to minimize.
[2024-06-01 11:55:38] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
[2024-06-01 11:55:38] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 20/33 constraints. Problems are: Problem set: 15 solved, 76 unsolved
[2024-06-01 11:55:38] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:55:38] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 3 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-06-01 11:55:38] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 10 ms to minimize.
[2024-06-01 11:55:38] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
[2024-06-01 11:55:39] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2024-06-01 11:55:39] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:55:39] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 11:55:39] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:55:39] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-06-01 11:55:39] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 11:55:39] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
[2024-06-01 11:55:39] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:55:39] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-06-01 11:55:39] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-06-01 11:55:39] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
Problem TDEAD90 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 15/48 constraints. Problems are: Problem set: 24 solved, 67 unsolved
[2024-06-01 11:55:40] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/49 constraints. Problems are: Problem set: 24 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/49 constraints. Problems are: Problem set: 24 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 92/167 variables, 75/124 constraints. Problems are: Problem set: 24 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 67/191 constraints. Problems are: Problem set: 24 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/191 constraints. Problems are: Problem set: 24 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/167 variables, 0/191 constraints. Problems are: Problem set: 24 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 191 constraints, problems are : Problem set: 24 solved, 67 unsolved in 5351 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 75/75 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 24 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 10/10 constraints. Problems are: Problem set: 24 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 12/22 constraints. Problems are: Problem set: 24 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/22 constraints. Problems are: Problem set: 24 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 8/75 variables, 3/25 constraints. Problems are: Problem set: 24 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 24/49 constraints. Problems are: Problem set: 24 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/49 constraints. Problems are: Problem set: 24 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 92/167 variables, 75/124 constraints. Problems are: Problem set: 24 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 67/191 constraints. Problems are: Problem set: 24 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 67/258 constraints. Problems are: Problem set: 24 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/258 constraints. Problems are: Problem set: 24 solved, 67 unsolved
At refinement iteration 10 (OVERLAPS) 0/167 variables, 0/258 constraints. Problems are: Problem set: 24 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 258 constraints, problems are : Problem set: 24 solved, 67 unsolved in 3134 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 75/75 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 67/91 constraints, Known Traps: 36/36 constraints]
After SMT, in 8581ms problems are : Problem set: 24 solved, 67 unsolved
Search for dead transitions found 24 dead transitions in 8589ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 75/75 places, 68/92 transitions.
Graph (complete) has 212 edges and 75 vertex of which 67 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 67 /75 variables (removed 8) and now considering 68/68 (removed 0) transitions.
// Phase 1: matrix 68 rows 67 cols
[2024-06-01 11:55:45] [INFO ] Computed 13 invariants in 2 ms
[2024-06-01 11:55:45] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-01 11:55:45] [INFO ] Invariant cache hit.
[2024-06-01 11:55:45] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 11:55:45] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/75 places, 68/92 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9442 ms. Remains : 67/75 places, 68/92 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 161 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 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 208 steps (0 resets) in 10 ms. (18 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 315 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 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 11:55:46] [INFO ] Invariant cache hit.
[2024-06-01 11:55:46] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-06-01 11:55:46] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-01 11:55:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:55:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-01 11:55:46] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-01 11:55:46] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 11:55:46] [INFO ] [Nat]Added 47 Read/Feed constraints in 7 ms returned sat
[2024-06-01 11:55:46] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 2 ms to minimize.
[2024-06-01 11:55:46] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:55:46] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
[2024-06-01 11:55:46] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:55:46] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:55:46] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
[2024-06-01 11:55:46] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:55:46] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:55:46] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 14 ms to minimize.
[2024-06-01 11:55:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 373 ms
[2024-06-01 11:55:46] [INFO ] Computed and/alt/rep : 67/101/67 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 11:55:46] [INFO ] Added : 64 causal constraints over 13 iterations in 145 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5263 reset in 183 ms.
Product exploration explored 100000 steps with 5263 reset in 172 ms.
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 68/68 transitions.
Applied a total of 0 rules in 4 ms. Remains 67 /67 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-06-01 11:55:47] [INFO ] Invariant cache hit.
[2024-06-01 11:55:47] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-01 11:55:47] [INFO ] Invariant cache hit.
[2024-06-01 11:55:47] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 11:55:47] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2024-06-01 11:55:47] [INFO ] Redundant transitions in 1 ms returned []
Running 67 sub problems to find dead transitions.
[2024-06-01 11:55:47] [INFO ] Invariant cache hit.
[2024-06-01 11:55:47] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-06-01 11:55:47] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:55:48] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:55:48] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:55:48] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:55:48] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 2 ms to minimize.
[2024-06-01 11:55:48] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:55:48] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:55:48] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:55:48] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:55:48] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:55:48] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 2 ms to minimize.
[2024-06-01 11:55:48] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
[2024-06-01 11:55:48] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 2 ms to minimize.
[2024-06-01 11:55:48] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:55:48] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:55:48] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 2 ms to minimize.
[2024-06-01 11:55:48] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:55:48] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 2 ms to minimize.
[2024-06-01 11:55:48] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:55:48] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-06-01 11:55:49] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:55:49] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:55:49] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 68/135 variables, 67/103 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 47/150 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 150 constraints, problems are : Problem set: 0 solved, 67 unsolved in 3265 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 67/67 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 68/135 variables, 67/103 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 47/150 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 67/217 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-06-01 11:55:52] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 218 constraints, problems are : Problem set: 0 solved, 67 unsolved in 2983 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 67/67 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 24/24 constraints]
After SMT, in 6266ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 6268ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6555 ms. Remains : 67/67 places, 68/68 transitions.
Treatment of property ParamProductionCell-PT-1-LTLCardinality-01 finished in 22635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(p0)))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 5 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2024-06-01 11:55:54] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 11:55:54] [INFO ] Implicit Places using invariants in 234 ms returned [19, 36, 63, 82]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 236 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 182/188 places, 194/196 transitions.
Applied a total of 0 rules in 1 ms. Remains 182 /182 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 244 ms. Remains : 182/188 places, 194/196 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-1-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-1-LTLCardinality-06 finished in 378 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((F(p1)||p0)))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 4 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
[2024-06-01 11:55:54] [INFO ] Invariant cache hit.
[2024-06-01 11:55:54] [INFO ] Implicit Places using invariants in 201 ms returned [19, 63, 82]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 202 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/188 places, 194/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 183 /183 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 209 ms. Remains : 183/188 places, 194/196 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Product exploration explored 100000 steps with 50000 reset in 202 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-1-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-1-LTLCardinality-07 finished in 815 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 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 196/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 188 transition count 159
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 151 transition count 159
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 74 place count 151 transition count 152
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 88 place count 144 transition count 152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 142 transition count 150
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 142 transition count 150
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 168 place count 104 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 170 place count 103 transition count 111
Applied a total of 170 rules in 21 ms. Remains 103 /188 variables (removed 85) and now considering 111/196 (removed 85) transitions.
// Phase 1: matrix 111 rows 103 cols
[2024-06-01 11:55:55] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 11:55:55] [INFO ] Implicit Places using invariants in 157 ms returned [0, 3, 5, 8, 19, 32, 36, 41, 66]
[2024-06-01 11:55:55] [INFO ] Actually due to overlaps returned [41, 5, 19, 8, 32, 0]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 159 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/188 places, 111/196 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 97 transition count 107
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 93 transition count 107
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 40 place count 77 transition count 91
Applied a total of 40 rules in 9 ms. Remains 77 /97 variables (removed 20) and now considering 91/111 (removed 20) transitions.
// Phase 1: matrix 91 rows 77 cols
[2024-06-01 11:55:55] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 11:55:55] [INFO ] Implicit Places using invariants in 149 ms returned [1, 27, 48]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 156 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/188 places, 91/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 349 ms. Remains : 74/188 places, 91/196 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLCardinality-08
Product exploration explored 100000 steps with 1851 reset in 166 ms.
Product exploration explored 100000 steps with 1851 reset in 213 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 212 steps (0 resets) in 6 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 91 rows 74 cols
[2024-06-01 11:55:56] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 11:55:56] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-06-01 11:55:56] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-06-01 11:55:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:55:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-06-01 11:55:57] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-06-01 11:55:57] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 11:55:57] [INFO ] [Nat]Added 67 Read/Feed constraints in 37 ms returned sat
[2024-06-01 11:55:57] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 ms to minimize.
[2024-06-01 11:55:57] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 ms to minimize.
[2024-06-01 11:55:57] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 2 ms to minimize.
[2024-06-01 11:55:57] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-06-01 11:55:57] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:55:57] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 2 ms to minimize.
[2024-06-01 11:55:57] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:55:57] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 2 ms to minimize.
[2024-06-01 11:55:57] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:55:57] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:55:57] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 691 ms
[2024-06-01 11:55:57] [INFO ] Computed and/alt/rep : 90/212/90 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 11:55:58] [INFO ] Added : 87 causal constraints over 19 iterations in 318 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 91/91 transitions.
Applied a total of 0 rules in 5 ms. Remains 74 /74 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-06-01 11:55:58] [INFO ] Invariant cache hit.
[2024-06-01 11:55:58] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-06-01 11:55:58] [INFO ] Invariant cache hit.
[2024-06-01 11:55:58] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 11:55:58] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2024-06-01 11:55:58] [INFO ] Redundant transitions in 3 ms returned []
Running 90 sub problems to find dead transitions.
[2024-06-01 11:55:58] [INFO ] Invariant cache hit.
[2024-06-01 11:55:58] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 11:55:59] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 2 ms to minimize.
[2024-06-01 11:55:59] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
[2024-06-01 11:55:59] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2024-06-01 11:55:59] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-06-01 11:55:59] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:55:59] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:55:59] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:55:59] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:55:59] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
[2024-06-01 11:55:59] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
[2024-06-01 11:55:59] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:55:59] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 11:55:59] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD18 is UNSAT
[2024-06-01 11:55:59] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:55:59] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-06-01 11:56:00] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
[2024-06-01 11:56:00] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
[2024-06-01 11:56:00] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 2 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
[2024-06-01 11:56:00] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:56:00] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 20/33 constraints. Problems are: Problem set: 21 solved, 69 unsolved
[2024-06-01 11:56:00] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 2 ms to minimize.
[2024-06-01 11:56:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:56:00] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
[2024-06-01 11:56:00] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 2 ms to minimize.
[2024-06-01 11:56:00] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 2 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 11:56:00] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-06-01 11:56:00] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 7/40 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/40 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 91/165 variables, 74/114 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 67/181 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/181 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/165 variables, 0/181 constraints. Problems are: Problem set: 24 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 181 constraints, problems are : Problem set: 24 solved, 66 unsolved in 4546 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 74/74 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 24 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 10/10 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 11/21 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/21 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 8/74 variables, 3/24 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 16/40 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/40 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 91/165 variables, 74/114 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 67/181 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 66/247 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/247 constraints. Problems are: Problem set: 24 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/165 variables, 0/247 constraints. Problems are: Problem set: 24 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 247 constraints, problems are : Problem set: 24 solved, 66 unsolved in 2291 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 74/74 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 66/90 constraints, Known Traps: 27/27 constraints]
After SMT, in 6883ms problems are : Problem set: 24 solved, 66 unsolved
Search for dead transitions found 24 dead transitions in 6888ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 74/74 places, 67/91 transitions.
Graph (complete) has 209 edges and 74 vertex of which 66 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 66 /74 variables (removed 8) and now considering 67/67 (removed 0) transitions.
// Phase 1: matrix 67 rows 66 cols
[2024-06-01 11:56:05] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 11:56:05] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 11:56:05] [INFO ] Invariant cache hit.
[2024-06-01 11:56:05] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 11:56:05] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/74 places, 67/91 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7650 ms. Remains : 66/74 places, 67/91 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 212 steps (0 resets) in 7 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
[2024-06-01 11:56:06] [INFO ] Invariant cache hit.
[2024-06-01 11:56:06] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 11:56:06] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-01 11:56:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:56:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-06-01 11:56:06] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-06-01 11:56:06] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 11:56:06] [INFO ] [Nat]Added 47 Read/Feed constraints in 20 ms returned sat
[2024-06-01 11:56:06] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:56:06] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:56:06] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:56:06] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
[2024-06-01 11:56:07] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 2 ms to minimize.
[2024-06-01 11:56:07] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-06-01 11:56:07] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 2 ms to minimize.
[2024-06-01 11:56:07] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 2 ms to minimize.
[2024-06-01 11:56:07] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 2 ms to minimize.
[2024-06-01 11:56:07] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:56:07] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 588 ms
[2024-06-01 11:56:07] [INFO ] Computed and/alt/rep : 66/100/66 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 11:56:07] [INFO ] Added : 65 causal constraints over 13 iterations in 178 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1851 reset in 163 ms.
Product exploration explored 100000 steps with 1851 reset in 295 ms.
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 67/67 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2024-06-01 11:56:08] [INFO ] Invariant cache hit.
[2024-06-01 11:56:08] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-06-01 11:56:08] [INFO ] Invariant cache hit.
[2024-06-01 11:56:08] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 11:56:08] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
[2024-06-01 11:56:08] [INFO ] Redundant transitions in 2 ms returned []
Running 66 sub problems to find dead transitions.
[2024-06-01 11:56:08] [INFO ] Invariant cache hit.
[2024-06-01 11:56:08] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-01 11:56:08] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
[2024-06-01 11:56:08] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 2 ms to minimize.
[2024-06-01 11:56:08] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 2 ms to minimize.
[2024-06-01 11:56:09] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:56:09] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
[2024-06-01 11:56:09] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-06-01 11:56:09] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:56:09] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:56:09] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:56:09] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:56:09] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:56:09] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:56:09] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:56:09] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 2 ms to minimize.
[2024-06-01 11:56:09] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:56:09] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 2 ms to minimize.
[2024-06-01 11:56:09] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-06-01 11:56:09] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 2 ms to minimize.
[2024-06-01 11:56:09] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 2 ms to minimize.
[2024-06-01 11:56:09] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-01 11:56:10] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
[2024-06-01 11:56:10] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:56:10] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:56:10] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-06-01 11:56:10] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
[2024-06-01 11:56:10] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 67/133 variables, 66/105 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 47/152 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/133 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 152 constraints, problems are : Problem set: 0 solved, 66 unsolved in 4063 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 66/66 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 26/39 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 67/133 variables, 66/105 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 47/152 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 66/218 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-01 11:56:13] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/133 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 219 constraints, problems are : Problem set: 0 solved, 66 unsolved in 3019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 66/66 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 27/27 constraints]
After SMT, in 7101ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 7103ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7566 ms. Remains : 66/66 places, 67/67 transitions.
Treatment of property ParamProductionCell-PT-1-LTLCardinality-08 finished in 20359 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(((X(p0)||F(p1))&&(p0||F(p2))))))'
Support contains 6 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 196/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 188 transition count 162
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 154 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 153 transition count 161
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 70 place count 153 transition count 155
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 82 place count 147 transition count 155
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 145 transition count 153
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 145 transition count 153
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 160 place count 108 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 162 place count 107 transition count 115
Applied a total of 162 rules in 21 ms. Remains 107 /188 variables (removed 81) and now considering 115/196 (removed 81) transitions.
// Phase 1: matrix 115 rows 107 cols
[2024-06-01 11:56:15] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 11:56:15] [INFO ] Implicit Places using invariants in 122 ms returned [0, 3, 5, 8, 21, 35, 40, 45, 68]
[2024-06-01 11:56:15] [INFO ] Actually due to overlaps returned [45, 5, 21, 8, 35, 0]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 123 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/188 places, 115/196 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 101 transition count 113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 99 transition count 113
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 99 transition count 109
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 95 transition count 109
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 42 place count 80 transition count 94
Applied a total of 42 rules in 8 ms. Remains 80 /101 variables (removed 21) and now considering 94/115 (removed 21) transitions.
// Phase 1: matrix 94 rows 80 cols
[2024-06-01 11:56:15] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 11:56:15] [INFO ] Implicit Places using invariants in 80 ms returned [1, 30, 50]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 82 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/188 places, 94/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 237 ms. Remains : 77/188 places, 94/196 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLCardinality-10
Product exploration explored 100000 steps with 33254 reset in 144 ms.
Product exploration explored 100000 steps with 33217 reset in 203 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 129 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 330 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 338 ms. (117 steps per ms) remains 2/9 properties
BEST_FIRST walk for 548 steps (0 resets) in 17 ms. (30 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR p0 p1))), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0))), (F p1)]
Knowledge based reduction with 18 factoid took 586 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 347 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 317 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 77 cols
[2024-06-01 11:56:18] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 11:56:18] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-01 11:56:18] [INFO ] Invariant cache hit.
[2024-06-01 11:56:18] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 11:56:18] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2024-06-01 11:56:18] [INFO ] Redundant transitions in 2 ms returned []
Running 93 sub problems to find dead transitions.
[2024-06-01 11:56:18] [INFO ] Invariant cache hit.
[2024-06-01 11:56:18] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 2 ms to minimize.
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 20/33 constraints. Problems are: Problem set: 17 solved, 76 unsolved
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 2 ms to minimize.
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 2 ms to minimize.
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 2 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
[2024-06-01 11:56:21] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 2 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 11/44 constraints. Problems are: Problem set: 25 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/44 constraints. Problems are: Problem set: 25 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 94/171 variables, 77/121 constraints. Problems are: Problem set: 25 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 67/188 constraints. Problems are: Problem set: 25 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/188 constraints. Problems are: Problem set: 25 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/171 variables, 0/188 constraints. Problems are: Problem set: 25 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 188 constraints, problems are : Problem set: 25 solved, 68 unsolved in 4715 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 77/77 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 25 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 10/10 constraints. Problems are: Problem set: 25 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 9/19 constraints. Problems are: Problem set: 25 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/19 constraints. Problems are: Problem set: 25 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 9/77 variables, 3/22 constraints. Problems are: Problem set: 25 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 22/44 constraints. Problems are: Problem set: 25 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/44 constraints. Problems are: Problem set: 25 solved, 68 unsolved
At refinement iteration 6 (OVERLAPS) 94/171 variables, 77/121 constraints. Problems are: Problem set: 25 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 67/188 constraints. Problems are: Problem set: 25 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 68/256 constraints. Problems are: Problem set: 25 solved, 68 unsolved
[2024-06-01 11:56:24] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 1/257 constraints. Problems are: Problem set: 25 solved, 68 unsolved
[2024-06-01 11:56:26] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 4 ms to minimize.
[2024-06-01 11:56:26] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 2/259 constraints. Problems are: Problem set: 25 solved, 68 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 0/259 constraints. Problems are: Problem set: 25 solved, 68 unsolved
At refinement iteration 12 (OVERLAPS) 0/171 variables, 0/259 constraints. Problems are: Problem set: 25 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 259 constraints, problems are : Problem set: 25 solved, 68 unsolved in 6051 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 77/77 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 68/93 constraints, Known Traps: 34/34 constraints]
After SMT, in 10805ms problems are : Problem set: 25 solved, 68 unsolved
Search for dead transitions found 25 dead transitions in 10807ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 77/77 places, 69/94 transitions.
Graph (complete) has 213 edges and 77 vertex of which 69 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 10 ms. Remains 69 /77 variables (removed 8) and now considering 69/69 (removed 0) transitions.
// Phase 1: matrix 69 rows 69 cols
[2024-06-01 11:56:29] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 11:56:29] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-01 11:56:29] [INFO ] Invariant cache hit.
[2024-06-01 11:56:29] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 11:56:29] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/77 places, 69/94 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11438 ms. Remains : 69/77 places, 69/94 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 182 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 426 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 215 ms. (185 steps per ms) remains 2/9 properties
BEST_FIRST walk for 574 steps (0 resets) in 4 ms. (114 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) p2))), (F p1), (F (NOT p0))]
Knowledge based reduction with 19 factoid took 557 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 330 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 329 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 335 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 6785 reset in 211 ms.
Product exploration explored 100000 steps with 6803 reset in 369 ms.
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 69/69 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 68 transition count 68
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 68
Applied a total of 2 rules in 3 ms. Remains 67 /68 variables (removed 1) and now considering 68/69 (removed 1) transitions.
// Phase 1: matrix 68 rows 67 cols
[2024-06-01 11:56:32] [INFO ] Computed 13 invariants in 10 ms
[2024-06-01 11:56:32] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-01 11:56:32] [INFO ] Invariant cache hit.
[2024-06-01 11:56:32] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 11:56:33] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-06-01 11:56:33] [INFO ] Redundant transitions in 2 ms returned []
Running 67 sub problems to find dead transitions.
[2024-06-01 11:56:33] [INFO ] Invariant cache hit.
[2024-06-01 11:56:33] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-06-01 11:56:33] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 2 ms to minimize.
[2024-06-01 11:56:33] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
[2024-06-01 11:56:33] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 2 ms to minimize.
[2024-06-01 11:56:33] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:56:33] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
[2024-06-01 11:56:33] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 2 ms to minimize.
[2024-06-01 11:56:33] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:56:33] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:56:33] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 2 ms to minimize.
[2024-06-01 11:56:33] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 2 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 2 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 2 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 2 ms to minimize.
[2024-06-01 11:56:35] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 2 ms to minimize.
[2024-06-01 11:56:35] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:56:35] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:56:35] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:56:35] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
[2024-06-01 11:56:35] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 68/135 variables, 67/111 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 47/158 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 158 constraints, problems are : Problem set: 0 solved, 67 unsolved in 4188 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 67/67 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 68/135 variables, 67/111 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 47/158 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 67/225 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-06-01 11:56:38] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 226 constraints, problems are : Problem set: 0 solved, 67 unsolved in 3519 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 67/67 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 32/32 constraints]
After SMT, in 7720ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 7722ms
Starting structural reductions in SI_LTL mode, iteration 1 : 67/68 places, 68/69 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8079 ms. Remains : 67/68 places, 68/69 transitions.
Treatment of property ParamProductionCell-PT-1-LTLCardinality-10 finished in 25255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 5 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2024-06-01 11:56:40] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 11:56:41] [INFO ] Implicit Places using invariants in 274 ms returned [19, 36, 63, 82]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 276 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 182/188 places, 194/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 182 /182 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 284 ms. Remains : 182/188 places, 194/196 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 41 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-1-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-1-LTLCardinality-11 finished in 438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 5 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
[2024-06-01 11:56:41] [INFO ] Invariant cache hit.
[2024-06-01 11:56:41] [INFO ] Implicit Places using invariants in 268 ms returned [19, 36, 63, 82]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 269 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 182/188 places, 194/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 182 /182 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 277 ms. Remains : 182/188 places, 194/196 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 108 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-1-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-1-LTLCardinality-13 finished in 415 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||X(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' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((X(p0)||F(p1))&&(p0||F(p2))))))'
[2024-06-01 11:56:42] [INFO ] Flatten gal took : 23 ms
[2024-06-01 11:56:42] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 11:56:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 188 places, 196 transitions and 618 arcs took 10 ms.
Total runtime 76885 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ParamProductionCell-PT-1-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ParamProductionCell-PT-1-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ParamProductionCell-PT-1-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717243006328

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ParamProductionCell-PT-1-LTLCardinality-01
ltl formula formula --ltl=/tmp/1915/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 188 places, 196 transitions and 618 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1915/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1915/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1915/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1915/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 189 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 189, there are 253 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~202 levels ~10000 states ~31896 transitions
pnml2lts-mc( 2/ 4): ~202 levels ~20000 states ~69096 transitions
pnml2lts-mc( 0/ 4): ~193 levels ~40000 states ~156720 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 25718
pnml2lts-mc( 0/ 4): unique states count: 51349
pnml2lts-mc( 0/ 4): unique transitions count: 290089
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 193839
pnml2lts-mc( 0/ 4): - claim found count: 78236
pnml2lts-mc( 0/ 4): - claim success count: 63282
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2560
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 64927 states 365150 transitions, fanout: 5.624
pnml2lts-mc( 0/ 4): Total exploration time 0.950 sec (0.950 sec minimum, 0.950 sec on average)
pnml2lts-mc( 0/ 4): States per second: 68344, Transitions per second: 384368
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.5MB, 9.5 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 196 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.5MB (~256.0MB paged-in)
ltl formula name ParamProductionCell-PT-1-LTLCardinality-08
ltl formula formula --ltl=/tmp/1915/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 188 places, 196 transitions and 618 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1915/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1915/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1915/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1915/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 190 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 189, there are 205 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~286 levels ~10000 states ~29348 transitions
pnml2lts-mc( 1/ 4): ~271 levels ~20000 states ~70732 transitions
pnml2lts-mc( 3/ 4): ~894 levels ~40000 states ~191284 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 25632
pnml2lts-mc( 0/ 4): unique states count: 51263
pnml2lts-mc( 0/ 4): unique transitions count: 290161
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 189790
pnml2lts-mc( 0/ 4): - claim found count: 75860
pnml2lts-mc( 0/ 4): - claim success count: 61666
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2101
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 62745 states 348058 transitions, fanout: 5.547
pnml2lts-mc( 0/ 4): Total exploration time 0.720 sec (0.720 sec minimum, 0.720 sec on average)
pnml2lts-mc( 0/ 4): States per second: 87146, Transitions per second: 483414
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.5MB, 9.5 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 196 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.5MB (~256.0MB paged-in)
ltl formula name ParamProductionCell-PT-1-LTLCardinality-10
ltl formula formula --ltl=/tmp/1915/ltl_2_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 188 places, 196 transitions and 618 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1915/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1915/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1915/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1915/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 189 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 189, there are 585 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~342 levels ~10000 states ~30432 transitions
pnml2lts-mc( 1/ 4): ~352 levels ~20000 states ~60256 transitions
pnml2lts-mc( 1/ 4): ~352 levels ~40000 states ~136124 transitions
pnml2lts-mc( 1/ 4): ~352 levels ~80000 states ~364352 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 55924
pnml2lts-mc( 0/ 4): unique states count: 81555
pnml2lts-mc( 0/ 4): unique transitions count: 395966
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 285521
pnml2lts-mc( 0/ 4): - claim found count: 72743
pnml2lts-mc( 0/ 4): - claim success count: 93376
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3227
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 93981 states 482252 transitions, fanout: 5.131
pnml2lts-mc( 0/ 4): Total exploration time 1.080 sec (1.080 sec minimum, 1.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 87019, Transitions per second: 446530
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.7MB, 9.0 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 196 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.7MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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