About the Execution of ITS-Tools for ParamProductionCell-PT-4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 296156.00 | 0.00 | 0.00 | FTFFTFTTFFTFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812500387.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-4, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812500387
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K 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-4-LTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748880688777
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 16:11:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 16:11:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 16:11:30] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2025-06-02 16:11:30] [INFO ] Transformed 231 places.
[2025-06-02 16:11:30] [INFO ] Transformed 202 transitions.
[2025-06-02 16:11:30] [INFO ] Found NUPN structural information;
[2025-06-02 16:11:30] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA ParamProductionCell-PT-4-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 227 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 227 transition count 198
Applied a total of 8 rules in 46 ms. Remains 227 /231 variables (removed 4) and now considering 198/202 (removed 4) transitions.
// Phase 1: matrix 198 rows 227 cols
[2025-06-02 16:11:30] [INFO ] Computed 59 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:11:30] [INFO ] Implicit Places using invariants in 421 ms returned [15, 16, 18, 24, 31, 35, 36, 41, 42, 46, 47, 59, 64, 65, 78, 79, 98, 99, 101, 114, 115, 117, 119, 120, 161, 164, 166, 167, 192, 193, 196, 197, 202, 203, 207, 218]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 453 ms to find 36 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 191/231 places, 198/202 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 189 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 189 transition count 196
Applied a total of 4 rules in 16 ms. Remains 189 /191 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 189 cols
[2025-06-02 16:11:30] [INFO ] Computed 23 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:11:30] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-02 16:11:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:11:31] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:11:31] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 189/231 places, 196/202 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1182 ms. Remains : 189/231 places, 196/202 transitions.
Support contains 30 out of 189 places after structural reductions.
[2025-06-02 16:11:31] [INFO ] Flatten gal took : 48 ms
[2025-06-02 16:11:31] [INFO ] Flatten gal took : 16 ms
[2025-06-02 16:11:31] [INFO ] Input system was already deterministic with 196 transitions.
Support contains 26 out of 189 places (down from 30) after GAL structural reductions.
RANDOM walk for 1235 steps (0 resets) in 83 ms. (14 steps per ms) remains 0/17 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' '!(((F((p0&&F(!p1))) U p2)&&X(F(p3))))'
Support contains 7 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 187 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 187 transition count 194
Applied a total of 4 rules in 11 ms. Remains 187 /189 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 187 cols
[2025-06-02 16:11:32] [INFO ] Computed 23 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:11:32] [INFO ] Implicit Places using invariants in 104 ms returned [16, 59, 134]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 106 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 194/196 transitions.
Applied a total of 0 rules in 5 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 184/189 places, 194/196 transitions.
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p0) p1), (NOT p2), (NOT p3), p1]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 260 ms.
Product exploration explored 100000 steps with 50000 reset in 194 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 p2 (NOT p0) p1 p3), (X p2), (X (NOT (AND (NOT p2) p0 p1))), (X p3), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p3)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 24 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-4-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-4-LTLCardinality-06 finished in 1027 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 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 187 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 187 transition count 194
Applied a total of 4 rules in 9 ms. Remains 187 /189 variables (removed 2) and now considering 194/196 (removed 2) transitions.
[2025-06-02 16:11:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:11:33] [INFO ] Implicit Places using invariants in 212 ms returned [16, 59, 134]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 214 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 194/196 transitions.
Applied a total of 0 rules in 5 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 228 ms. Remains : 184/189 places, 194/196 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 119 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 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 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-4-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-4-LTLCardinality-07 finished in 624 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 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 196/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 189 transition count 164
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 157 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 156 transition count 163
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 66 place count 156 transition count 148
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 96 place count 141 transition count 148
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 98 place count 139 transition count 146
Iterating global reduction 3 with 2 rules applied. Total rules applied 100 place count 139 transition count 146
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 180 place count 99 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 184 place count 97 transition count 104
Applied a total of 184 rules in 40 ms. Remains 97 /189 variables (removed 92) and now considering 104/196 (removed 92) transitions.
// Phase 1: matrix 104 rows 97 cols
[2025-06-02 16:11:33] [INFO ] Computed 23 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:11:33] [INFO ] Implicit Places using invariants in 109 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 111 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/189 places, 104/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 156 ms. Remains : 96/189 places, 104/196 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-10
Product exploration explored 100000 steps with 9821 reset in 191 ms.
Product exploration explored 100000 steps with 9827 reset in 182 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 71 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 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 36 steps (0 resets) in 5 ms. (6 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 87 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 104 rows 96 cols
[2025-06-02 16:11:34] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 16:11:34] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2025-06-02 16:11:34] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-02 16:11:34] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2025-06-02 16:11:34] [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:11:34] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2025-06-02 16:11:34] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 4 ms returned sat
[2025-06-02 16:11:34] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2025-06-02 16:11:34] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-02 16:11:34] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:35] [INFO ] Deduced a trap composed of 3 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 16:11:35] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:35] [INFO ] Deduced a trap composed of 4 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 16:11:35] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:35] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:35] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:35] [INFO ] Deduced a trap composed of 11 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 16:11:35] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:35] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:35] [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 16:11:35] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:35] [INFO ] Deduced a trap composed of 19 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:11:35] [INFO ] Deduced a trap composed of 14 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:11:35] [INFO ] Deduced a trap composed of 6 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:11:35] [INFO ] Deduced a trap composed of 4 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:11:35] [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:11:36] [INFO ] Deduced a trap composed of 19 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:11:36] [INFO ] Deduced a trap composed of 5 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:11:36] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 3 ms to minimize.
[2025-06-02 16:11:36] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1160 ms
[2025-06-02 16:11:36] [INFO ] Computed and/alt/rep : 101/223/101 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 16:11:36] [INFO ] Added : 80 causal constraints over 16 iterations in 194 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 104/104 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2025-06-02 16:11:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:11:36] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-02 16:11:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:11:36] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-02 16:11:36] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:11:36] [INFO ] Redundant transitions in 3 ms returned []
Running 101 sub problems to find dead transitions.
[2025-06-02 16:11:36] [INFO ] Invariant cache hit.
[2025-06-02 16:11:36] [INFO ] State equation strengthened by 66 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:37] [INFO ] Deduced a trap composed of 6 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:11:37] [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:11:37] [INFO ] Deduced a trap composed of 13 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 16:11:37] [INFO ] Deduced a trap composed of 15 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:11:37] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:37] [INFO ] Deduced a trap composed of 14 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:11:37] [INFO ] Deduced a trap composed of 3 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:11:37] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:37] [INFO ] Deduced a trap composed of 17 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:11:37] [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:11:37] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:37] [INFO ] Deduced a trap composed of 19 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 16:11:37] [INFO ] Deduced a trap composed of 4 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:11:37] [INFO ] Deduced a trap composed of 11 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:11:37] [INFO ] Deduced a trap composed of 19 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:11:37] [INFO ] Deduced a trap composed of 6 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:11:37] [INFO ] Deduced a trap composed of 4 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:11:37] [INFO ] Deduced a trap composed of 4 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:11:37] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:37] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:37] [INFO ] Deduced a trap composed of 14 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:11:38] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:38] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:38] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:38] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:38] [INFO ] Deduced a trap composed of 17 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:11:38] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:38] [INFO ] Deduced a trap composed of 16 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 16:11:38] [INFO ] Deduced a trap composed of 21 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 16:11:38] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:38] [INFO ] Deduced a trap composed of 21 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:11:38] [INFO ] Deduced a trap composed of 3 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:11:38] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:39] [INFO ] Deduced a trap composed of 26 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:11:39] [INFO ] Deduced a trap composed of 21 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:11:39] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 2/96 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:40] [INFO ] Deduced a trap composed of 6 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:11:40] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 104/200 variables, 96/156 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 66/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:41] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 13 (OVERLAPS) 0/200 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 223 constraints, problems are : Problem set: 0 solved, 101 unsolved in 7398 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 96/96 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 38/58 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 2/96 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 104/200 variables, 96/157 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 66/223 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 101/324 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/200 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 324 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5456 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 96/96 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12895ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 12898ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13166 ms. Remains : 96/96 places, 104/104 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 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 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 36 steps (0 resets) in 4 ms. (7 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 102 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2025-06-02 16:11:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 16:11:49] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-06-02 16:11:49] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-02 16:11:50] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2025-06-02 16:11:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 16:11:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2025-06-02 16:11:50] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-02 16:11:50] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2025-06-02 16:11:50] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-02 16:11:50] [INFO ] [Nat]Added 66 Read/Feed constraints in 16 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:50] [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:11:50] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:50] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:50] [INFO ] Deduced a trap composed of 6 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:11:50] [INFO ] Deduced a trap composed of 6 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:11:50] [INFO ] Deduced a trap composed of 3 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:11:50] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 3 ms to minimize.
[2025-06-02 16:11:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 425 ms
[2025-06-02 16:11:50] [INFO ] Computed and/alt/rep : 101/223/101 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 16:11:50] [INFO ] Added : 38 causal constraints over 8 iterations in 184 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9835 reset in 101 ms.
Product exploration explored 100000 steps with 9800 reset in 102 ms.
Built C files in :
/tmp/ltsmin5370012788815487788
[2025-06-02 16:11:51] [INFO ] Computing symmetric may disable matrix : 104 transitions.
[2025-06-02 16:11:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:11:51] [INFO ] Computing symmetric may enable matrix : 104 transitions.
[2025-06-02 16:11:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:11:51] [INFO ] Computing Do-Not-Accords matrix : 104 transitions.
[2025-06-02 16:11:51] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:11:51] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5370012788815487788
Running compilation step : cd /tmp/ltsmin5370012788815487788;'/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 305 ms.
Running link step : cd /tmp/ltsmin5370012788815487788;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin5370012788815487788;'/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/stateBased2143916465286021655.hoa' '--buchi-type=spotba'
LTSmin run took 3964 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-4-LTLCardinality-10 finished in 21831 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||F(p1))) U X((X(p2)&&G(p3)))))'
Support contains 5 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 187 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 187 transition count 194
Applied a total of 4 rules in 12 ms. Remains 187 /189 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 187 cols
[2025-06-02 16:11:55] [INFO ] Computed 23 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:11:55] [INFO ] Implicit Places using invariants in 86 ms returned [16, 59, 134]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 87 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 194/196 transitions.
Applied a total of 0 rules in 8 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 184/189 places, 194/196 transitions.
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p2) (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p1) p0 p3 (NOT p2)), (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-11
Product exploration explored 100000 steps with 5971 reset in 104 ms.
Product exploration explored 100000 steps with 5904 reset in 122 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X (NOT p3)), (X (NOT (AND p0 (NOT p1) p3))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 146 ms. Reduced automaton from 9 states, 29 edges and 4 AP (stutter sensitive) to 9 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p2) (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p1) p0 p3 (NOT p2)), (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 484 ms. (82 steps per ms) remains 1/14 properties
BEST_FIRST walk for 1629 steps (0 resets) in 9 ms. (162 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X (NOT p3)), (X (NOT (AND p0 (NOT p1) p3))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p0 p1 (NOT p3) p2))), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT (OR p0 p1 (NOT p3)))), (F (NOT (OR (NOT p3) p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1 (NOT p3) p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) p1 (NOT p3)))), (F p3), (F (NOT (OR p3 p2))), (F (NOT (OR p0 p1 p3 p2)))]
Knowledge based reduction with 22 factoid took 572 ms. Reduced automaton from 9 states, 28 edges and 4 AP (stutter sensitive) to 9 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 395 ms :[(OR (NOT p2) (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p1) p0 p3 (NOT p2)), (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p2)]
Stuttering acceptance computed with spot in 362 ms :[(OR (NOT p2) (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p1) p0 p3 (NOT p2)), (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p2)]
// Phase 1: matrix 194 rows 184 cols
[2025-06-02 16:11:58] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 16:11:58] [INFO ] [Real]Absence check using 18 positive place invariants in 18 ms returned sat
[2025-06-02 16:11:58] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 7 ms returned sat
[2025-06-02 16:11:58] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2025-06-02 16:11:58] [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:11:58] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2025-06-02 16:11:58] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-02 16:11:59] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2025-06-02 16:11:59] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:11:59] [INFO ] [Nat]Added 68 Read/Feed constraints in 68 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:59] [INFO ] Deduced a trap composed of 5 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 16:11:59] [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 16:11:59] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:59] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:59] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:11:59] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:00] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:00] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:00] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:00] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:00] [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 16:12:00] [INFO ] Deduced a trap composed of 24 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:12:00] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 2 ms to minimize.
[2025-06-02 16:12:00] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1377 ms
[2025-06-02 16:12:00] [INFO ] Computed and/alt/rep : 190/309/190 causal constraints (skipped 0 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:01] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 6 ms to minimize.
[2025-06-02 16:12:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2025-06-02 16:12:02] [INFO ] Added : 142 causal constraints over 29 iterations in 1390 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 5 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2025-06-02 16:12:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:12:02] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-02 16:12:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:12:02] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:12:02] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2025-06-02 16:12:02] [INFO ] Invariant cache hit.
[2025-06-02 16:12:02] [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/179 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:03] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:03] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:03] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:03] [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:12:03] [INFO ] Deduced a trap composed of 19 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 16:12:03] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:03] [INFO ] Deduced a trap composed of 18 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:12:03] [INFO ] Deduced a trap composed of 19 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:12:04] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:04] [INFO ] Deduced a trap composed of 24 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:12:04] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:04] [INFO ] Deduced a trap composed of 36 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:12:04] [INFO ] Deduced a trap composed of 27 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:12:04] [INFO ] Deduced a trap composed of 7 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:12:04] [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:12:04] [INFO ] Deduced a trap composed of 7 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:12:04] [INFO ] Deduced a trap composed of 18 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:12:04] [INFO ] Deduced a trap composed of 7 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:12:04] [INFO ] Deduced a trap composed of 36 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:12:04] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:04] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:04] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:04] [INFO ] Deduced a trap composed of 19 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:12:05] [INFO ] Deduced a trap composed of 36 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:12:05] [INFO ] Deduced a trap composed of 37 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:12:05] [INFO ] Deduced a trap composed of 36 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:12:05] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 4/183 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:07] [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:12:07] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:07] [INFO ] Deduced a trap composed of 17 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:12:07] [INFO ] Deduced a trap composed of 7 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 16:12:07] [INFO ] Deduced a trap composed of 25 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 16:12:07] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:07] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:07] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:08] [INFO ] Deduced a trap composed of 6 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:12:08] [INFO ] Deduced a trap composed of 24 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:12:08] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:08] [INFO ] Deduced a trap composed of 17 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:12:08] [INFO ] Deduced a trap composed of 26 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:12:08] [INFO ] Deduced a trap composed of 26 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:12:08] [INFO ] Deduced a trap composed of 25 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 16:12:08] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:08] [INFO ] Deduced a trap composed of 53 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:12:08] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:09] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:09] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:10] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:11] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:12] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (OVERLAPS) 1/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (OVERLAPS) 194/378 variables, 184/254 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 68/322 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/378 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 16 (OVERLAPS) 0/378 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 322 constraints, problems are : Problem set: 0 solved, 190 unsolved in 23829 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 184/184 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 4/183 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 1/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:29] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (OVERLAPS) 194/378 variables, 184/255 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 68/323 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 190/513 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (OVERLAPS) 0/378 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 513 constraints, problems are : Problem set: 0 solved, 190 unsolved in 20733 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 184/184 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44587ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 44589ms
Finished structural reductions in LTL mode , in 1 iterations and 45312 ms. Remains : 184/184 places, 194/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X (NOT p3)), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 130 ms. Reduced automaton from 9 states, 28 edges and 4 AP (stutter sensitive) to 9 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 407 ms :[(OR (NOT p2) (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p1) p0 p3 (NOT p2)), (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 122 ms. (325 steps per ms) remains 3/14 properties
BEST_FIRST walk for 14751 steps (2 resets) in 28 ms. (508 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X (NOT p3)), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1 (NOT p3) p2))), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT (OR p0 p1 (NOT p3)))), (F (NOT (OR (NOT p3) p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1 (NOT p3) p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) p1 (NOT p3)))), (F p3), (F (NOT (OR p3 p2))), (F (NOT (OR p0 p1 p3 p2)))]
Knowledge based reduction with 20 factoid took 621 ms. Reduced automaton from 9 states, 28 edges and 4 AP (stutter sensitive) to 9 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[(OR (NOT p2) (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p1) p0 p3 (NOT p2)), (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p2)]
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p2) (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p1) p0 p3 (NOT p2)), (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p2)]
[2025-06-02 16:12:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 16:12:49] [INFO ] [Real]Absence check using 18 positive place invariants in 19 ms returned sat
[2025-06-02 16:12:49] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 9 ms returned sat
[2025-06-02 16:12:50] [INFO ] [Real]Absence check using state equation in 616 ms returned sat
[2025-06-02 16:12:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 16:12:50] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2025-06-02 16:12:50] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-02 16:12:50] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2025-06-02 16:12:50] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:12:50] [INFO ] [Nat]Added 68 Read/Feed constraints in 106 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:50] [INFO ] Deduced a trap composed of 5 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 16:12:50] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:50] [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 16:12:51] [INFO ] Deduced a trap composed of 6 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 16:12:51] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:51] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:51] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 6 ms to minimize.
[2025-06-02 16:12:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 742 ms
[2025-06-02 16:12:51] [INFO ] Computed and/alt/rep : 190/309/190 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-02 16:12:52] [INFO ] Added : 63 causal constraints over 13 iterations in 691 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 382 ms :[(OR (NOT p2) (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p1) p0 p3 (NOT p2)), (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p2)]
Product exploration explored 100000 steps with 3180 reset in 106 ms.
Product exploration explored 100000 steps with 3165 reset in 106 ms.
Applying partial POR strategy [false, true, false, true, true, true, true, false, false]
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p2) (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p1) p0 p3 (NOT p2)), (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p2)]
Support contains 5 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 184 transition count 194
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 35 place count 184 transition count 196
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 47 place count 184 transition count 196
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 55 place count 176 transition count 187
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 176 transition count 187
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 104 place count 176 transition count 187
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 128 place count 152 transition count 163
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 152 place count 152 transition count 163
Deduced a syphon composed of 56 places in 0 ms
Applied a total of 152 rules in 20 ms. Remains 152 /184 variables (removed 32) and now considering 163/194 (removed 31) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:12:53] [INFO ] Redundant transitions in 4 ms returned []
Running 160 sub problems to find dead transitions.
// Phase 1: matrix 163 rows 152 cols
[2025-06-02 16:12:53] [INFO ] Computed 20 invariants in 1 ms
[2025-06-02 16:12:53] [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/148 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:53] [INFO ] Deduced a trap composed of 12 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:12:53] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:54] [INFO ] Deduced a trap composed of 3 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:12:54] [INFO ] Deduced a trap composed of 16 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:12:54] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:54] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 5 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:54] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:54] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 5 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:54] [INFO ] Deduced a trap composed of 17 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:12:54] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:54] [INFO ] Deduced a trap composed of 10 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:12:54] [INFO ] Deduced a trap composed of 16 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:12:54] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 6 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:54] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 5 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:54] [INFO ] Deduced a trap composed of 12 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:12:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Problem TDEAD100 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:54] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 2 ms to minimize.
Problem TDEAD103 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:54] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 2 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:54] [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:12:54] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 20/35 constraints. Problems are: Problem set: 43 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:55] [INFO ] Deduced a trap composed of 23 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:12:55] [INFO ] Deduced a trap composed of 4 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:12:55] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 3/38 constraints. Problems are: Problem set: 43 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:55] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/39 constraints. Problems are: Problem set: 43 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/39 constraints. Problems are: Problem set: 43 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 3/151 variables, 3/42 constraints. Problems are: Problem set: 43 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 1/43 constraints. Problems are: Problem set: 43 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:57] [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:12:57] [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 16:12:57] [INFO ] Deduced a trap composed of 8 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:12:57] [INFO ] Deduced a trap composed of 8 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:12:57] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:57] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:57] [INFO ] Deduced a trap composed of 13 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:12:57] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:57] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD57 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:57] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:57] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD111 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:57] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 3 ms to minimize.
Problem TDEAD117 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:57] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 13/56 constraints. Problems are: Problem set: 57 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:58] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:58] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:58] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 3/59 constraints. Problems are: Problem set: 57 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:12:58] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 1/60 constraints. Problems are: Problem set: 57 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 0/60 constraints. Problems are: Problem set: 57 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 1/152 variables, 1/61 constraints. Problems are: Problem set: 57 solved, 103 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 0/61 constraints. Problems are: Problem set: 57 solved, 103 unsolved
At refinement iteration 13 (OVERLAPS) 163/315 variables, 152/213 constraints. Problems are: Problem set: 57 solved, 103 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 68/281 constraints. Problems are: Problem set: 57 solved, 103 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/315 variables, 0/281 constraints. Problems are: Problem set: 57 solved, 103 unsolved
At refinement iteration 16 (OVERLAPS) 0/315 variables, 0/281 constraints. Problems are: Problem set: 57 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 281 constraints, problems are : Problem set: 57 solved, 103 unsolved in 10147 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 152/152 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 57 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 10/10 constraints. Problems are: Problem set: 57 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 34/44 constraints. Problems are: Problem set: 57 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/44 constraints. Problems are: Problem set: 57 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 59/151 variables, 8/52 constraints. Problems are: Problem set: 57 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 1/53 constraints. Problems are: Problem set: 57 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 7/60 constraints. Problems are: Problem set: 57 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/60 constraints. Problems are: Problem set: 57 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 1/152 variables, 1/61 constraints. Problems are: Problem set: 57 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/61 constraints. Problems are: Problem set: 57 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 163/315 variables, 152/213 constraints. Problems are: Problem set: 57 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 68/281 constraints. Problems are: Problem set: 57 solved, 103 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/315 variables, 103/384 constraints. Problems are: Problem set: 57 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:06] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/315 variables, 1/385 constraints. Problems are: Problem set: 57 solved, 103 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/315 variables, 0/385 constraints. Problems are: Problem set: 57 solved, 103 unsolved
At refinement iteration 14 (OVERLAPS) 0/315 variables, 0/385 constraints. Problems are: Problem set: 57 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 385 constraints, problems are : Problem set: 57 solved, 103 unsolved in 14306 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 152/152 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 103/160 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24469ms problems are : Problem set: 57 solved, 103 unsolved
Search for dead transitions found 57 dead transitions in 24470ms
Found 57 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 57 transitions
Dead transitions reduction (with SMT) removed 57 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 152/184 places, 106/194 transitions.
Graph (complete) has 310 edges and 152 vertex of which 96 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.1 ms
Discarding 56 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 96 transition count 106
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 96 transition count 106
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 6 ms. Remains 96 /152 variables (removed 56) and now considering 106/106 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 96/184 places, 106/194 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 24507 ms. Remains : 96/184 places, 106/194 transitions.
Built C files in :
/tmp/ltsmin8337022228257033820
[2025-06-02 16:13:17] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8337022228257033820
Running compilation step : cd /tmp/ltsmin8337022228257033820;'/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 296 ms.
Running link step : cd /tmp/ltsmin8337022228257033820;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8337022228257033820;'/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/stateBased8115257923117968820.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Applied a total of 0 rules in 5 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 184 cols
[2025-06-02 16:13:32] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:13:33] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-02 16:13:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:13:33] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:13:33] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2025-06-02 16:13:33] [INFO ] Invariant cache hit.
[2025-06-02 16:13:33] [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/179 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:34] [INFO ] Deduced a trap composed of 5 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:13:34] [INFO ] Deduced a trap composed of 25 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:13:34] [INFO ] Deduced a trap composed of 26 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:13:34] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:34] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:34] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:34] [INFO ] Deduced a trap composed of 18 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:13:34] [INFO ] Deduced a trap composed of 19 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:13:34] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:34] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:34] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:35] [INFO ] Deduced a trap composed of 36 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:13:35] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:35] [INFO ] Deduced a trap composed of 7 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:13:35] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:35] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:35] [INFO ] Deduced a trap composed of 18 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:13:35] [INFO ] Deduced a trap composed of 7 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:13:35] [INFO ] Deduced a trap composed of 36 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:13:35] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:35] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:35] [INFO ] Deduced a trap composed of 25 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:13:35] [INFO ] Deduced a trap composed of 19 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:13:35] [INFO ] Deduced a trap composed of 36 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:13:36] [INFO ] Deduced a trap composed of 37 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:13:36] [INFO ] Deduced a trap composed of 36 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:13:36] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 4/183 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:38] [INFO ] Deduced a trap composed of 17 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:13:38] [INFO ] Deduced a trap composed of 5 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:13:38] [INFO ] Deduced a trap composed of 17 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:13:38] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:38] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:38] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:38] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:38] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:38] [INFO ] Deduced a trap composed of 6 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:13:38] [INFO ] Deduced a trap composed of 24 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:13:38] [INFO ] Deduced a trap composed of 24 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:13:38] [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:13:39] [INFO ] Deduced a trap composed of 26 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:13:39] [INFO ] Deduced a trap composed of 26 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:13:39] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:39] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:39] [INFO ] Deduced a trap composed of 53 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 16:13:39] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:39] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:40] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:41] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:41] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:13:42] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (OVERLAPS) 1/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (OVERLAPS) 194/378 variables, 184/254 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 68/322 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/378 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 16 (OVERLAPS) 0/378 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 322 constraints, problems are : Problem set: 0 solved, 190 unsolved in 23721 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 184/184 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 4/183 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 1/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:14:00] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (OVERLAPS) 194/378 variables, 184/255 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 68/323 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 190/513 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (OVERLAPS) 0/378 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 513 constraints, problems are : Problem set: 0 solved, 190 unsolved in 20484 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 184/184 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44226ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 44227ms
Finished structural reductions in LTL mode , in 1 iterations and 44937 ms. Remains : 184/184 places, 194/194 transitions.
Built C files in :
/tmp/ltsmin1351160113138197844
[2025-06-02 16:14:17] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1351160113138197844
Running compilation step : cd /tmp/ltsmin1351160113138197844;'/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 295 ms.
Running link step : cd /tmp/ltsmin1351160113138197844;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1351160113138197844;'/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/stateBased7791769819832230784.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 16:14:33] [INFO ] Flatten gal took : 11 ms
[2025-06-02 16:14:33] [INFO ] Flatten gal took : 10 ms
[2025-06-02 16:14:33] [INFO ] Time to serialize gal into /tmp/LTL2184808243829862981.gal : 3 ms
[2025-06-02 16:14:33] [INFO ] Time to serialize properties into /tmp/LTL5825878998332002246.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2184808243829862981.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11587204162918487199.hoa' '-atoms' '/tmp/LTL5825878998332002246.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5825878998332002246.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11587204162918487199.hoa
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t62, t65, t72, t73, t75, t76, t79, t80,...442
Detected timeout of ITS tools.
[2025-06-02 16:14:48] [INFO ] Flatten gal took : 10 ms
[2025-06-02 16:14:48] [INFO ] Flatten gal took : 8 ms
[2025-06-02 16:14:48] [INFO ] Time to serialize gal into /tmp/LTL12015488369990657885.gal : 3 ms
[2025-06-02 16:14:48] [INFO ] Time to serialize properties into /tmp/LTL12044540435789215349.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12015488369990657885.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12044540435789215349.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G(("(arm1_waiting_for_swivel_1==1)")||(F("(ch_TA1_full==1)"))))U(X((X("((CL_ready_to_transport==0)||(A1_extended==1))"))&&(G("(A2U...174
Formula 0 simplified : F(!"(arm1_waiting_for_swivel_1==1)" & G!"(ch_TA1_full==1)") R X(X!"((CL_ready_to_transport==0)||(A1_extended==1))" | F!"(A2U_rotated...161
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t62, t65, t72, t73, t75, t76, t79, t80,...442
Detected timeout of ITS tools.
[2025-06-02 16:15:03] [INFO ] Flatten gal took : 8 ms
[2025-06-02 16:15:03] [INFO ] Applying decomposition
[2025-06-02 16:15:03] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15890431301810304776.txt' '-o' '/tmp/graph15890431301810304776.bin' '-w' '/tmp/graph15890431301810304776.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15890431301810304776.bin' '-l' '-1' '-v' '-w' '/tmp/graph15890431301810304776.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:15:03] [INFO ] Decomposing Gal with order
[2025-06-02 16:15:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:15:03] [INFO ] Removed a total of 47 redundant transitions.
[2025-06-02 16:15:03] [INFO ] Flatten gal took : 44 ms
[2025-06-02 16:15:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-02 16:15:03] [INFO ] Time to serialize gal into /tmp/LTL6053313737343178280.gal : 4 ms
[2025-06-02 16:15:03] [INFO ] Time to serialize properties into /tmp/LTL11018061373386489067.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6053313737343178280.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11018061373386489067.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G(("(i1.i2.u46.arm1_waiting_for_swivel_1==1)")||(F("(i1.i2.u15.ch_TA1_full==1)"))))U(X((X("((i9.i1.u74.CL_ready_to_transport==0)||...221
Formula 0 simplified : F(!"(i1.i2.u46.arm1_waiting_for_swivel_1==1)" & G!"(i1.i2.u15.ch_TA1_full==1)") R X(X!"((i9.i1.u74.CL_ready_to_transport==0)||(i8.i0...208
Reverse transition relation is NOT exact ! Due to transitions t62, t115, t118, i0.i0.u1.t10, i0.i0.u8.t6, i0.i1.u9.t14, i1.i0.u2.t22, i1.i0.u14.t34, i1.i0....814
365 unique states visited
203 strongly connected components in search stack
365 transitions explored
364 items max in DFS search stack
252 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.5542,119544,1,0,237656,277,3198,285112,167,909,567285
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ParamProductionCell-PT-4-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ParamProductionCell-PT-4-LTLCardinality-11 finished in 190958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(F(p0)))) U G(p1)))'
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 187 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 187 transition count 194
Applied a total of 4 rules in 14 ms. Remains 187 /189 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 187 cols
[2025-06-02 16:15:06] [INFO ] Computed 23 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:15:06] [INFO ] Implicit Places using invariants in 103 ms returned [16, 134]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 114 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/189 places, 194/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 130 ms. Remains : 185/189 places, 194/196 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-12
Product exploration explored 100000 steps with 24980 reset in 111 ms.
Product exploration explored 100000 steps with 24911 reset in 117 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 557 steps (0 resets) in 7 ms. (69 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 185 cols
[2025-06-02 16:15:07] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:15:07] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-02 16:15:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:15:08] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-02 16:15:08] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2025-06-02 16:15:08] [INFO ] Invariant cache hit.
[2025-06-02 16:15:08] [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/179 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:08] [INFO ] Deduced a trap composed of 5 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:15:08] [INFO ] Deduced a trap composed of 25 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:15:09] [INFO ] Deduced a trap composed of 7 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 16:15:09] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:09] [INFO ] Deduced a trap composed of 19 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:15:09] [INFO ] Deduced a trap composed of 19 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:15:09] [INFO ] Deduced a trap composed of 30 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:15:09] [INFO ] Deduced a trap composed of 18 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 16:15:09] [INFO ] Deduced a trap composed of 19 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:15:09] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:09] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:09] [INFO ] Deduced a trap composed of 36 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:15:09] [INFO ] Deduced a trap composed of 27 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:15:09] [INFO ] Deduced a trap composed of 18 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:15:09] [INFO ] Deduced a trap composed of 18 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:15:09] [INFO ] Deduced a trap composed of 7 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:15:09] [INFO ] Deduced a trap composed of 7 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 16:15:09] [INFO ] Deduced a trap composed of 36 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:15:09] [INFO ] Deduced a trap composed of 31 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:15:09] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:10] [INFO ] Deduced a trap composed of 21 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:15:10] [INFO ] Deduced a trap composed of 31 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:15:10] [INFO ] Deduced a trap composed of 25 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 16:15:10] [INFO ] Deduced a trap composed of 19 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:15:10] [INFO ] Deduced a trap composed of 41 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:15:10] [INFO ] Deduced a trap composed of 36 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:15:10] [INFO ] Deduced a trap composed of 35 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:15:10] [INFO ] Deduced a trap composed of 30 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:15:10] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:11] [INFO ] Deduced a trap composed of 19 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:15:11] [INFO ] Deduced a trap composed of 37 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:15:11] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 5/184 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:14] [INFO ] Deduced a trap composed of 5 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:15:14] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:14] [INFO ] Deduced a trap composed of 35 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:15:14] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:14] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:14] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:14] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:14] [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:15:14] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:14] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:14] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:15] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:15] [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:15:15] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:15] [INFO ] Deduced a trap composed of 36 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 16:15:15] [INFO ] Deduced a trap composed of 38 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 16:15:15] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:15] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:16] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:15:16] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 1/185 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (OVERLAPS) 194/379 variables, 185/258 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 68/326 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (OVERLAPS) 0/379 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 326 constraints, problems are : Problem set: 0 solved, 190 unsolved in 19749 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 43/57 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 5/184 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 1/185 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 194/379 variables, 185/258 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 68/326 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 190/516 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (OVERLAPS) 0/379 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 516 constraints, problems are : Problem set: 0 solved, 190 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49784ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 49786ms
Finished structural reductions in LTL mode , in 1 iterations and 50171 ms. Remains : 185/185 places, 194/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 881 steps (0 resets) in 6 ms. (125 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25078 reset in 102 ms.
Product exploration explored 100000 steps with 24995 reset in 115 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 185 transition count 194
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 36 place count 185 transition count 194
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 47 place count 185 transition count 194
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 175 transition count 184
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 175 transition count 184
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 108 place count 175 transition count 184
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 133 place count 150 transition count 159
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 158 place count 150 transition count 159
Deduced a syphon composed of 53 places in 0 ms
Applied a total of 158 rules in 19 ms. Remains 150 /185 variables (removed 35) and now considering 159/194 (removed 35) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 16:15:59] [INFO ] Redundant transitions in 4 ms returned []
Running 155 sub problems to find dead transitions.
// Phase 1: matrix 159 rows 150 cols
[2025-06-02 16:15:59] [INFO ] Computed 21 invariants in 1 ms
[2025-06-02 16:15:59] [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/144 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:00] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:00] [INFO ] Deduced a trap composed of 12 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:16:00] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 6 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:00] [INFO ] Deduced a trap composed of 16 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:16:00] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 5 ms to minimize.
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:00] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:00] [INFO ] Deduced a trap composed of 3 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:16:00] [INFO ] Deduced a trap composed of 17 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:16:00] [INFO ] Deduced a trap composed of 10 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:16:00] [INFO ] Deduced a trap composed of 16 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:16:00] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 3 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:00] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 2 ms to minimize.
Problem TDEAD63 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:00] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD73 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:00] [INFO ] Deduced a trap composed of 15 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:16:00] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 3 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:01] [INFO ] Deduced a trap composed of 21 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:16:01] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 3 ms to minimize.
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:01] [INFO ] Deduced a trap composed of 20 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:16:01] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 19/33 constraints. Problems are: Problem set: 28 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:01] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:01] [INFO ] Deduced a trap composed of 10 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:16:01] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:01] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 4/37 constraints. Problems are: Problem set: 28 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/37 constraints. Problems are: Problem set: 28 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 5/149 variables, 5/42 constraints. Problems are: Problem set: 28 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 1/43 constraints. Problems are: Problem set: 28 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:02] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:02] [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:16:02] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:03] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:03] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 5 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:03] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:03] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:03] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:03] [INFO ] Deduced a trap composed of 16 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:16:03] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 3 ms to minimize.
Problem TDEAD51 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:03] [INFO ] Deduced a trap composed of 5 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:16:03] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 2 ms to minimize.
Problem TDEAD54 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:03] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 3 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD80 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:03] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:03] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 2 ms to minimize.
Problem TDEAD111 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 15/58 constraints. Problems are: Problem set: 53 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:04] [INFO ] Deduced a trap composed of 3 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:16:04] [INFO ] Deduced a trap composed of 4 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:16:04] [INFO ] Deduced a trap composed of 19 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 16:16:04] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 4/62 constraints. Problems are: Problem set: 53 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:04] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 1/63 constraints. Problems are: Problem set: 53 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:05] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 1/64 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/64 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 1/150 variables, 1/65 constraints. Problems are: Problem set: 53 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:06] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/150 variables, 1/66 constraints. Problems are: Problem set: 53 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:16:07] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/150 variables, 1/67 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/150 variables, 0/67 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 15 (OVERLAPS) 159/309 variables, 150/217 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/309 variables, 68/285 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/309 variables, 0/285 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 18 (OVERLAPS) 0/309 variables, 0/285 constraints. Problems are: Problem set: 53 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 285 constraints, problems are : Problem set: 53 solved, 102 unsolved in 12983 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 150/150 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 53 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 10/10 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 37/47 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/47 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 58/149 variables, 9/56 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 1/57 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 9/66 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/66 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/150 variables, 1/67 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/67 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 159/309 variables, 150/217 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 68/285 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 102/387 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/309 variables, 0/387 constraints. Problems are: Problem set: 53 solved, 102 unsolved
At refinement iteration 13 (OVERLAPS) 0/309 variables, 0/387 constraints. Problems are: Problem set: 53 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 387 constraints, problems are : Problem set: 53 solved, 102 unsolved in 10551 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 150/150 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 102/155 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23545ms problems are : Problem set: 53 solved, 102 unsolved
Search for dead transitions found 53 dead transitions in 23546ms
Found 53 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 53 transitions
Dead transitions reduction (with SMT) removed 53 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 150/185 places, 106/194 transitions.
Graph (complete) has 311 edges and 150 vertex of which 97 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.2 ms
Discarding 53 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 97 transition count 106
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 97 transition count 106
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 4 rules in 14 ms. Remains 97 /150 variables (removed 53) and now considering 106/106 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/185 places, 106/194 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 23587 ms. Remains : 97/185 places, 106/194 transitions.
Built C files in :
/tmp/ltsmin17473355400673869313
[2025-06-02 16:16:23] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17473355400673869313
Running compilation step : cd /tmp/ltsmin17473355400673869313;'/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 294 ms.
Running link step : cd /tmp/ltsmin17473355400673869313;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin17473355400673869313;'/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/stateBased5381183550514595562.hoa' '--buchi-type=spotba'
LTSmin run took 257 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-4-LTLCardinality-12 finished in 77447 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)&&(p1||X(X(p2))))))'
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 187 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 187 transition count 194
Applied a total of 4 rules in 6 ms. Remains 187 /189 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 187 cols
[2025-06-02 16:16:23] [INFO ] Computed 23 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:23] [INFO ] Implicit Places using invariants in 87 ms returned [16, 59, 134]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 88 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 194/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 184/189 places, 194/196 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-13
Product exploration explored 100000 steps with 437 reset in 102 ms.
Stack based approach found an accepted trace after 778 steps with 4 reset with depth 376 and stack size 376 in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLCardinality-13 finished in 459 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 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 196/196 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 162
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 155 transition count 162
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 68 place count 155 transition count 149
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 94 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 141 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 141 transition count 148
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 188 place count 95 transition count 102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 192 place count 93 transition count 100
Applied a total of 192 rules in 15 ms. Remains 93 /189 variables (removed 96) and now considering 100/196 (removed 96) transitions.
// Phase 1: matrix 100 rows 93 cols
[2025-06-02 16:16:24] [INFO ] Computed 23 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:24] [INFO ] Implicit Places using invariants in 80 ms returned [8, 31, 67]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 80 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/189 places, 100/196 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 90 transition count 99
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 89 transition count 99
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 85 transition count 95
Applied a total of 10 rules in 4 ms. Remains 85 /90 variables (removed 5) and now considering 95/100 (removed 5) transitions.
// Phase 1: matrix 95 rows 85 cols
[2025-06-02 16:16:24] [INFO ] Computed 20 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:24] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-02 16:16:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:16:24] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-02 16:16:24] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/189 places, 95/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 306 ms. Remains : 85/189 places, 95/196 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-15
Product exploration explored 100000 steps with 663 reset in 130 ms.
Stack based approach found an accepted trace after 213 steps with 0 reset with depth 214 and stack size 214 in 0 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLCardinality-15 finished in 517 ms.
All properties solved by simple procedures.
Total runtime 294895 ms.
BK_STOP 1748880984933
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-4"
export BK_EXAMINATION="LTLCardinality"
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-4, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-tall-174876812500387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-4.tgz
mv ParamProductionCell-PT-4 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;