Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812400372.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-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812400372
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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 4.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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 174K 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-2-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748879912930

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-2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 15:58:34] [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:58:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 15:58:34] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2025-06-02 15:58:34] [INFO ] Transformed 231 places.
[2025-06-02 15:58:34] [INFO ] Transformed 202 transitions.
[2025-06-02 15:58:34] [INFO ] Found NUPN structural information;
[2025-06-02 15:58:34] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 163 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 4 formulas.
FORMULA ParamProductionCell-PT-2-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-2-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-2-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-2-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 226 transition count 197
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 226 transition count 197
Applied a total of 10 rules in 46 ms. Remains 226 /231 variables (removed 5) and now considering 197/202 (removed 5) transitions.
// Phase 1: matrix 197 rows 226 cols
[2025-06-02 15:58:34] [INFO ] Computed 59 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:58:34] [INFO ] Implicit Places using invariants in 388 ms returned [15, 16, 18, 19, 24, 31, 35, 41, 46, 47, 59, 64, 65, 78, 79, 98, 113, 118, 119, 163, 165, 166, 192, 195, 196, 201]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 421 ms to find 26 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/231 places, 197/202 transitions.
Applied a total of 0 rules in 8 ms. Remains 200 /200 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 489 ms. Remains : 200/231 places, 197/202 transitions.
Support contains 46 out of 200 places after structural reductions.
[2025-06-02 15:58:35] [INFO ] Flatten gal took : 44 ms
[2025-06-02 15:58:35] [INFO ] Flatten gal took : 16 ms
[2025-06-02 15:58:35] [INFO ] Input system was already deterministic with 197 transitions.
RANDOM walk for 40000 steps (8 resets) in 1297 ms. (30 steps per ms) remains 2/27 properties
BEST_FIRST walk for 27128 steps (5 resets) in 232 ms. (116 steps per ms) remains 0/2 properties
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((p0||(F(p0) U (X(X(p1))&&F(p2))))))'
Support contains 6 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 199 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 199 transition count 196
Applied a total of 2 rules in 10 ms. Remains 199 /200 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 199 cols
[2025-06-02 15:58:36] [INFO ] Computed 33 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:58:36] [INFO ] Implicit Places using invariants in 212 ms returned [29, 34, 60, 83, 99, 140, 141, 168, 175, 179, 190]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 215 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/200 places, 196/197 transitions.
Applied a total of 0 rules in 12 ms. Remains 188 /188 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 237 ms. Remains : 188/200 places, 196/197 transitions.
Stuttering acceptance computed with spot in 491 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-00
Product exploration explored 100000 steps with 531 reset in 234 ms.
Product exploration explored 100000 steps with 529 reset in 198 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 p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 117 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 1812 steps (0 resets) in 20 ms. (86 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 6 factoid took 245 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 350 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
// Phase 1: matrix 196 rows 188 cols
[2025-06-02 15:58:38] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:58:38] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2025-06-02 15:58:38] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 8 ms returned sat
[2025-06-02 15:58:39] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2025-06-02 15:58:39] [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:58:39] [INFO ] [Nat]Absence check using 19 positive place invariants in 21 ms returned sat
[2025-06-02 15:58:39] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-02 15:58:39] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2025-06-02 15:58:39] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 15:58:40] [INFO ] [Nat]Added 68 Read/Feed constraints in 35 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:40] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:40] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:40] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:40] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:40] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:40] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:40] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:40] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:40] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:41] [INFO ] Deduced a trap composed of 24 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:58:41] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 2 ms to minimize.
[2025-06-02 15:58:41] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1089 ms
[2025-06-02 15:58:41] [INFO ] Computed and/alt/rep : 187/325/187 causal constraints (skipped 7 transitions) in 13 ms.
[2025-06-02 15:58:42] [INFO ] Added : 170 causal constraints over 34 iterations in 954 ms. Result :sat
Could not prove EG (NOT p1)
[2025-06-02 15:58:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:58:42] [INFO ] [Real]Absence check using 19 positive place invariants in 20 ms returned sat
[2025-06-02 15:58:42] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 16 ms returned sat
[2025-06-02 15:58:43] [INFO ] [Real]Absence check using state equation in 897 ms returned sat
[2025-06-02 15:58:43] [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:58:43] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2025-06-02 15:58:43] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 5 ms returned sat
[2025-06-02 15:58:43] [INFO ] [Nat]Absence check using state equation in 493 ms returned sat
[2025-06-02 15:58:43] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 15:58:43] [INFO ] [Nat]Added 68 Read/Feed constraints in 45 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:43] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:43] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:44] [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:58:44] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:44] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:44] [INFO ] Deduced a trap composed of 24 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:58:44] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 4 ms to minimize.
[2025-06-02 15:58:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 725 ms
[2025-06-02 15:58:44] [INFO ] Computed and/alt/rep : 187/325/187 causal constraints (skipped 7 transitions) in 10 ms.
[2025-06-02 15:58:45] [INFO ] Added : 179 causal constraints over 36 iterations in 1293 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 188 /188 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2025-06-02 15:58:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:58:45] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-02 15:58:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:58:45] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 15:58:46] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2025-06-02 15:58:46] [INFO ] Invariant cache hit.
[2025-06-02 15:58:46] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:47] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:47] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:47] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:47] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:47] [INFO ] Deduced a trap composed of 24 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:58:47] [INFO ] Deduced a trap composed of 17 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:58:47] [INFO ] Deduced a trap composed of 17 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:58:47] [INFO ] Deduced a trap composed of 6 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:58:48] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:48] [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:58:48] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:48] [INFO ] Deduced a trap composed of 26 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:58:48] [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:58:48] [INFO ] Deduced a trap composed of 26 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:58:48] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:48] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:48] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:48] [INFO ] Deduced a trap composed of 25 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:58:48] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:49] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:49] [INFO ] Deduced a trap composed of 25 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:58:49] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:51] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:51] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:52] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 3/188 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:54] [INFO ] Deduced a trap composed of 9 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:58:54] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:55] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:55] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:55] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:55] [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:58:55] [INFO ] Deduced a trap composed of 20 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:58:55] [INFO ] Deduced a trap composed of 37 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:58:55] [INFO ] Deduced a trap composed of 36 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:58:55] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:56] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:56] [INFO ] Deduced a trap composed of 19 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:58:56] [INFO ] Deduced a trap composed of 36 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:58:56] [INFO ] Deduced a trap composed of 12 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:58:56] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 15/62 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:58:58] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (OVERLAPS) 196/384 variables, 188/251 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 68/319 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 15 (OVERLAPS) 0/384 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 319 constraints, problems are : Problem set: 0 solved, 194 unsolved in 24514 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 188/188 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 36/53 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 3/188 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:12] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 196/384 variables, 188/252 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 68/320 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/384 variables, 194/514 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/384 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (OVERLAPS) 0/384 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 514 constraints, problems are : Problem set: 0 solved, 194 unsolved in 25445 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 188/188 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50044ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 50050ms
Finished structural reductions in LTL mode , in 1 iterations and 50869 ms. Remains : 188/188 places, 196/196 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 p2) (NOT p1) (NOT p0)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 1152 steps (0 resets) in 10 ms. (104 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 2 factoid took 229 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2025-06-02 15:59:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:59:38] [INFO ] [Real]Absence check using 19 positive place invariants in 26 ms returned sat
[2025-06-02 15:59:38] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 34 ms returned sat
[2025-06-02 15:59:38] [INFO ] [Real]Absence check using state equation in 606 ms returned sat
[2025-06-02 15:59:38] [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:59:38] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2025-06-02 15:59:38] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 5 ms returned sat
[2025-06-02 15:59:39] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2025-06-02 15:59:39] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 15:59:39] [INFO ] [Nat]Added 68 Read/Feed constraints in 37 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:39] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:39] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:39] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:39] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:39] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:39] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:39] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:40] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:40] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:40] [INFO ] Deduced a trap composed of 24 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:59:40] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 2 ms to minimize.
[2025-06-02 15:59:40] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1002 ms
[2025-06-02 15:59:40] [INFO ] Computed and/alt/rep : 187/325/187 causal constraints (skipped 7 transitions) in 11 ms.
[2025-06-02 15:59:41] [INFO ] Added : 155 causal constraints over 31 iterations in 1042 ms. Result :sat
Could not prove EG (NOT p1)
[2025-06-02 15:59:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 15:59:41] [INFO ] [Real]Absence check using 19 positive place invariants in 21 ms returned sat
[2025-06-02 15:59:41] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 16 ms returned sat
[2025-06-02 15:59:42] [INFO ] [Real]Absence check using state equation in 934 ms returned sat
[2025-06-02 15:59:42] [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:59:42] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2025-06-02 15:59:42] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 4 ms returned sat
[2025-06-02 15:59:43] [INFO ] [Nat]Absence check using state equation in 511 ms returned sat
[2025-06-02 15:59:43] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 15:59:43] [INFO ] [Nat]Added 68 Read/Feed constraints in 46 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:43] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:43] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:43] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:43] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:43] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:43] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:43] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 3 ms to minimize.
[2025-06-02 15:59:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 702 ms
[2025-06-02 15:59:43] [INFO ] Computed and/alt/rep : 187/325/187 causal constraints (skipped 7 transitions) in 9 ms.
[2025-06-02 15:59:45] [INFO ] Added : 179 causal constraints over 36 iterations in 1233 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 528 reset in 105 ms.
Product exploration explored 100000 steps with 530 reset in 112 ms.
Applying partial POR strategy [false, false, false, true, false, true, false, true, true]
Stuttering acceptance computed with spot in 386 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 6 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 196/196 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 188 transition count 196
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 31 place count 188 transition count 196
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 42 place count 188 transition count 196
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 182 transition count 190
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 182 transition count 190
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 90 place count 182 transition count 190
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 114 place count 158 transition count 166
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 138 place count 158 transition count 166
Deduced a syphon composed of 48 places in 1 ms
Applied a total of 138 rules in 48 ms. Remains 158 /188 variables (removed 30) and now considering 166/196 (removed 30) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 15:59:46] [INFO ] Redundant transitions in 4 ms returned []
Running 164 sub problems to find dead transitions.
// Phase 1: matrix 166 rows 158 cols
[2025-06-02 15:59:46] [INFO ] Computed 22 invariants in 1 ms
[2025-06-02 15:59:46] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:46] [INFO ] Deduced a trap composed of 6 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:59:46] [INFO ] Deduced a trap composed of 14 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:59:47] [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:59:47] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:47] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:47] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:47] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:47] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 9 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:47] [INFO ] Deduced a trap composed of 30 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:59:47] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 7 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:47] [INFO ] Deduced a trap composed of 18 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:59:47] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 4 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:59:47] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 4 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:47] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 3 ms to minimize.
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:47] [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:59:47] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 2 ms to minimize.
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:47] [INFO ] Deduced a trap composed of 4 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:59:47] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 3 ms to minimize.
Problem TDEAD72 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:47] [INFO ] Deduced a trap composed of 24 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:59:48] [INFO ] Deduced a trap composed of 21 places in 38 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 TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/39 constraints. Problems are: Problem set: 34 solved, 130 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:48] [INFO ] Deduced a trap composed of 21 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:59:48] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 7 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:48] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:48] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:48] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 3 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:48] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:48] [INFO ] Deduced a trap composed of 4 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:59:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:48] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:48] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 10/49 constraints. Problems are: Problem set: 38 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:49] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:49] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 2/51 constraints. Problems are: Problem set: 38 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:50] [INFO ] Deduced a trap composed of 20 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:59:50] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 2/53 constraints. Problems are: Problem set: 38 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/53 constraints. Problems are: Problem set: 38 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 3/158 variables, 3/56 constraints. Problems are: Problem set: 38 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:51] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:51] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:51] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:51] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:51] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 8 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:52] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 3 ms to minimize.
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:52] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 2 ms to minimize.
Problem TDEAD131 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:59:52] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 8/64 constraints. Problems are: Problem set: 48 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/64 constraints. Problems are: Problem set: 48 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 166/324 variables, 158/222 constraints. Problems are: Problem set: 48 solved, 116 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/324 variables, 68/290 constraints. Problems are: Problem set: 48 solved, 116 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/324 variables, 0/290 constraints. Problems are: Problem set: 48 solved, 116 unsolved
At refinement iteration 13 (OVERLAPS) 0/324 variables, 0/290 constraints. Problems are: Problem set: 48 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 290 constraints, problems are : Problem set: 48 solved, 116 unsolved in 11305 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 158/158 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 48 solved, 116 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 11/11 constraints. Problems are: Problem set: 48 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/12 constraints. Problems are: Problem set: 48 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 34/46 constraints. Problems are: Problem set: 48 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/46 constraints. Problems are: Problem set: 48 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 52/158 variables, 8/54 constraints. Problems are: Problem set: 48 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 2/56 constraints. Problems are: Problem set: 48 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 8/64 constraints. Problems are: Problem set: 48 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/64 constraints. Problems are: Problem set: 48 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 166/324 variables, 158/222 constraints. Problems are: Problem set: 48 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 68/290 constraints. Problems are: Problem set: 48 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 116/406 constraints. Problems are: Problem set: 48 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:00] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:00] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/324 variables, 2/408 constraints. Problems are: Problem set: 48 solved, 116 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/324 variables, 0/408 constraints. Problems are: Problem set: 48 solved, 116 unsolved
At refinement iteration 13 (OVERLAPS) 0/324 variables, 0/408 constraints. Problems are: Problem set: 48 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 408 constraints, problems are : Problem set: 48 solved, 116 unsolved in 17073 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 158/158 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 116/164 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28398ms problems are : Problem set: 48 solved, 116 unsolved
Search for dead transitions found 48 dead transitions in 28399ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 158/188 places, 118/196 transitions.
Graph (complete) has 375 edges and 158 vertex of which 110 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.2 ms
Discarding 48 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 110 transition count 118
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 110 transition count 118
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 7 ms. Remains 110 /158 variables (removed 48) and now considering 118/118 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/188 places, 118/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 28474 ms. Remains : 110/188 places, 118/196 transitions.
Built C files in :
/tmp/ltsmin8529687346697005925
[2025-06-02 16:00:14] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8529687346697005925
Running compilation step : cd /tmp/ltsmin8529687346697005925;'/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 384 ms.
Running link step : cd /tmp/ltsmin8529687346697005925;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin8529687346697005925;'/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/stateBased11909159188663069257.hoa' '--buchi-type=spotba'
LTSmin run took 5951 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-2-LTLFireability-00 finished in 105064 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((F(p0)||(X(!p1) U ((X(!p1)&&(!p0||G(!p1)))||X(G(!p1)))))))'
Support contains 4 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 199 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 199 transition count 196
Applied a total of 2 rules in 9 ms. Remains 199 /200 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 199 cols
[2025-06-02 16:00:21] [INFO ] Computed 33 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:21] [INFO ] Implicit Places using invariants in 175 ms returned [29, 34, 60, 83, 85, 97, 99, 140, 168, 175, 179]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 177 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/200 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 5 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2025-06-02 16:00:21] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:21] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-02 16:00:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:21] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:00:21] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/200 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 854 ms. Remains : 186/200 places, 194/197 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 103 ms.
Product exploration explored 100000 steps with 33333 reset in 106 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 12 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-2-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-2-LTLFireability-01 finished in 1231 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(G((!p0 U !p1))))'
Support contains 5 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 197/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 200 transition count 180
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 183 transition count 180
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 34 place count 183 transition count 166
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 62 place count 169 transition count 166
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 168 transition count 165
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 168 transition count 165
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 136 transition count 133
Applied a total of 128 rules in 19 ms. Remains 136 /200 variables (removed 64) and now considering 133/197 (removed 64) transitions.
// Phase 1: matrix 133 rows 136 cols
[2025-06-02 16:00:22] [INFO ] Computed 33 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:22] [INFO ] Implicit Places using invariants in 92 ms returned [19, 22, 46, 59, 61, 92, 93, 114, 119, 121, 129]
[2025-06-02 16:00:22] [INFO ] Actually due to overlaps returned [46, 59, 61, 92, 93, 121, 22, 119, 129, 114]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 93 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/200 places, 133/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 126 transition count 130
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 123 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 121 transition count 128
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 46 place count 103 transition count 110
Applied a total of 46 rules in 8 ms. Remains 103 /126 variables (removed 23) and now considering 110/133 (removed 23) transitions.
// Phase 1: matrix 110 rows 103 cols
[2025-06-02 16:00:22] [INFO ] Computed 23 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:22] [INFO ] Implicit Places using invariants in 58 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/200 places, 110/197 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 101 transition count 109
Applied a total of 2 rules in 4 ms. Remains 101 /102 variables (removed 1) and now considering 109/110 (removed 1) transitions.
// Phase 1: matrix 109 rows 101 cols
[2025-06-02 16:00:22] [INFO ] Computed 22 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:22] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-02 16:00:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:22] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:00:22] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 101/200 places, 109/197 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 410 ms. Remains : 101/200 places, 109/197 transitions.
Stuttering acceptance computed with spot in 73 ms :[p1, p1]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-02
Product exploration explored 100000 steps with 885 reset in 121 ms.
Stack based approach found an accepted trace after 369 steps with 5 reset with depth 164 and stack size 164 in 1 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-02 finished in 618 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 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 197/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 200 transition count 180
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 183 transition count 180
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 34 place count 183 transition count 166
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 62 place count 169 transition count 166
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 168 transition count 165
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 168 transition count 165
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 136 transition count 133
Applied a total of 128 rules in 17 ms. Remains 136 /200 variables (removed 64) and now considering 133/197 (removed 64) transitions.
// Phase 1: matrix 133 rows 136 cols
[2025-06-02 16:00:22] [INFO ] Computed 33 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:23] [INFO ] Implicit Places using invariants in 96 ms returned [19, 36, 47, 49, 60, 62, 93, 94, 115, 120, 121, 129]
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 : 124/200 places, 133/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 124 transition count 128
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 119 transition count 128
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 68 place count 90 transition count 99
Applied a total of 68 rules in 7 ms. Remains 90 /124 variables (removed 34) and now considering 99/133 (removed 34) transitions.
// Phase 1: matrix 99 rows 90 cols
[2025-06-02 16:00:23] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:23] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-02 16:00:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:23] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:00:23] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/200 places, 99/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 311 ms. Remains : 90/200 places, 99/197 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-03
Product exploration explored 100000 steps with 1528 reset in 103 ms.
Product exploration explored 100000 steps with 1492 reset in 157 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 139 steps (0 resets) in 4 ms. (27 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 99/99 transitions.
Applied a total of 0 rules in 8 ms. Remains 90 /90 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2025-06-02 16:00:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:24] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-02 16:00:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:24] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:00:24] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:00:24] [INFO ] Redundant transitions in 3 ms returned []
Running 97 sub problems to find dead transitions.
[2025-06-02 16:00:24] [INFO ] Invariant cache hit.
[2025-06-02 16:00:24] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:24] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:24] [INFO ] Deduced a trap composed of 11 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 16:00:24] [INFO ] Deduced a trap composed of 4 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 16:00:24] [INFO ] Deduced a trap composed of 5 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 16:00:24] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:24] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:24] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:24] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:24] [INFO ] Deduced a trap composed of 3 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 16:00:24] [INFO ] Deduced a trap composed of 16 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 16:00:24] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:24] [INFO ] Deduced a trap composed of 13 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 16:00:24] [INFO ] Deduced a trap composed of 4 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 16:00:24] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:25] [INFO ] Deduced a trap composed of 17 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 16:00:25] [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 16:00:25] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:25] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:25] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:25] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:25] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:25] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:25] [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 16:00:25] [INFO ] Deduced a trap composed of 18 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 16:00:25] [INFO ] Deduced a trap composed of 20 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 16:00:25] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:25] [INFO ] Deduced a trap composed of 18 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 16:00:25] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:25] [INFO ] Deduced a trap composed of 19 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 16:00:25] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:25] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:26] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 3/89 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:26] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:26] [INFO ] Deduced a trap composed of 6 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 16:00:26] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:26] [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 16:00:27] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:27] [INFO ] Deduced a trap composed of 4 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 16:00:27] [INFO ] Deduced a trap composed of 17 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 16:00:27] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:27] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:27] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 10/62 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:27] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:27] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:27] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:28] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/89 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:28] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/89 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/89 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 1/90 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:29] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:29] [INFO ] Deduced a trap composed of 27 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 16:00:29] [INFO ] Deduced a trap composed of 17 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 16:00:29] [INFO ] Deduced a trap composed of 33 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 16:00:29] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:29] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/90 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/90 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 17 (OVERLAPS) 99/189 variables, 90/164 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/189 variables, 68/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/189 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 20 (OVERLAPS) 0/189 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 232 constraints, problems are : Problem set: 0 solved, 97 unsolved in 8321 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 47/63 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 3/89 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 1/90 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 99/189 variables, 90/164 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 68/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 97/329 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:34] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (OVERLAPS) 0/189 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 330 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6544 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14887ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 14887ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15083 ms. Remains : 90/90 places, 99/99 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 140 steps (0 resets) in 5 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1460 reset in 109 ms.
Product exploration explored 100000 steps with 1423 reset in 113 ms.
Built C files in :
/tmp/ltsmin16335812834209206669
[2025-06-02 16:00:39] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2025-06-02 16:00:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:00:39] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2025-06-02 16:00:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:00:39] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2025-06-02 16:00:39] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:00:39] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16335812834209206669
Running compilation step : cd /tmp/ltsmin16335812834209206669;'/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 199 ms.
Running link step : cd /tmp/ltsmin16335812834209206669;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin16335812834209206669;'/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/stateBased9765356136189333680.hoa' '--buchi-type=spotba'
LTSmin run took 564 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-2-LTLFireability-03 finished in 17628 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((F(p0)||p1)) U p2)||G(X(p1))))'
Support contains 8 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 199 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 199 transition count 196
Applied a total of 2 rules in 6 ms. Remains 199 /200 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 199 cols
[2025-06-02 16:00:40] [INFO ] Computed 33 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:40] [INFO ] Implicit Places using invariants in 125 ms returned [29, 34, 60, 83, 97, 99, 140, 141, 168, 179, 190]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 126 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/200 places, 196/197 transitions.
Applied a total of 0 rules in 1 ms. Remains 188 /188 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 188/200 places, 196/197 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-04
Product exploration explored 100000 steps with 452 reset in 104 ms.
Product exploration explored 100000 steps with 450 reset in 113 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 p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 9 factoid took 344 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
RANDOM walk for 40000 steps (8 resets) in 104 ms. (380 steps per ms) remains 1/4 properties
BEST_FIRST walk for 5281 steps (0 resets) in 19 ms. (264 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p1), (F p2), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 473 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
// Phase 1: matrix 196 rows 188 cols
[2025-06-02 16:00:42] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p1), (F p2), (F (NOT p0)), (F (NOT (OR p0 p1))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 9 factoid took 499 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-2-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-2-LTLFireability-04 finished in 2464 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(G(((G(p1)&&p0)||(X(X(G(p3)))&&p2)))))'
Support contains 5 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 199 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 199 transition count 196
Applied a total of 2 rules in 5 ms. Remains 199 /200 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 199 cols
[2025-06-02 16:00:43] [INFO ] Computed 33 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:43] [INFO ] Implicit Places using invariants in 115 ms returned [29, 34, 60, 85, 97, 99, 140, 141, 168, 175, 179, 190]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 115 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/200 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 2 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2025-06-02 16:00:43] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:43] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-02 16:00:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:43] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:00:44] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 857 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/200 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 982 ms. Remains : 185/200 places, 194/197 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), true, (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-05 finished in 1271 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(G(p0)))'
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 197/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 200 transition count 180
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 183 transition count 180
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 34 place count 183 transition count 165
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 64 place count 168 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 167 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 167 transition count 164
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 134 place count 133 transition count 130
Applied a total of 134 rules in 17 ms. Remains 133 /200 variables (removed 67) and now considering 130/197 (removed 67) transitions.
// Phase 1: matrix 130 rows 133 cols
[2025-06-02 16:00:44] [INFO ] Computed 33 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:44] [INFO ] Implicit Places using invariants in 98 ms returned [19, 22, 33, 44, 46, 57, 90, 91, 112, 117, 118, 126]
[2025-06-02 16:00:44] [INFO ] Actually due to overlaps returned [44, 46, 57, 90, 91, 118, 22, 117, 126, 33, 112]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 99 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/200 places, 130/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 122 transition count 125
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 117 transition count 125
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 62 place count 91 transition count 99
Applied a total of 62 rules in 6 ms. Remains 91 /122 variables (removed 31) and now considering 99/130 (removed 31) transitions.
// Phase 1: matrix 99 rows 91 cols
[2025-06-02 16:00:44] [INFO ] Computed 22 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:44] [INFO ] Implicit Places using invariants in 59 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/200 places, 99/197 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 98
Applied a total of 2 rules in 4 ms. Remains 89 /90 variables (removed 1) and now considering 98/99 (removed 1) transitions.
// Phase 1: matrix 98 rows 89 cols
[2025-06-02 16:00:44] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:44] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-02 16:00:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:44] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:00:44] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 89/200 places, 98/197 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 431 ms. Remains : 89/200 places, 98/197 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 102 ms.
Stack based approach found an accepted trace after 147 steps with 0 reset with depth 148 and stack size 148 in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-07 finished in 574 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(F((p0&&F(G(p1)))))))'
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 199 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 199 transition count 196
Applied a total of 2 rules in 5 ms. Remains 199 /200 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 199 cols
[2025-06-02 16:00:44] [INFO ] Computed 33 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:45] [INFO ] Implicit Places using invariants in 129 ms returned [29, 34, 60, 83, 85, 97, 99, 140, 141, 168, 175, 179, 190]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 130 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/200 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 3 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2025-06-02 16:00:45] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:45] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-02 16:00:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:45] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:00:45] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/200 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 685 ms. Remains : 184/200 places, 194/197 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 120 ms.
Stack based approach found an accepted trace after 491 steps with 0 reset with depth 492 and stack size 492 in 1 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-08 finished in 1007 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(p0))||G(p1))&&((F(p1) U p2)||F(p3))))'
Support contains 7 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 199 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 199 transition count 196
Applied a total of 2 rules in 6 ms. Remains 199 /200 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 199 cols
[2025-06-02 16:00:45] [INFO ] Computed 33 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:46] [INFO ] Implicit Places using invariants in 140 ms returned [29, 34, 60, 85, 97, 99, 140, 141, 175, 179, 190]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 141 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/200 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 3 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2025-06-02 16:00:46] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:46] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-02 16:00:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:46] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:00:46] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/200 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 599 ms. Remains : 186/200 places, 194/197 transitions.
Stuttering acceptance computed with spot in 298 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-10 finished in 921 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(p0))'
Support contains 7 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 197/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 200 transition count 184
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 187 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 186 transition count 183
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 28 place count 186 transition count 166
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 62 place count 169 transition count 166
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 168 transition count 165
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 168 transition count 165
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 126 place count 137 transition count 134
Applied a total of 126 rules in 16 ms. Remains 137 /200 variables (removed 63) and now considering 134/197 (removed 63) transitions.
// Phase 1: matrix 134 rows 137 cols
[2025-06-02 16:00:46] [INFO ] Computed 33 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:46] [INFO ] Implicit Places using invariants in 99 ms returned [23, 36, 47, 49, 60, 62, 94, 95, 116, 121, 130]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 99 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/200 places, 134/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 126 transition count 130
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 122 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 120 transition count 128
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 3 with 56 rules applied. Total rules applied 68 place count 92 transition count 100
Applied a total of 68 rules in 5 ms. Remains 92 /126 variables (removed 34) and now considering 100/134 (removed 34) transitions.
// Phase 1: matrix 100 rows 92 cols
[2025-06-02 16:00:46] [INFO ] Computed 22 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:46] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-02 16:00:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:47] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:00:47] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 92/200 places, 100/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 333 ms. Remains : 92/200 places, 100/197 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-11
Product exploration explored 100000 steps with 4946 reset in 98 ms.
Product exploration explored 100000 steps with 4940 reset in 120 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
RANDOM walk for 67 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2025-06-02 16:00:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 16:00:47] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2025-06-02 16:00:47] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-02 16:00:47] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2025-06-02 16:00:47] [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 16:00:47] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2025-06-02 16:00:47] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-02 16:00:47] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2025-06-02 16:00:47] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:00:48] [INFO ] [Nat]Added 68 Read/Feed constraints in 21 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:48] [INFO ] Deduced a trap composed of 4 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 16:00:48] [INFO ] Deduced a trap composed of 3 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 16:00:48] [INFO ] Deduced a trap composed of 3 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 16:00:48] [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 16:00:48] [INFO ] Deduced a trap composed of 4 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 16:00:48] [INFO ] Deduced a trap composed of 4 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 16:00:48] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
[2025-06-02 16:00:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 391 ms
[2025-06-02 16:00:48] [INFO ] Computed and/alt/rep : 98/232/98 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 16:00:48] [INFO ] Added : 75 causal constraints over 15 iterations in 192 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2025-06-02 16:00:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:48] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-02 16:00:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:00:48] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:00:48] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:00:48] [INFO ] Redundant transitions in 2 ms returned []
Running 98 sub problems to find dead transitions.
[2025-06-02 16:00:48] [INFO ] Invariant cache hit.
[2025-06-02 16:00:48] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:49] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:49] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:49] [INFO ] Deduced a trap composed of 10 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 16:00:49] [INFO ] Deduced a trap composed of 13 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 16:00:49] [INFO ] Deduced a trap composed of 11 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 16:00:49] [INFO ] Deduced a trap composed of 16 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 16:00:49] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:49] [INFO ] Deduced a trap composed of 16 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 16:00:49] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:49] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:49] [INFO ] Deduced a trap composed of 4 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 16:00:49] [INFO ] Deduced a trap composed of 12 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 16:00:49] [INFO ] Deduced a trap composed of 17 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 16:00:49] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:49] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:49] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:49] [INFO ] Deduced a trap composed of 9 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 16:00:49] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:49] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:49] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:49] [INFO ] Deduced a trap composed of 17 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 16:00:50] [INFO ] Deduced a trap composed of 14 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 16:00:50] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:50] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:50] [INFO ] Deduced a trap composed of 21 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 16:00:50] [INFO ] Deduced a trap composed of 18 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 16:00:50] [INFO ] Deduced a trap composed of 21 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 16:00:50] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:50] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:50] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:50] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 4/92 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:51] [INFO ] Deduced a trap composed of 8 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 16:00:51] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:51] [INFO ] Deduced a trap composed of 7 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 16:00:51] [INFO ] Deduced a trap composed of 6 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 16:00:51] [INFO ] Deduced a trap composed of 3 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 16:00:51] [INFO ] Deduced a trap composed of 7 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 16:00:51] [INFO ] Deduced a trap composed of 28 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 16:00:51] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:51] [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 16:00:51] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:51] [INFO ] Deduced a trap composed of 5 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 16:00:51] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:52] [INFO ] Deduced a trap composed of 34 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 16:00:52] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:52] [INFO ] Deduced a trap composed of 19 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 16:00:52] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:52] [INFO ] Deduced a trap composed of 7 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 16:00:52] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:52] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:52] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (OVERLAPS) 100/192 variables, 92/165 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 68/233 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/192 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (OVERLAPS) 0/192 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 233 constraints, problems are : Problem set: 0 solved, 98 unsolved in 7385 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 92/92 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 45/61 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 4/92 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:00:56] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 100/192 variables, 92/166 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 68/234 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 98/332 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/192 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 332 constraints, problems are : Problem set: 0 solved, 98 unsolved in 5507 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 92/92 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12901ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 12902ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13126 ms. Remains : 92/92 places, 100/100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 94 steps (0 resets) in 7 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2025-06-02 16:01:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 16:01:02] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2025-06-02 16:01:02] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-02 16:01:02] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2025-06-02 16:01:02] [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 16:01:02] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2025-06-02 16:01:02] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-02 16:01:02] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2025-06-02 16:01:02] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:01:02] [INFO ] [Nat]Added 68 Read/Feed constraints in 17 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:01:02] [INFO ] Deduced a trap composed of 4 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 16:01:02] [INFO ] Deduced a trap composed of 3 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 16:01:02] [INFO ] Deduced a trap composed of 3 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 16:01:02] [INFO ] Deduced a trap composed of 4 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 16:01:02] [INFO ] Deduced a trap composed of 4 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 16:01:02] [INFO ] Deduced a trap composed of 4 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 16:01:02] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 4 ms to minimize.
[2025-06-02 16:01:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 363 ms
[2025-06-02 16:01:02] [INFO ] Computed and/alt/rep : 98/232/98 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 16:01:02] [INFO ] Added : 75 causal constraints over 15 iterations in 183 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4949 reset in 114 ms.
Product exploration explored 100000 steps with 4969 reset in 107 ms.
Built C files in :
/tmp/ltsmin2619430357039602986
[2025-06-02 16:01:03] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2025-06-02 16:01:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:01:03] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2025-06-02 16:01:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:01:03] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2025-06-02 16:01:03] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:01:03] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2619430357039602986
Running compilation step : cd /tmp/ltsmin2619430357039602986;'/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 197 ms.
Running link step : cd /tmp/ltsmin2619430357039602986;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2619430357039602986;'/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/stateBased13777280958488326094.hoa' '--buchi-type=spotba'
LTSmin run took 194 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-2-LTLFireability-11 finished in 16738 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) U (p1 U X(p2))))'
Support contains 6 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 197/197 transitions.
Applied a total of 0 rules in 1 ms. Remains 200 /200 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 200 cols
[2025-06-02 16:01:03] [INFO ] Computed 33 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:01:03] [INFO ] Implicit Places using invariants in 116 ms returned [29, 34, 60, 83, 99, 141, 169, 176, 180, 191]
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 : 190/200 places, 197/197 transitions.
Applied a total of 0 rules in 1 ms. Remains 190 /190 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 130 ms. Remains : 190/200 places, 197/197 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-14 finished in 362 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((F(G(p1))||p0)))'
Support contains 4 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 199 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 199 transition count 196
Applied a total of 2 rules in 5 ms. Remains 199 /200 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 199 cols
[2025-06-02 16:01:03] [INFO ] Computed 33 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:01:04] [INFO ] Implicit Places using invariants in 126 ms returned [29, 34, 60, 83, 85, 99, 141, 168, 175, 179, 190]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 127 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/200 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 11 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2025-06-02 16:01:04] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:01:04] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-02 16:01:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:01:04] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:01:04] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 904 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/200 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1047 ms. Remains : 186/200 places, 194/197 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Product exploration explored 100000 steps with 50000 reset in 116 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 11 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-2-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-2-LTLFireability-15 finished in 1386 ms.
All properties solved by simple procedures.
Total runtime 151193 ms.

BK_STOP 1748880065355

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

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