Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812400356.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is ParamProductionCell-PT-0, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812400356
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 149K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748879459979

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-0
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 15:51:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 15:51:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 15:51:01] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2025-06-02 15:51:01] [INFO ] Transformed 198 places.
[2025-06-02 15:51:01] [INFO ] Transformed 176 transitions.
[2025-06-02 15:51:01] [INFO ] Found NUPN structural information;
[2025-06-02 15:51:01] [INFO ] Parsed PT model containing 198 places and 176 transitions and 730 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ParamProductionCell-PT-0-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 176/176 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 193 transition count 171
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 193 transition count 171
Applied a total of 10 rules in 39 ms. Remains 193 /198 variables (removed 5) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 193 cols
[2025-06-02 15:51:01] [INFO ] Computed 49 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:51:01] [INFO ] Implicit Places using invariants in 327 ms returned [15, 16, 19, 24, 31, 35, 36, 41, 42, 46, 59, 65, 79, 113, 118, 119, 160, 165, 166]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 358 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 174/198 places, 171/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 174 /174 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 436 ms. Remains : 174/198 places, 171/176 transitions.
Support contains 53 out of 174 places after structural reductions.
[2025-06-02 15:51:02] [INFO ] Flatten gal took : 33 ms
[2025-06-02 15:51:02] [INFO ] Flatten gal took : 15 ms
[2025-06-02 15:51:02] [INFO ] Input system was already deterministic with 171 transitions.
Reduction of identical properties reduced properties to check from 35 to 33
RANDOM walk for 40000 steps (8 resets) in 1726 ms. (23 steps per ms) remains 3/33 properties
BEST_FIRST walk for 40003 steps (8 resets) in 277 ms. (143 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 220 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 108 ms. (366 steps per ms) remains 2/2 properties
// Phase 1: matrix 171 rows 174 cols
[2025-06-02 15:51:02] [INFO ] Computed 30 invariants in 4 ms
[2025-06-02 15:51:02] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp11 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp25 is UNSAT
After SMT solving in domain Real declared 101/345 variables, and 6 constraints, problems are : Problem set: 2 solved, 0 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 6/24 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/174 constraints, ReadFeed: 0/59 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 92ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA ParamProductionCell-PT-0-LTLFireability-10 FALSE 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.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X((p0||G(p1)))))) U (!p2 U p3)))'
Support contains 8 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 171/171 transitions.
Applied a total of 0 rules in 7 ms. Remains 174 /174 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2025-06-02 15:51:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:51:03] [INFO ] Implicit Places using invariants in 126 ms returned [16, 37, 53, 61, 66, 85, 100, 102, 146]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 127 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 165/174 places, 171/171 transitions.
Applied a total of 0 rules in 5 ms. Remains 165 /165 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 165/174 places, 171/171 transitions.
Stuttering acceptance computed with spot in 669 ms :[(NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-00
Product exploration explored 100000 steps with 1404 reset in 274 ms.
Product exploration explored 100000 steps with 1404 reset in 200 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 p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p3) p2))), (X (AND (NOT p3) (NOT p2))), (X (NOT p3)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 723 ms. Reduced automaton from 13 states, 27 edges and 4 AP (stutter sensitive) to 13 states, 27 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 527 ms :[(NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND p0 (NOT p1) (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 249 ms. (160 steps per ms) remains 5/16 properties
BEST_FIRST walk for 40001 steps (8 resets) in 196 ms. (203 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 112 ms. (353 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 147 ms. (270 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
// Phase 1: matrix 171 rows 165 cols
[2025-06-02 15:51:06] [INFO ] Computed 21 invariants in 2 ms
[2025-06-02 15:51:06] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf5 is UNSAT
Problem apf9 is UNSAT
Problem apf11 is UNSAT
Problem apf13 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 124/336 variables, and 7 constraints, problems are : Problem set: 5 solved, 0 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 7/20 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/165 constraints, ReadFeed: 0/59 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p3) p2))), (X (AND (NOT p3) (NOT p2))), (X (NOT p3)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT p3))), (G (OR (NOT p1) p2 (NOT p0) p3)), (G (OR (NOT p1) (NOT p2) p0 p3)), (G (OR p1 p2 (NOT p0) p3)), (G (OR (NOT p1) (NOT p2) (NOT p0) p3)), (G (OR p1 (NOT p2) (NOT p0) p3))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F (NOT (OR (NOT p1) p2 p0 p3))), (F p0), (F p3), (F (NOT (OR p1 (NOT p2) p0 p3))), (F p2), (F (NOT (OR (NOT p2) p3))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 14 factoid took 469 ms. Reduced automaton from 13 states, 27 edges and 4 AP (stutter sensitive) to 12 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 506 ms :[(NOT p3), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3))), (NOT p3)]
Stuttering acceptance computed with spot in 448 ms :[(NOT p3), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3))), (NOT p3)]
[2025-06-02 15:51:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:51:08] [INFO ] [Real]Absence check using 20 positive place invariants in 28 ms returned sat
[2025-06-02 15:51:08] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 4 ms returned sat
[2025-06-02 15:51:08] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2025-06-02 15:51:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:51:08] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2025-06-02 15:51:08] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 15:51:08] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2025-06-02 15:51:08] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-02 15:51:08] [INFO ] [Nat]Added 59 Read/Feed constraints in 54 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:08] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:08] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:09] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:09] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:09] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:09] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:09] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 2 ms to minimize.
[2025-06-02 15:51:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 537 ms
[2025-06-02 15:51:09] [INFO ] Computed and/alt/rep : 163/302/163 causal constraints (skipped 7 transitions) in 10 ms.
[2025-06-02 15:51:09] [INFO ] Added : 139 causal constraints over 28 iterations in 595 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 8 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 171/171 transitions.
Applied a total of 0 rules in 3 ms. Remains 165 /165 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2025-06-02 15:51:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:51:10] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-02 15:51:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:51:10] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-02 15:51:10] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2025-06-02 15:51:10] [INFO ] Invariant cache hit.
[2025-06-02 15:51:10] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:11] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:11] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:11] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:11] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:11] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:11] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:11] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:11] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:11] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:11] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:11] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:11] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:12] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:12] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:12] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:12] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:12] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:12] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:12] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:12] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:12] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:12] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:13] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:13] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:13] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:13] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:13] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:13] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:13] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:13] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:13] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:14] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:14] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:15] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:16] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:16] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:16] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 2/165 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (OVERLAPS) 171/336 variables, 165/223 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/336 variables, 59/282 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 13 (OVERLAPS) 0/336 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 282 constraints, problems are : Problem set: 0 solved, 170 unsolved in 15791 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 165/165 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 37/56 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 2/165 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 171/336 variables, 165/223 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 59/282 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 170/452 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (OVERLAPS) 0/336 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 452 constraints, problems are : Problem set: 0 solved, 170 unsolved in 21702 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 165/165 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37522ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 37525ms
Finished structural reductions in LTL mode , in 1 iterations and 38102 ms. Remains : 165/165 places, 171/171 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 p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (NOT p3)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 155 ms. Reduced automaton from 12 states, 21 edges and 4 AP (stutter sensitive) to 12 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 463 ms :[(NOT p3), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3))), (NOT p3)]
RANDOM walk for 9323 steps (2 resets) in 53 ms. (172 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (NOT p3)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p3)))]
False Knowledge obtained : [(F p3), (F (NOT (OR (NOT p2) p3))), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F p2), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p1), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3))))]
Knowledge based reduction with 9 factoid took 419 ms. Reduced automaton from 12 states, 21 edges and 4 AP (stutter sensitive) to 12 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 465 ms :[(NOT p3), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3))), (NOT p3)]
Stuttering acceptance computed with spot in 453 ms :[(NOT p3), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3))), (NOT p3)]
[2025-06-02 15:51:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:51:50] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2025-06-02 15:51:50] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 7 ms returned sat
[2025-06-02 15:51:50] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2025-06-02 15:51:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:51:50] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2025-06-02 15:51:50] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 15:51:50] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2025-06-02 15:51:50] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-02 15:51:50] [INFO ] [Nat]Added 59 Read/Feed constraints in 52 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:50] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:50] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:51] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:51] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:51] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:51] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:51] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 2 ms to minimize.
[2025-06-02 15:51:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 468 ms
[2025-06-02 15:51:51] [INFO ] Computed and/alt/rep : 163/302/163 causal constraints (skipped 7 transitions) in 9 ms.
[2025-06-02 15:51:51] [INFO ] Added : 139 causal constraints over 28 iterations in 553 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 492 ms :[(NOT p3), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3))), (NOT p3)]
Product exploration explored 100000 steps with 1405 reset in 132 ms.
Product exploration explored 100000 steps with 1407 reset in 138 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, true, false, false, true, true]
Stuttering acceptance computed with spot in 452 ms :[(NOT p3), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3))), (NOT p3)]
Support contains 8 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 171/171 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 165 transition count 171
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 21 place count 165 transition count 171
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 30 place count 165 transition count 171
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 161 transition count 167
Deduced a syphon composed of 26 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 161 transition count 167
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 67 place count 161 transition count 167
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 84 place count 144 transition count 150
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 101 place count 144 transition count 150
Deduced a syphon composed of 38 places in 0 ms
Applied a total of 101 rules in 38 ms. Remains 144 /165 variables (removed 21) and now considering 150/171 (removed 21) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 15:51:53] [INFO ] Redundant transitions in 4 ms returned []
Running 149 sub problems to find dead transitions.
// Phase 1: matrix 150 rows 144 cols
[2025-06-02 15:51:53] [INFO ] Computed 21 invariants in 2 ms
[2025-06-02 15:51:53] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:53] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:53] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:53] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:54] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:54] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:54] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:54] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:54] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:54] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:54] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:54] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 8 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:54] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:54] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:54] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 6 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:54] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:54] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:54] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:54] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:54] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:54] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 4 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 20/39 constraints. Problems are: Problem set: 30 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:55] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:55] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:55] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:55] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 9 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:55] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:55] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:55] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:55] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:55] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:55] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:55] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:55] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 5 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:55] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:55] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:56] [INFO ] Deduced a trap composed of 1 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:56] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 3 ms to minimize.
Problem TDEAD107 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 16/55 constraints. Problems are: Problem set: 35 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:56] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/56 constraints. Problems are: Problem set: 35 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:57] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:57] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 2/58 constraints. Problems are: Problem set: 35 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/58 constraints. Problems are: Problem set: 35 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 2/144 variables, 2/60 constraints. Problems are: Problem set: 35 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:58] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:58] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:51:58] [INFO ] Deduced a trap composed of 1 places in 26 ms of which 2 ms to minimize.
Problem TDEAD108 is UNSAT
Problem TDEAD114 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 3/63 constraints. Problems are: Problem set: 38 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/63 constraints. Problems are: Problem set: 38 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 150/294 variables, 144/207 constraints. Problems are: Problem set: 38 solved, 111 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 59/266 constraints. Problems are: Problem set: 38 solved, 111 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/266 constraints. Problems are: Problem set: 38 solved, 111 unsolved
At refinement iteration 13 (OVERLAPS) 0/294 variables, 0/266 constraints. Problems are: Problem set: 38 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 266 constraints, problems are : Problem set: 38 solved, 111 unsolved in 10603 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 38 solved, 111 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 10/10 constraints. Problems are: Problem set: 38 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/11 constraints. Problems are: Problem set: 38 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 39/50 constraints. Problems are: Problem set: 38 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/50 constraints. Problems are: Problem set: 38 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 38/142 variables, 9/59 constraints. Problems are: Problem set: 38 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/60 constraints. Problems are: Problem set: 38 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/60 constraints. Problems are: Problem set: 38 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 149/291 variables, 142/202 constraints. Problems are: Problem set: 38 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 59/261 constraints. Problems are: Problem set: 38 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 110/371 constraints. Problems are: Problem set: 38 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/371 constraints. Problems are: Problem set: 38 solved, 111 unsolved
At refinement iteration 11 (OVERLAPS) 1/292 variables, 1/372 constraints. Problems are: Problem set: 38 solved, 111 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 2/374 constraints. Problems are: Problem set: 38 solved, 111 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/292 variables, 0/374 constraints. Problems are: Problem set: 38 solved, 111 unsolved
At refinement iteration 14 (OVERLAPS) 1/293 variables, 1/375 constraints. Problems are: Problem set: 38 solved, 111 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/293 variables, 0/375 constraints. Problems are: Problem set: 38 solved, 111 unsolved
At refinement iteration 16 (OVERLAPS) 1/294 variables, 2/377 constraints. Problems are: Problem set: 38 solved, 111 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/294 variables, 0/377 constraints. Problems are: Problem set: 38 solved, 111 unsolved
At refinement iteration 18 (OVERLAPS) 0/294 variables, 0/377 constraints. Problems are: Problem set: 38 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 377 constraints, problems are : Problem set: 38 solved, 111 unsolved in 26672 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 111/149 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37292ms problems are : Problem set: 38 solved, 111 unsolved
Search for dead transitions found 38 dead transitions in 37293ms
Found 38 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 38 transitions
Dead transitions reduction (with SMT) removed 38 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 144/165 places, 112/171 transitions.
Graph (complete) has 368 edges and 144 vertex of which 106 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Discarding 38 places :
Also discarding 0 output transitions
Reduce places removed 2 places and 0 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 104 transition count 112
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 104 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 104 transition count 112
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 5 rules in 11 ms. Remains 104 /144 variables (removed 40) and now considering 112/112 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 104/165 places, 112/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 37354 ms. Remains : 104/165 places, 112/171 transitions.
Built C files in :
/tmp/ltsmin10958545459640974412
[2025-06-02 15:52:30] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10958545459640974412
Running compilation step : cd /tmp/ltsmin10958545459640974412;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 388 ms.
Running link step : cd /tmp/ltsmin10958545459640974412;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin10958545459640974412;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3050939054206614817.hoa' '--buchi-type=spotba'
LTSmin run took 334 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-0-LTLFireability-00 finished in 87992 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||G(p1)) U X(p2)))'
Support contains 7 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 173 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 173 transition count 170
Applied a total of 2 rules in 8 ms. Remains 173 /174 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 173 cols
[2025-06-02 15:52:31] [INFO ] Computed 30 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:52:31] [INFO ] Implicit Places using invariants in 112 ms returned [16, 37, 61, 66, 85, 86, 88, 102, 143, 145]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 114 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/174 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 161 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 161 transition count 168
Applied a total of 4 rules in 4 ms. Remains 161 /163 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 161 cols
[2025-06-02 15:52:31] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:52:31] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-02 15:52:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:52:31] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-02 15:52:31] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 161/174 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 428 ms. Remains : 161/174 places, 168/171 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-01 finished in 654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((!p0&&X(G(p1))))) U ((X(X((!p0&&X(G(p1)))))&&G(p2))||X(X(G((!p0&&X(G(p1))))))))))'
Support contains 5 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 173 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 173 transition count 170
Applied a total of 2 rules in 11 ms. Remains 173 /174 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 173 cols
[2025-06-02 15:52:32] [INFO ] Computed 30 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:52:32] [INFO ] Implicit Places using invariants in 118 ms returned [37, 53, 61, 66, 85, 86, 88, 100, 102, 143, 145]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 132 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/174 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 160 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 160 transition count 168
Applied a total of 4 rules in 4 ms. Remains 160 /162 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 160 cols
[2025-06-02 15:52:32] [INFO ] Computed 19 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:52:32] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-06-02 15:52:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:52:32] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-02 15:52:32] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 160/174 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 584 ms. Remains : 160/174 places, 168/171 transitions.
Stuttering acceptance computed with spot in 497 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) (AND p0 (NOT p2)))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-02
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-02 finished in 1113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 173 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 173 transition count 170
Applied a total of 2 rules in 6 ms. Remains 173 /174 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 173 cols
[2025-06-02 15:52:33] [INFO ] Computed 30 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:52:33] [INFO ] Implicit Places using invariants in 129 ms returned [16, 37, 53, 61, 66, 85, 86, 88, 100, 102, 143, 145]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 130 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/174 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 159 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 159 transition count 168
Applied a total of 4 rules in 2 ms. Remains 159 /161 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 159 cols
[2025-06-02 15:52:33] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:52:33] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-02 15:52:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:52:33] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-02 15:52:33] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 159/174 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 474 ms. Remains : 159/174 places, 168/171 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-03 finished in 605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((X(G(p2))&&p1))))'
Support contains 6 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 173 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 173 transition count 170
Applied a total of 2 rules in 5 ms. Remains 173 /174 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 173 cols
[2025-06-02 15:52:33] [INFO ] Computed 30 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:52:33] [INFO ] Implicit Places using invariants in 120 ms returned [16, 37, 53, 66, 85, 86, 100, 102, 143, 145]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 126 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/174 places, 170/171 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 163/174 places, 170/171 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p2), (OR (AND (NOT p1) p2) (AND p1 (NOT p2))), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-04
Entered a terminal (fully accepting) state of product in 9 steps with 4 reset in 0 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-04 finished in 305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G((F(G(p1)) U p1))))'
Support contains 4 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 173 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 173 transition count 170
Applied a total of 2 rules in 5 ms. Remains 173 /174 variables (removed 1) and now considering 170/171 (removed 1) transitions.
[2025-06-02 15:52:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:52:34] [INFO ] Implicit Places using invariants in 117 ms returned [16, 37, 53, 61, 66, 85, 86, 88, 100, 102, 143, 145]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 128 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/174 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 159 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 159 transition count 168
Applied a total of 4 rules in 2 ms. Remains 159 /161 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 159 cols
[2025-06-02 15:52:34] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:52:34] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-02 15:52:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:52:34] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-02 15:52:34] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 159/174 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 520 ms. Remains : 159/174 places, 168/171 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Product exploration explored 100000 steps with 50000 reset in 112 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-0-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-0-LTLFireability-07 finished in 869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X(X(!p0))&&(F(!p1)||G(!p2))) U (G((X(X(!p0))&&(F(!p1)||G(!p2))))||(!p3&&X(X(!p0))&&(F(!p1)||G(!p2))))))))'
Support contains 9 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 173 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 173 transition count 170
Applied a total of 2 rules in 9 ms. Remains 173 /174 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 173 cols
[2025-06-02 15:52:35] [INFO ] Computed 30 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:52:35] [INFO ] Implicit Places using invariants in 107 ms returned [16, 37, 53, 61, 66, 85, 100, 143, 145]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 108 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/174 places, 170/171 transitions.
Applied a total of 0 rules in 1 ms. Remains 164 /164 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 118 ms. Remains : 164/174 places, 170/171 transitions.
Stuttering acceptance computed with spot in 531 ms :[(OR p0 (AND p1 p2)), (OR p0 (AND p1 p2)), p0, (AND p1 p2), (OR (AND p1 p2) (AND p0 p1)), p0, (AND p0 p1 p2), (AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-08
Product exploration explored 100000 steps with 24942 reset in 114 ms.
Product exploration explored 100000 steps with 24934 reset in 119 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 p3) (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p3 p1 (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p3 p1 (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 448 ms. Reduced automaton from 11 states, 41 edges and 4 AP (stutter sensitive) to 11 states, 41 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 485 ms :[(OR p0 (AND p1 p2)), (OR p0 (AND p1 p2)), p0, (AND p1 p2), (OR (AND p1 p2) (AND p0 p1)), p0, (AND p0 p1 p2), (AND p0 p1), p0, (AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (8 resets) in 173 ms. (229 steps per ms) remains 6/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
// Phase 1: matrix 170 rows 164 cols
[2025-06-02 15:52:37] [INFO ] Computed 21 invariants in 0 ms
[2025-06-02 15:52:37] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf6 is UNSAT
Problem apf7 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Real declared 112/334 variables, and 7 constraints, problems are : Problem set: 6 solved, 0 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 7/19 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/164 constraints, ReadFeed: 0/59 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p3 p1 (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p3 p1 (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (G (OR (NOT p1) (NOT p2) (NOT p0))), (G (OR (NOT p3) (NOT p0))), (G (OR (NOT p1) p2 (NOT p0))), (G (OR (NOT p1) p2 (NOT p3))), (G (OR (NOT p1) p2 (NOT p3) (NOT p0))), (G (OR (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F p2), (F (NOT (OR (NOT p1) p2))), (F p3), (F p0), (F p1)]
Knowledge based reduction with 24 factoid took 225 ms. Reduced automaton from 11 states, 41 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[p0, (AND p3 p0), p0, p0, p0]
Stuttering acceptance computed with spot in 179 ms :[p0, (AND p3 p0), p0, p0, p0]
Support contains 5 out of 164 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Applied a total of 0 rules in 4 ms. Remains 164 /164 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2025-06-02 15:52:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:52:37] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-02 15:52:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:52:38] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-02 15:52:38] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2025-06-02 15:52:38] [INFO ] Invariant cache hit.
[2025-06-02 15:52:38] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:39] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:39] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:39] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:39] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:39] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:39] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:39] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:39] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:39] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:39] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:39] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:39] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:39] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:39] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:39] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:39] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:39] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:39] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:39] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:40] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:40] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:40] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:40] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:40] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:40] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:40] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:40] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:40] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:40] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:41] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:41] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:41] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:42] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:43] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 2/164 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (OVERLAPS) 170/334 variables, 164/219 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/334 variables, 59/278 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/334 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 12 (OVERLAPS) 0/334 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 278 constraints, problems are : Problem set: 0 solved, 169 unsolved in 15486 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 164/164 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 34/53 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (OVERLAPS) 2/164 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:52:55] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 170/334 variables, 164/220 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 59/279 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 169/448 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/334 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 11 (OVERLAPS) 0/334 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 448 constraints, problems are : Problem set: 0 solved, 169 unsolved in 16676 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 164/164 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32180ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 32182ms
Finished structural reductions in LTL mode , in 1 iterations and 32732 ms. Remains : 164/164 places, 170/170 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 p3) (NOT p0)), (X (NOT p3)), (X (X (NOT p3))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[p0, (AND p3 p0), p0, p0, p0]
RANDOM walk for 17105 steps (5 resets) in 49 ms. (342 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p3) (NOT p0)), (X (NOT p3)), (X (X (NOT p3))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p3), (F p0)]
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[p0, (AND p3 p0), p0, p0, p0]
Stuttering acceptance computed with spot in 217 ms :[p0, (AND p3 p0), p0, p0, p0]
Stuttering acceptance computed with spot in 218 ms :[p0, (AND p3 p0), p0, p0, p0]
Product exploration explored 100000 steps with 25006 reset in 96 ms.
Product exploration explored 100000 steps with 25069 reset in 111 ms.
Applying partial POR strategy [false, false, false, true, false]
Stuttering acceptance computed with spot in 185 ms :[p0, (AND p3 p0), p0, p0, p0]
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 164 transition count 170
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 25 place count 164 transition count 170
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 35 place count 164 transition count 170
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 158 transition count 164
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 158 transition count 164
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 78 place count 158 transition count 164
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 97 place count 139 transition count 145
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 116 place count 139 transition count 145
Deduced a syphon composed of 41 places in 0 ms
Applied a total of 116 rules in 30 ms. Remains 139 /164 variables (removed 25) and now considering 145/170 (removed 25) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 15:53:12] [INFO ] Redundant transitions in 4 ms returned []
Running 144 sub problems to find dead transitions.
// Phase 1: matrix 145 rows 139 cols
[2025-06-02 15:53:12] [INFO ] Computed 21 invariants in 1 ms
[2025-06-02 15:53:12] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:12] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:12] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:12] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:13] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:13] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:13] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:13] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:13] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:13] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:13] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:13] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:13] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 4 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:13] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:13] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:13] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:13] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:13] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:13] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 7 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:13] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 7 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:13] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 20/39 constraints. Problems are: Problem set: 33 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:13] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:14] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:14] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 7 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:14] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:14] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:14] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:14] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:14] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 4 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:14] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:14] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:14] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:14] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:14] [INFO ] Deduced a trap composed of 1 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:14] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:14] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:14] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:14] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 3 ms to minimize.
Problem TDEAD96 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 18/57 constraints. Problems are: Problem set: 38 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/57 constraints. Problems are: Problem set: 38 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 2/139 variables, 2/59 constraints. Problems are: Problem set: 38 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:15] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:15] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:16] [INFO ] Deduced a trap composed of 1 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:16] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 4 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD103 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 4/63 constraints. Problems are: Problem set: 41 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:53:16] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 1/64 constraints. Problems are: Problem set: 41 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/64 constraints. Problems are: Problem set: 41 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 145/284 variables, 139/203 constraints. Problems are: Problem set: 41 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 59/262 constraints. Problems are: Problem set: 41 solved, 103 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 0/262 constraints. Problems are: Problem set: 41 solved, 103 unsolved
At refinement iteration 12 (OVERLAPS) 0/284 variables, 0/262 constraints. Problems are: Problem set: 41 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 262 constraints, problems are : Problem set: 41 solved, 103 unsolved in 9495 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 139/139 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 41 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 9/9 constraints. Problems are: Problem set: 41 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 2/11 constraints. Problems are: Problem set: 41 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 40/51 constraints. Problems are: Problem set: 41 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/51 constraints. Problems are: Problem set: 41 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 41/137 variables, 9/60 constraints. Problems are: Problem set: 41 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 1/61 constraints. Problems are: Problem set: 41 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/61 constraints. Problems are: Problem set: 41 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 144/281 variables, 137/198 constraints. Problems are: Problem set: 41 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 59/257 constraints. Problems are: Problem set: 41 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 102/359 constraints. Problems are: Problem set: 41 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 0/359 constraints. Problems are: Problem set: 41 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 1/282 variables, 1/360 constraints. Problems are: Problem set: 41 solved, 103 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 2/362 constraints. Problems are: Problem set: 41 solved, 103 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/282 variables, 0/362 constraints. Problems are: Problem set: 41 solved, 103 unsolved
At refinement iteration 14 (OVERLAPS) 1/283 variables, 1/363 constraints. Problems are: Problem set: 41 solved, 103 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 0/363 constraints. Problems are: Problem set: 41 solved, 103 unsolved
At refinement iteration 16 (OVERLAPS) 1/284 variables, 2/365 constraints. Problems are: Problem set: 41 solved, 103 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/365 constraints. Problems are: Problem set: 41 solved, 103 unsolved
At refinement iteration 18 (OVERLAPS) 0/284 variables, 0/365 constraints. Problems are: Problem set: 41 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 365 constraints, problems are : Problem set: 41 solved, 103 unsolved in 21855 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 139/139 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 103/144 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31368ms problems are : Problem set: 41 solved, 103 unsolved
Search for dead transitions found 41 dead transitions in 31370ms
Found 41 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 41 transitions
Dead transitions reduction (with SMT) removed 41 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 139/164 places, 104/170 transitions.
Graph (complete) has 363 edges and 139 vertex of which 98 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.3 ms
Discarding 41 places :
Also discarding 0 output transitions
Reduce places removed 2 places and 0 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 96 transition count 104
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 96 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 96 transition count 104
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 5 rules in 12 ms. Remains 96 /139 variables (removed 43) and now considering 104/104 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 96/164 places, 104/170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31429 ms. Remains : 96/164 places, 104/170 transitions.
Built C files in :
/tmp/ltsmin1408877163586164264
[2025-06-02 15:53:43] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1408877163586164264
Running compilation step : cd /tmp/ltsmin1408877163586164264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 264 ms.
Running link step : cd /tmp/ltsmin1408877163586164264;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1408877163586164264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased754957918613288256.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Applied a total of 0 rules in 2 ms. Remains 164 /164 variables (removed 0) and now considering 170/170 (removed 0) transitions.
// Phase 1: matrix 170 rows 164 cols
[2025-06-02 15:53:58] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:53:58] [INFO ] Implicit Places using invariants in 88 ms returned [95]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/164 places, 170/170 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 163/164 places, 170/170 transitions.
Built C files in :
/tmp/ltsmin12242083952845616463
[2025-06-02 15:53:58] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12242083952845616463
Running compilation step : cd /tmp/ltsmin12242083952845616463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 271 ms.
Running link step : cd /tmp/ltsmin12242083952845616463;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12242083952845616463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1420452109836150167.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 15:54:14] [INFO ] Flatten gal took : 17 ms
[2025-06-02 15:54:14] [INFO ] Flatten gal took : 8 ms
[2025-06-02 15:54:14] [INFO ] Time to serialize gal into /tmp/LTL6313975219822754044.gal : 5 ms
[2025-06-02 15:54:14] [INFO ] Time to serialize properties into /tmp/LTL1282865561724303302.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6313975219822754044.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9898267975735324519.hoa' '-atoms' '/tmp/LTL1282865561724303302.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1282865561724303302.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9898267975735324519.hoa
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t62, t65, t71, t72, t73, t75, t77, t79,...411
8 unique states visited
0 strongly connected components in search stack
8 transitions explored
4 items max in DFS search stack
184 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.88828,82672,1,0,431,305540,374,174,5039,227998,684
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ParamProductionCell-PT-0-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ParamProductionCell-PT-0-LTLFireability-08 finished in 101321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)&&X(p1)))&&X(X(p2))&&F(p3)))'
Support contains 9 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 173 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 173 transition count 170
Applied a total of 2 rules in 6 ms. Remains 173 /174 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 173 cols
[2025-06-02 15:54:16] [INFO ] Computed 30 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:16] [INFO ] Implicit Places using invariants in 122 ms returned [16, 53, 61, 66, 85, 88, 143, 145]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 123 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 165/174 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 163 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 163 transition count 168
Applied a total of 4 rules in 3 ms. Remains 163 /165 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 163 cols
[2025-06-02 15:54:16] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:16] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-02 15:54:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:16] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-02 15:54:17] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 163/174 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 728 ms. Remains : 163/174 places, 168/171 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (NOT p2), (NOT p3), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-09
Product exploration explored 100000 steps with 40005 reset in 110 ms.
Product exploration explored 100000 steps with 39981 reset in 114 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 p3 p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p3), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X p0)), (X (X p3)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 17 ms. Reduced automaton from 7 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-0-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-0-LTLFireability-09 finished in 1292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 171/171 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 174 transition count 163
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 166 transition count 163
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 16 place count 166 transition count 147
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 48 place count 150 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 149 transition count 146
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 149 transition count 146
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 102 place count 122 transition count 121
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 102 place count 122 transition count 120
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 105 place count 120 transition count 120
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 107 place count 119 transition count 119
Applied a total of 107 rules in 21 ms. Remains 119 /174 variables (removed 55) and now considering 119/171 (removed 52) transitions.
// Phase 1: matrix 119 rows 119 cols
[2025-06-02 15:54:17] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:17] [INFO ] Implicit Places using invariants in 96 ms returned [0, 9, 21, 31, 36, 39, 50, 51, 65, 67, 98, 100]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 97 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/174 places, 119/171 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 107 transition count 117
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 105 transition count 117
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 56 place count 79 transition count 91
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 58 place count 78 transition count 90
Applied a total of 58 rules in 8 ms. Remains 78 /107 variables (removed 29) and now considering 90/119 (removed 29) transitions.
// Phase 1: matrix 90 rows 78 cols
[2025-06-02 15:54:17] [INFO ] Computed 15 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:17] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-02 15:54:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:17] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-02 15:54:17] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/174 places, 90/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 292 ms. Remains : 78/174 places, 90/171 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-11
Product exploration explored 100000 steps with 116 reset in 115 ms.
Stack based approach found an accepted trace after 100 steps with 0 reset with depth 101 and stack size 101 in 0 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-11 finished in 514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p1)&&F(p2)&&p0))))'
Support contains 5 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 173 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 173 transition count 170
Applied a total of 2 rules in 3 ms. Remains 173 /174 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 173 cols
[2025-06-02 15:54:18] [INFO ] Computed 30 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:18] [INFO ] Implicit Places using invariants in 121 ms returned [16, 37, 53, 61, 66, 85, 86, 88, 102, 143, 145]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 121 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/174 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 160 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 160 transition count 168
Applied a total of 4 rules in 2 ms. Remains 160 /162 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 160 cols
[2025-06-02 15:54:18] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:18] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-02 15:54:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:18] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-02 15:54:18] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 160/174 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 588 ms. Remains : 160/174 places, 168/171 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-12 finished in 824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(!p1 U (G(!p1)||(!p1&&(F(p0)||(!p2&&X(p1))))))))'
Support contains 7 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 171/171 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 174 transition count 164
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 167 transition count 164
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 14 place count 167 transition count 147
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 48 place count 150 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 149 transition count 146
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 149 transition count 146
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 100 place count 123 transition count 122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 100 place count 123 transition count 121
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 103 place count 121 transition count 121
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 105 place count 120 transition count 120
Applied a total of 105 rules in 21 ms. Remains 120 /174 variables (removed 54) and now considering 120/171 (removed 51) transitions.
// Phase 1: matrix 120 rows 120 cols
[2025-06-02 15:54:19] [INFO ] Computed 27 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:19] [INFO ] Implicit Places using invariants in 95 ms returned [0, 10, 22, 32, 37, 40, 52, 54, 66, 99, 101]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 96 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/174 places, 120/171 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 118
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 107 transition count 118
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 60 place count 79 transition count 90
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 62 place count 78 transition count 89
Applied a total of 62 rules in 6 ms. Remains 78 /109 variables (removed 31) and now considering 89/120 (removed 31) transitions.
// Phase 1: matrix 89 rows 78 cols
[2025-06-02 15:54:19] [INFO ] Computed 16 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:19] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-02 15:54:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:19] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-02 15:54:19] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/174 places, 89/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 306 ms. Remains : 78/174 places, 89/171 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p0), (AND (NOT p0) p1), (NOT p0), false, (AND (NOT p0) p1)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-14
Product exploration explored 100000 steps with 4343 reset in 108 ms.
Product exploration explored 100000 steps with 4348 reset in 110 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) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 140 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter insensitive) to 10 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 426 ms :[(NOT p0), false, false, (AND (NOT p0) p1), false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (8 resets) in 239 ms. (166 steps per ms) remains 2/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
[2025-06-02 15:54:20] [INFO ] Invariant cache hit.
[2025-06-02 15:54:20] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf9 is UNSAT
After SMT solving in domain Real declared 60/167 variables, and 7 constraints, problems are : Problem set: 2 solved, 0 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 7/14 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/78 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1))), (G (OR (NOT p1) p2 (NOT p0))), (G (OR (NOT p1) (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) (NOT p0)))), (F p0), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F p2), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR p1 p2 (NOT p0))))]
Knowledge based reduction with 15 factoid took 529 ms. Reduced automaton from 10 states, 26 edges and 3 AP (stutter insensitive) to 12 states, 32 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 560 ms :[(NOT p0), false, false, (AND (NOT p0) p1), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 569 ms :[(NOT p0), false, false, (AND (NOT p0) p1), false, false, false, false, false, false, false, false]
Support contains 7 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 89/89 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2025-06-02 15:54:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:22] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-02 15:54:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:22] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-02 15:54:22] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 15:54:22] [INFO ] Redundant transitions in 1 ms returned []
Running 88 sub problems to find dead transitions.
[2025-06-02 15:54:22] [INFO ] Invariant cache hit.
[2025-06-02 15:54:22] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:22] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:22] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:22] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:22] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:22] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:22] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:22] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:22] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:23] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:23] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:23] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:23] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:23] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:23] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:23] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:23] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:23] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:23] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:23] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:23] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:23] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:23] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:23] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:23] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:23] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:23] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:24] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:24] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:24] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:24] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 89/167 variables, 78/125 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 58/183 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:25] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 184 constraints, problems are : Problem set: 0 solved, 88 unsolved in 4870 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:27] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 89/167 variables, 78/127 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 58/185 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 88/273 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:54:28] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/167 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 274 constraints, problems are : Problem set: 0 solved, 88 unsolved in 4616 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9496ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 9499ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9706 ms. Remains : 78/78 places, 89/89 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) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 137 ms. Reduced automaton from 12 states, 32 edges and 3 AP (stutter insensitive) to 12 states, 32 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 519 ms :[(NOT p0), false, false, (AND (NOT p0) p1), false, false, false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (8 resets) in 92 ms. (430 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
[2025-06-02 15:54:32] [INFO ] Invariant cache hit.
[2025-06-02 15:54:32] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf6 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Real declared 60/167 variables, and 7 constraints, problems are : Problem set: 2 solved, 0 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 7/14 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/78 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR (NOT p0) (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 (NOT p2) p1))), (F p2), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F p1)]
Knowledge based reduction with 25 factoid took 503 ms. Reduced automaton from 12 states, 32 edges and 3 AP (stutter insensitive) to 12 states, 32 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 544 ms :[(NOT p0), false, false, (AND (NOT p0) p1), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 540 ms :[(NOT p0), false, false, (AND (NOT p0) p1), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 558 ms :[(NOT p0), false, false, (AND (NOT p0) p1), false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 4347 reset in 106 ms.
Product exploration explored 100000 steps with 4350 reset in 108 ms.
Built C files in :
/tmp/ltsmin4130487155078917883
[2025-06-02 15:54:34] [INFO ] Computing symmetric may disable matrix : 89 transitions.
[2025-06-02 15:54:34] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 15:54:34] [INFO ] Computing symmetric may enable matrix : 89 transitions.
[2025-06-02 15:54:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 15:54:35] [INFO ] Computing Do-Not-Accords matrix : 89 transitions.
[2025-06-02 15:54:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 15:54:35] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4130487155078917883
Running compilation step : cd /tmp/ltsmin4130487155078917883;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 201 ms.
Running link step : cd /tmp/ltsmin4130487155078917883;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4130487155078917883;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8051876403250769026.hoa' '--buchi-type=spotba'
LTSmin run took 89 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-0-LTLFireability-14 finished in 16370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (F(G(!p1))||G((X(p3)&&p2)))))'
Support contains 7 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 173 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 173 transition count 170
Applied a total of 2 rules in 4 ms. Remains 173 /174 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 173 cols
[2025-06-02 15:54:35] [INFO ] Computed 30 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:35] [INFO ] Implicit Places using invariants in 119 ms returned [16, 37, 53, 61, 85, 86, 88, 100, 102, 143]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 120 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/174 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 161 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 161 transition count 168
Applied a total of 4 rules in 2 ms. Remains 161 /163 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 161 cols
[2025-06-02 15:54:35] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:35] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-02 15:54:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:54:35] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-02 15:54:35] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 161/174 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 594 ms. Remains : 161/174 places, 168/171 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND (NOT p0) p1), (OR (AND (NOT p0) p1 (NOT p2)) (AND p1 (NOT p3))), p1, (OR (AND p0 p1 (NOT p2)) (AND p0 p1 (NOT p3)))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 100 ms.
Stack based approach found an accepted trace after 1754 steps with 0 reset with depth 1755 and stack size 1104 in 3 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-15 finished in 941 ms.
All properties solved by simple procedures.
Total runtime 215129 ms.

BK_STOP 1748879676329

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-0"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is ParamProductionCell-PT-0, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-tall-174876812400356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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