About the Execution of ITS-Tools for StigmergyElection-PT-10a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1076209.00 | 0.00 | 0.00 | FTFFFFTFFTFTFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r226-smll-174903491100292.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 StigmergyElection-PT-10a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903491100292
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 50M May 29 14:33 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 StigmergyElection-PT-10a-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-10a-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-10a-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-10a-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-10a-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-10a-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-10a-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-10a-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-10a-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-10a-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-10a-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-10a-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-10a-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-10a-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-10a-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-10a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749188365275
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-06 05:39:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 05:39:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 05:39:31] [INFO ] Load time of PNML (sax parser for PT used): 3164 ms
[2025-06-06 05:39:31] [INFO ] Transformed 142 places.
[2025-06-06 05:39:31] [INFO ] Transformed 50162 transitions.
[2025-06-06 05:39:31] [INFO ] Found NUPN structural information;
[2025-06-06 05:39:31] [INFO ] Parsed PT model containing 142 places and 50162 transitions and 999212 arcs in 3741 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
FORMULA StigmergyElection-PT-10a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 2238/2238 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 123 transition count 2209
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 123 transition count 2209
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 48 place count 113 transition count 2189
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 113 transition count 2189
Applied a total of 58 rules in 109 ms. Remains 113 /142 variables (removed 29) and now considering 2189/2238 (removed 49) transitions.
[2025-06-06 05:39:32] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
// Phase 1: matrix 2178 rows 113 cols
[2025-06-06 05:39:32] [INFO ] Computed 2 invariants in 90 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:39:32] [INFO ] Implicit Places using invariants in 509 ms returned []
[2025-06-06 05:39:32] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2025-06-06 05:39:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:39:34] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2025-06-06 05:39:35] [INFO ] Implicit Places using invariants and state equation in 2939 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3524 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/142 places, 2189/2238 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 92 transition count 2169
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 92 transition count 2169
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 82 transition count 2159
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 82 transition count 2159
Applied a total of 60 rules in 58 ms. Remains 82 /112 variables (removed 30) and now considering 2159/2189 (removed 30) transitions.
[2025-06-06 05:39:36] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
// Phase 1: matrix 2148 rows 82 cols
[2025-06-06 05:39:36] [INFO ] Computed 1 invariants in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:39:36] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-06 05:39:36] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2025-06-06 05:39:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:39:38] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2025-06-06 05:39:38] [INFO ] Implicit Places using invariants and state equation in 2396 ms returned []
Implicit Place search using SMT with State Equation took 2490 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 82/142 places, 2159/2238 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6216 ms. Remains : 82/142 places, 2159/2238 transitions.
Support contains 10 out of 82 places after structural reductions.
[2025-06-06 05:39:39] [INFO ] Flatten gal took : 569 ms
[2025-06-06 05:39:39] [INFO ] Flatten gal took : 237 ms
[2025-06-06 05:39:40] [INFO ] Input system was already deterministic with 2159 transitions.
RANDOM walk for 40000 steps (14 resets) in 8192 ms. (4 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 197 ms. (202 steps per ms) remains 1/1 properties
[2025-06-06 05:39:42] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2025-06-06 05:39:42] [INFO ] Invariant cache hit.
[2025-06-06 05:39:42] [INFO ] State equation strengthened by 2055 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 10/2230 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/82 constraints, ReadFeed: 0/2055 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 457ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA StigmergyElection-PT-10a-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA StigmergyElection-PT-10a-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA StigmergyElection-PT-10a-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!F(p0) U X(!X(p0)))) U p0))'
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Applied a total of 0 rules in 13 ms. Remains 82 /82 variables (removed 0) and now considering 2159/2159 (removed 0) transitions.
[2025-06-06 05:39:43] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2025-06-06 05:39:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:39:43] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-06 05:39:43] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2025-06-06 05:39:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:39:44] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2025-06-06 05:39:44] [INFO ] Implicit Places using invariants and state equation in 1203 ms returned []
Implicit Place search using SMT with State Equation took 1252 ms to find 0 implicit places.
Running 2158 sub problems to find dead transitions.
[2025-06-06 05:39:44] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2025-06-06 05:39:44] [INFO ] Invariant cache hit.
[2025-06-06 05:39:46] [INFO ] State equation strengthened by 2055 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 82/2230 variables, and 1 constraints, problems are : Problem set: 0 solved, 2158 unsolved in 30149 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/82 constraints, ReadFeed: 0/2055 constraints, PredecessorRefiner: 2158/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2158 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:40:44] [INFO ] Deduced a trap composed of 9 places in 1065 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:40:45] [INFO ] Deduced a trap composed of 9 places in 924 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:40:46] [INFO ] Deduced a trap composed of 9 places in 826 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:40:47] [INFO ] Deduced a trap composed of 9 places in 1050 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:40:48] [INFO ] Deduced a trap composed of 9 places in 858 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:40:49] [INFO ] Deduced a trap composed of 9 places in 1243 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:40:50] [INFO ] Deduced a trap composed of 9 places in 1136 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:40:51] [INFO ] Deduced a trap composed of 9 places in 945 ms of which 48 ms to minimize.
SMT process timed out in 66825ms, After SMT, problems are : Problem set: 0 solved, 2158 unsolved
Search for dead transitions found 0 dead transitions in 66903ms
Finished structural reductions in LTL mode , in 1 iterations and 68207 ms. Remains : 82/82 places, 2159/2159 transitions.
Stuttering acceptance computed with spot in 412 ms :[(NOT p0), true, p0, p0, true]
Running random walk in product with property : StigmergyElection-PT-10a-LTLFireability-00
Product exploration explored 100000 steps with 20062 reset in 1306 ms.
Product exploration explored 100000 steps with 19984 reset in 702 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be false thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-10a-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-10a-LTLFireability-00 finished in 70848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0&&X(X(X(p0)))))))'
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Applied a total of 0 rules in 11 ms. Remains 82 /82 variables (removed 0) and now considering 2159/2159 (removed 0) transitions.
[2025-06-06 05:40:54] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2025-06-06 05:40:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:40:54] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-06 05:40:54] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2025-06-06 05:40:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:40:54] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2025-06-06 05:40:55] [INFO ] Implicit Places using invariants and state equation in 1168 ms returned []
Implicit Place search using SMT with State Equation took 1208 ms to find 0 implicit places.
Running 2158 sub problems to find dead transitions.
[2025-06-06 05:40:55] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2025-06-06 05:40:55] [INFO ] Invariant cache hit.
[2025-06-06 05:40:55] [INFO ] State equation strengthened by 2055 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
SMT process timed out in 34876ms, After SMT, problems are : Problem set: 0 solved, 2158 unsolved
Search for dead transitions found 0 dead transitions in 34894ms
Finished structural reductions in LTL mode , in 1 iterations and 36123 ms. Remains : 82/82 places, 2159/2159 transitions.
Stuttering acceptance computed with spot in 465 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true, true]
Running random walk in product with property : StigmergyElection-PT-10a-LTLFireability-01
Product exploration explored 100000 steps with 4545 reset in 3896 ms.
Product exploration explored 100000 steps with 4545 reset in 3528 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 9 states, 13 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 84 steps (0 resets) in 9 ms. (8 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 95 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-06 05:41:39] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2025-06-06 05:41:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 05:41:42] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2025-06-06 05:41:42] [INFO ] [Real]Absence check using state equation in 774 ms returned sat
[2025-06-06 05:41:44] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2025-06-06 05:41:44] [INFO ] [Real]Added 2055 Read/Feed constraints in 424 ms returned sat
[2025-06-06 05:41:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 05:41:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2025-06-06 05:41:47] [INFO ] [Nat]Absence check using state equation in 853 ms returned sat
[2025-06-06 05:41:48] [INFO ] [Nat]Added 2055 Read/Feed constraints in 534 ms returned sat
[2025-06-06 05:41:49] [INFO ] Computed and/alt/rep : 70/80/70 causal constraints (skipped 2077 transitions) in 1069 ms.
[2025-06-06 05:41:51] [INFO ] Added : 39 causal constraints over 8 iterations in 3001 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Applied a total of 0 rules in 14 ms. Remains 82 /82 variables (removed 0) and now considering 2159/2159 (removed 0) transitions.
[2025-06-06 05:41:51] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2025-06-06 05:41:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:41:51] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-06 05:41:51] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2025-06-06 05:41:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:41:52] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2025-06-06 05:41:52] [INFO ] Implicit Places using invariants and state equation in 1326 ms returned []
Implicit Place search using SMT with State Equation took 1389 ms to find 0 implicit places.
Running 2158 sub problems to find dead transitions.
[2025-06-06 05:41:52] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2025-06-06 05:41:52] [INFO ] Invariant cache hit.
[2025-06-06 05:41:53] [INFO ] State equation strengthened by 2055 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 82/2230 variables, and 1 constraints, problems are : Problem set: 0 solved, 2158 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/82 constraints, ReadFeed: 0/2055 constraints, PredecessorRefiner: 2158/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2158 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:42:49] [INFO ] Deduced a trap composed of 9 places in 861 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:42:50] [INFO ] Deduced a trap composed of 9 places in 860 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:42:51] [INFO ] Deduced a trap composed of 9 places in 1207 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:42:53] [INFO ] Deduced a trap composed of 9 places in 1556 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:42:54] [INFO ] Deduced a trap composed of 9 places in 1211 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:42:55] [INFO ] Deduced a trap composed of 9 places in 1040 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:42:56] [INFO ] Deduced a trap composed of 9 places in 1080 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:42:58] [INFO ] Deduced a trap composed of 9 places in 1301 ms of which 74 ms to minimize.
SMT process timed out in 65196ms, After SMT, problems are : Problem set: 0 solved, 2158 unsolved
Search for dead transitions found 0 dead transitions in 65214ms
Finished structural reductions in LTL mode , in 1 iterations and 66629 ms. Remains : 82/82 places, 2159/2159 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 348 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 84 steps (0 resets) in 12 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-06 05:42:59] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2025-06-06 05:42:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 05:43:01] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-06 05:43:02] [INFO ] [Real]Absence check using state equation in 669 ms returned sat
[2025-06-06 05:43:02] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2025-06-06 05:43:03] [INFO ] [Real]Added 2055 Read/Feed constraints in 403 ms returned sat
[2025-06-06 05:43:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 05:43:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-06 05:43:06] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2025-06-06 05:43:06] [INFO ] [Nat]Added 2055 Read/Feed constraints in 455 ms returned sat
[2025-06-06 05:43:07] [INFO ] Computed and/alt/rep : 70/80/70 causal constraints (skipped 2077 transitions) in 770 ms.
[2025-06-06 05:43:08] [INFO ] Added : 39 causal constraints over 8 iterations in 1920 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4545 reset in 3970 ms.
Product exploration explored 100000 steps with 4545 reset in 3644 ms.
Applying partial POR strategy [false, false, false, false, true, false, false]
Stuttering acceptance computed with spot in 348 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 82 transition count 2169
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 82 transition count 2169
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 40 places in 3 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 82 transition count 2179
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 0 with 1023 rules applied. Total rules applied 1063 place count 82 transition count 1156
Deduced a syphon composed of 40 places in 2 ms
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 1 with 20 rules applied. Total rules applied 1083 place count 82 transition count 1136
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 1093 place count 82 transition count 1136
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 1113 place count 62 transition count 1116
Deduced a syphon composed of 30 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 1133 place count 62 transition count 1116
Deduced a syphon composed of 30 places in 1 ms
Applied a total of 1133 rules in 1501 ms. Remains 62 /82 variables (removed 20) and now considering 1116/2159 (removed 1043) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 05:43:18] [INFO ] Redundant transitions in 166 ms returned []
Running 1115 sub problems to find dead transitions.
[2025-06-06 05:43:18] [INFO ] Flow matrix only has 1105 transitions (discarded 11 similar events)
// Phase 1: matrix 1105 rows 62 cols
[2025-06-06 05:43:18] [INFO ] Computed 1 invariants in 8 ms
[2025-06-06 05:43:18] [INFO ] State equation strengthened by 1043 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:33] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:33] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:33] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:34] [INFO ] Deduced a trap composed of 5 places in 460 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:34] [INFO ] Deduced a trap composed of 5 places in 459 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:35] [INFO ] Deduced a trap composed of 5 places in 458 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:35] [INFO ] Deduced a trap composed of 5 places in 345 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:35] [INFO ] Deduced a trap composed of 5 places in 355 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:36] [INFO ] Deduced a trap composed of 5 places in 302 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:36] [INFO ] Deduced a trap composed of 5 places in 370 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:36] [INFO ] Deduced a trap composed of 5 places in 353 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:37] [INFO ] Deduced a trap composed of 5 places in 420 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:37] [INFO ] Deduced a trap composed of 5 places in 333 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:38] [INFO ] Deduced a trap composed of 5 places in 365 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:38] [INFO ] Deduced a trap composed of 5 places in 373 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:38] [INFO ] Deduced a trap composed of 5 places in 374 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:39] [INFO ] Deduced a trap composed of 5 places in 435 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:39] [INFO ] Deduced a trap composed of 5 places in 385 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:39] [INFO ] Deduced a trap composed of 5 places in 363 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:40] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:41] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:41] [INFO ] Deduced a trap composed of 5 places in 829 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:42] [INFO ] Deduced a trap composed of 5 places in 748 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:43] [INFO ] Deduced a trap composed of 5 places in 809 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:44] [INFO ] Deduced a trap composed of 5 places in 607 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:44] [INFO ] Deduced a trap composed of 5 places in 613 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:45] [INFO ] Deduced a trap composed of 5 places in 562 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:45] [INFO ] Deduced a trap composed of 5 places in 461 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:46] [INFO ] Deduced a trap composed of 5 places in 452 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:46] [INFO ] Deduced a trap composed of 5 places in 585 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:47] [INFO ] Deduced a trap composed of 5 places in 494 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:47] [INFO ] Deduced a trap composed of 5 places in 436 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:48] [INFO ] Deduced a trap composed of 5 places in 374 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:48] [INFO ] Deduced a trap composed of 5 places in 366 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:48] [INFO ] Deduced a trap composed of 5 places in 301 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:49] [INFO ] Deduced a trap composed of 5 places in 395 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:49] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:49] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:49] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:50] [INFO ] Deduced a trap composed of 5 places in 356 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 62/1167 variables, and 41 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/62 constraints, ReadFeed: 0/1043 constraints, PredecessorRefiner: 1115/51 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:57] [INFO ] Deduced a trap composed of 5 places in 382 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:58] [INFO ] Deduced a trap composed of 5 places in 307 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:58] [INFO ] Deduced a trap composed of 5 places in 312 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:58] [INFO ] Deduced a trap composed of 5 places in 296 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:59] [INFO ] Deduced a trap composed of 5 places in 366 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:59] [INFO ] Deduced a trap composed of 5 places in 300 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:59] [INFO ] Deduced a trap composed of 5 places in 289 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:59] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:00] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:00] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:00] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:00] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:01] [INFO ] Deduced a trap composed of 5 places in 296 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:01] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:01] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:01] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:01] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:02] [INFO ] Deduced a trap composed of 5 places in 367 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:02] [INFO ] Deduced a trap composed of 5 places in 300 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:03] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:04] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:04] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:04] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:05] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:05] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:05] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:05] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 5 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:07] [INFO ] Deduced a trap composed of 5 places in 426 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:08] [INFO ] Deduced a trap composed of 5 places in 411 ms of which 12 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:10] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:10] [INFO ] Deduced a trap composed of 5 places in 288 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:10] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:10] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:10] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:11] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:11] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 5 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:12] [INFO ] Deduced a trap composed of 5 places in 584 ms of which 22 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 62/1167 variables, and 78 constraints, problems are : Problem set: 40 solved, 1075 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/62 constraints, ReadFeed: 0/1043 constraints, PredecessorRefiner: 1064/51 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62090ms problems are : Problem set: 40 solved, 1075 unsolved
Search for dead transitions found 40 dead transitions in 62095ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 62/82 places, 1076/2159 transitions.
Graph (complete) has 351 edges and 62 vertex of which 32 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.12 ms
Discarding 30 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 408 ms. Remains 32 /62 variables (removed 30) and now considering 1076/1076 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/82 places, 1076/2159 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 64184 ms. Remains : 32/82 places, 1076/2159 transitions.
Built C files in :
/tmp/ltsmin8549042482945515959
[2025-06-06 05:44:21] [INFO ] Built C files in 176ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8549042482945515959
Running compilation step : cd /tmp/ltsmin8549042482945515959;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8549042482945515959;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8549042482945515959;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Applied a total of 0 rules in 9 ms. Remains 82 /82 variables (removed 0) and now considering 2159/2159 (removed 0) transitions.
[2025-06-06 05:44:24] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
// Phase 1: matrix 2148 rows 82 cols
[2025-06-06 05:44:24] [INFO ] Computed 1 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:44:24] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-06 05:44:24] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2025-06-06 05:44:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:44:25] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2025-06-06 05:44:25] [INFO ] Implicit Places using invariants and state equation in 1343 ms returned []
Implicit Place search using SMT with State Equation took 1401 ms to find 0 implicit places.
Running 2158 sub problems to find dead transitions.
[2025-06-06 05:44:25] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2025-06-06 05:44:25] [INFO ] Invariant cache hit.
[2025-06-06 05:44:26] [INFO ] State equation strengthened by 2055 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:59] [INFO ] Deduced a trap composed of 9 places in 1114 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:00] [INFO ] Deduced a trap composed of 9 places in 1127 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:00] [INFO ] Deduced a trap composed of 9 places in 781 ms of which 20 ms to minimize.
SMT process timed out in 34941ms, After SMT, problems are : Problem set: 0 solved, 2158 unsolved
Search for dead transitions found 0 dead transitions in 34957ms
Finished structural reductions in LTL mode , in 1 iterations and 36375 ms. Remains : 82/82 places, 2159/2159 transitions.
Built C files in :
/tmp/ltsmin18283881084175871136
[2025-06-06 05:45:01] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18283881084175871136
Running compilation step : cd /tmp/ltsmin18283881084175871136;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18283881084175871136;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18283881084175871136;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-06 05:45:04] [INFO ] Flatten gal took : 244 ms
[2025-06-06 05:45:04] [INFO ] Flatten gal took : 169 ms
[2025-06-06 05:45:05] [INFO ] Time to serialize gal into /tmp/LTL13917025395599634993.gal : 82 ms
[2025-06-06 05:45:05] [INFO ] Time to serialize properties into /tmp/LTL16061452264615083621.prop : 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/LTL13917025395599634993.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11020670562642836084.hoa' '-atoms' '/tmp/LTL16061452264615083621.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...320
Loading property file /tmp/LTL16061452264615083621.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11020670562642836084.hoa
Detected timeout of ITS tools.
[2025-06-06 05:45:20] [INFO ] Flatten gal took : 148 ms
[2025-06-06 05:45:20] [INFO ] Flatten gal took : 139 ms
[2025-06-06 05:45:20] [INFO ] Time to serialize gal into /tmp/LTL370411587339520132.gal : 30 ms
[2025-06-06 05:45:20] [INFO ] Time to serialize properties into /tmp/LTL6358317655015449936.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/LTL370411587339520132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6358317655015449936.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...274
Read 1 LTL properties
Checking formula 0 : !((X(F((X(X(X("(((((p12==1)&&(p26==1))&&((p40==1)&&(p54==1)))&&(((p68==1)&&(p82==1))&&((p96==1)&&(p110==1))))&&((p124==1)&&(p138==1)))...289
Formula 0 simplified : XG(!"(((((p12!=1)||(p26!=1))||((p40!=1)||(p54!=1)))||(((p68!=1)||(p82!=1))||((p96!=1)||(p110!=1))))||((p124!=1)||(p138!=1)))" | XXX!...277
Detected timeout of ITS tools.
[2025-06-06 05:45:35] [INFO ] Flatten gal took : 167 ms
[2025-06-06 05:45:35] [INFO ] Applying decomposition
[2025-06-06 05:45:35] [INFO ] Flatten gal took : 127 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/graph1283973059680762882.txt' '-o' '/tmp/graph1283973059680762882.bin' '-w' '/tmp/graph1283973059680762882.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1283973059680762882.bin' '-l' '-1' '-v' '-w' '/tmp/graph1283973059680762882.weights' '-q' '0' '-e' '0.001'
[2025-06-06 05:45:36] [INFO ] Decomposing Gal with order
[2025-06-06 05:45:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 05:45:37] [INFO ] Removed a total of 20539 redundant transitions.
[2025-06-06 05:45:38] [INFO ] Flatten gal took : 906 ms
[2025-06-06 05:45:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 339 ms.
[2025-06-06 05:45:38] [INFO ] Time to serialize gal into /tmp/LTL8446532788214410796.gal : 60 ms
[2025-06-06 05:45:38] [INFO ] Time to serialize properties into /tmp/LTL11670481351340239894.ltl : 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/LTL8446532788214410796.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11670481351340239894.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 : !((X(F((X(X(X("(((((i3.u19.p12==1)&&(i2.i1.u7.p26==1))&&((i3.u1.p40==1)&&(i1.i0.u27.p54==1)))&&(((i1.i1.u12.p68==1)&&(u15.p82==1))&&((...451
Formula 0 simplified : XG(!"(((((i3.u19.p12!=1)||(i2.i1.u7.p26!=1))||((i3.u1.p40!=1)||(i1.i0.u27.p54!=1)))||(((i1.i1.u12.p68!=1)||(u15.p82!=1))||((i5.i1.u2...439
Reverse transition relation is NOT exact ! Due to transitions t2139, t2141, t2143, t2145, t2147, t2149, t2151, t2153, t2155, t2157, u15.t23, u15.t24, i0.t4...538
22 unique states visited
0 strongly connected components in search stack
21 transitions explored
22 items max in DFS search stack
423 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,4.66251,124656,1,0,250677,278,29776,268669,219,847,720613
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA StigmergyElection-PT-10a-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property StigmergyElection-PT-10a-LTLFireability-01 finished in 289523 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 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 81 transition count 2138
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 61 transition count 2138
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 41 transition count 2118
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 0 with 1023 rules applied. Total rules applied 1103 place count 41 transition count 1095
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 1113 place count 41 transition count 1085
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 1133 place count 31 transition count 1075
Applied a total of 1133 rules in 844 ms. Remains 31 /82 variables (removed 51) and now considering 1075/2159 (removed 1084) transitions.
[2025-06-06 05:45:44] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2025-06-06 05:45:44] [INFO ] Computed 1 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:45:44] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 05:45:44] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:45:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:45:45] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-06 05:45:45] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 05:45:45] [INFO ] Redundant transitions in 104 ms returned []
Running 1065 sub problems to find dead transitions.
[2025-06-06 05:45:45] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:45:45] [INFO ] Invariant cache hit.
[2025-06-06 05:45:45] [INFO ] State equation strengthened by 1043 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:55] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:55] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:56] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:56] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:56] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:56] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:56] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:57] [INFO ] Deduced a trap composed of 4 places in 361 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:57] [INFO ] Deduced a trap composed of 4 places in 365 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:58] [INFO ] Deduced a trap composed of 4 places in 708 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:58] [INFO ] Deduced a trap composed of 4 places in 576 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:59] [INFO ] Deduced a trap composed of 4 places in 539 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:59] [INFO ] Deduced a trap composed of 4 places in 464 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:00] [INFO ] Deduced a trap composed of 4 places in 401 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:00] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:00] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:01] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:01] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:01] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:01] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:02] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:02] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:02] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:03] [INFO ] Deduced a trap composed of 4 places in 638 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:04] [INFO ] Deduced a trap composed of 4 places in 534 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:04] [INFO ] Deduced a trap composed of 4 places in 390 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:04] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:05] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:05] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:12] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:13] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:13] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:13] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 31/1095 variables, and 34 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/31 constraints, ReadFeed: 0/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:22] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:22] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:22] [INFO ] Deduced a trap composed of 4 places in 485 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:23] [INFO ] Deduced a trap composed of 4 places in 412 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:23] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:23] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:24] [INFO ] Deduced a trap composed of 4 places in 437 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:24] [INFO ] Deduced a trap composed of 4 places in 379 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:25] [INFO ] Deduced a trap composed of 4 places in 299 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:30] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:35] [INFO ] Deduced a trap composed of 4 places in 272 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:35] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:46:35] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
SMT process timed out in 62039ms, After SMT, problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 62044ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/82 places, 1075/2159 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63768 ms. Remains : 31/82 places, 1075/2159 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLFireability-05
Stuttering criterion allowed to conclude after 14718 steps with 1337 reset in 1038 ms.
FORMULA StigmergyElection-PT-10a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLFireability-05 finished in 64937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 81 transition count 2138
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 61 transition count 2138
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 41 transition count 2118
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 0 with 1023 rules applied. Total rules applied 1103 place count 41 transition count 1095
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 1113 place count 41 transition count 1085
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 1133 place count 31 transition count 1075
Applied a total of 1133 rules in 806 ms. Remains 31 /82 variables (removed 51) and now considering 1075/2159 (removed 1084) transitions.
[2025-06-06 05:46:49] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:46:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:46:49] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-06 05:46:49] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:46:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:46:49] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-06 05:46:49] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 05:46:50] [INFO ] Redundant transitions in 99 ms returned []
Running 1065 sub problems to find dead transitions.
[2025-06-06 05:46:50] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:46:50] [INFO ] Invariant cache hit.
[2025-06-06 05:46:50] [INFO ] State equation strengthened by 1043 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:01] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:01] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:01] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:01] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:01] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:01] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:01] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:02] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:02] [INFO ] Deduced a trap composed of 4 places in 322 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:03] [INFO ] Deduced a trap composed of 4 places in 633 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:03] [INFO ] Deduced a trap composed of 4 places in 492 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:04] [INFO ] Deduced a trap composed of 4 places in 486 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:04] [INFO ] Deduced a trap composed of 4 places in 433 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:05] [INFO ] Deduced a trap composed of 4 places in 344 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:05] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:05] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:05] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:06] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:06] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:06] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:07] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:07] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:07] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:08] [INFO ] Deduced a trap composed of 4 places in 636 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:08] [INFO ] Deduced a trap composed of 4 places in 539 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:09] [INFO ] Deduced a trap composed of 4 places in 410 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:09] [INFO ] Deduced a trap composed of 4 places in 331 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:09] [INFO ] Deduced a trap composed of 4 places in 322 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:09] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:17] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:17] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:17] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:18] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 31/1095 variables, and 34 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/31 constraints, ReadFeed: 0/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:26] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:26] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:27] [INFO ] Deduced a trap composed of 4 places in 503 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:27] [INFO ] Deduced a trap composed of 4 places in 445 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:28] [INFO ] Deduced a trap composed of 4 places in 363 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:28] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:28] [INFO ] Deduced a trap composed of 4 places in 395 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:29] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:29] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:34] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:39] [INFO ] Deduced a trap composed of 4 places in 417 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:39] [INFO ] Deduced a trap composed of 4 places in 362 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:40] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
SMT process timed out in 62020ms, After SMT, problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 62025ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/82 places, 1075/2159 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63435 ms. Remains : 31/82 places, 1075/2159 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLFireability-09
Product exploration explored 100000 steps with 9090 reset in 4454 ms.
Product exploration explored 100000 steps with 9090 reset in 4576 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 75 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 40 steps (0 resets) in 7 ms. (5 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 90 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2025-06-06 05:48:01] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:48:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 05:48:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-06 05:48:02] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2025-06-06 05:48:03] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-06 05:48:03] [INFO ] [Real]Added 1043 Read/Feed constraints in 251 ms returned sat
[2025-06-06 05:48:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 05:48:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-06 05:48:04] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2025-06-06 05:48:05] [INFO ] [Nat]Added 1043 Read/Feed constraints in 281 ms returned sat
[2025-06-06 05:48:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1054 transitions) in 203 ms.
[2025-06-06 05:48:05] [INFO ] Added : 0 causal constraints over 0 iterations in 339 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 1075/1075 transitions.
Applied a total of 0 rules in 337 ms. Remains 31 /31 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
[2025-06-06 05:48:05] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:48:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:48:05] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-06 05:48:05] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:48:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:48:06] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-06 05:48:06] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 05:48:06] [INFO ] Redundant transitions in 89 ms returned []
Running 1065 sub problems to find dead transitions.
[2025-06-06 05:48:06] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:48:06] [INFO ] Invariant cache hit.
[2025-06-06 05:48:06] [INFO ] State equation strengthened by 1043 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:17] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:17] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:17] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:17] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:17] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:17] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:18] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:18] [INFO ] Deduced a trap composed of 4 places in 344 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:18] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:19] [INFO ] Deduced a trap composed of 4 places in 633 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:19] [INFO ] Deduced a trap composed of 4 places in 512 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:20] [INFO ] Deduced a trap composed of 4 places in 504 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:20] [INFO ] Deduced a trap composed of 4 places in 446 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:21] [INFO ] Deduced a trap composed of 4 places in 429 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:21] [INFO ] Deduced a trap composed of 4 places in 350 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:21] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:22] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:22] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:22] [INFO ] Deduced a trap composed of 4 places in 346 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:22] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:23] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:23] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:23] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:24] [INFO ] Deduced a trap composed of 4 places in 610 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:24] [INFO ] Deduced a trap composed of 4 places in 514 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:25] [INFO ] Deduced a trap composed of 4 places in 402 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:25] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:25] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:26] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:33] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:33] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:34] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:34] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 31/1095 variables, and 34 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/31 constraints, ReadFeed: 0/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:42] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:43] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:43] [INFO ] Deduced a trap composed of 4 places in 515 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:44] [INFO ] Deduced a trap composed of 4 places in 434 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:44] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:44] [INFO ] Deduced a trap composed of 4 places in 325 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:45] [INFO ] Deduced a trap composed of 4 places in 403 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:45] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:45] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:50] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:55] [INFO ] Deduced a trap composed of 4 places in 413 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:56] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:48:56] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
SMT process timed out in 61812ms, After SMT, problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 61816ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62812 ms. Remains : 31/31 places, 1075/1075 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 104 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
RANDOM walk for 40 steps (0 resets) in 9 ms. (4 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 127 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2025-06-06 05:49:08] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:49:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 05:49:10] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-06 05:49:10] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2025-06-06 05:49:11] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-06 05:49:11] [INFO ] [Real]Added 1043 Read/Feed constraints in 254 ms returned sat
[2025-06-06 05:49:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 05:49:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-06 05:49:13] [INFO ] [Nat]Absence check using state equation in 420 ms returned sat
[2025-06-06 05:49:13] [INFO ] [Nat]Added 1043 Read/Feed constraints in 288 ms returned sat
[2025-06-06 05:49:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1054 transitions) in 190 ms.
[2025-06-06 05:49:13] [INFO ] Added : 0 causal constraints over 0 iterations in 324 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 9090 reset in 4443 ms.
Product exploration explored 100000 steps with 9090 reset in 4388 ms.
Built C files in :
/tmp/ltsmin12184035482883349943
[2025-06-06 05:49:22] [INFO ] Computing symmetric may disable matrix : 1075 transitions.
[2025-06-06 05:49:23] [INFO ] Computation of Complete disable matrix. took 486 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 05:49:23] [INFO ] Computing symmetric may enable matrix : 1075 transitions.
[2025-06-06 05:49:23] [INFO ] Computation of Complete enable matrix. took 80 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 05:49:23] [INFO ] Computing Do-Not-Accords matrix : 1075 transitions.
[2025-06-06 05:49:24] [INFO ] Computation of Completed DNA matrix. took 111 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 05:49:24] [INFO ] Built C files in 1301ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12184035482883349943
Running compilation step : cd /tmp/ltsmin12184035482883349943;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12184035482883349943;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12184035482883349943;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 10 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 1075/1075 transitions.
Applied a total of 0 rules in 348 ms. Remains 31 /31 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
[2025-06-06 05:49:27] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:49:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:49:27] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-06 05:49:27] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:49:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:49:27] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-06 05:49:28] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 05:49:28] [INFO ] Redundant transitions in 141 ms returned []
Running 1065 sub problems to find dead transitions.
[2025-06-06 05:49:28] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:49:28] [INFO ] Invariant cache hit.
[2025-06-06 05:49:28] [INFO ] State equation strengthened by 1043 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:38] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:38] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:38] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:38] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:39] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:39] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:39] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:39] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:40] [INFO ] Deduced a trap composed of 4 places in 325 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:40] [INFO ] Deduced a trap composed of 4 places in 629 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:41] [INFO ] Deduced a trap composed of 4 places in 509 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:41] [INFO ] Deduced a trap composed of 4 places in 462 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:42] [INFO ] Deduced a trap composed of 4 places in 397 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:42] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:42] [INFO ] Deduced a trap composed of 4 places in 327 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:43] [INFO ] Deduced a trap composed of 4 places in 355 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:43] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:43] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:44] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:44] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:44] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:44] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:44] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:45] [INFO ] Deduced a trap composed of 4 places in 479 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:45] [INFO ] Deduced a trap composed of 4 places in 379 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:46] [INFO ] Deduced a trap composed of 4 places in 415 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:46] [INFO ] Deduced a trap composed of 4 places in 322 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:46] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:47] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:53] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:53] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:54] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:54] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 31/1095 variables, and 34 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/31 constraints, ReadFeed: 0/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:50:04] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:50:05] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:50:05] [INFO ] Deduced a trap composed of 4 places in 368 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:50:05] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:50:06] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:50:06] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:50:06] [INFO ] Deduced a trap composed of 4 places in 312 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:50:06] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:50:07] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:50:11] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:50:16] [INFO ] Deduced a trap composed of 4 places in 411 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:50:16] [INFO ] Deduced a trap composed of 4 places in 327 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:50:16] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (OVERLAPS) 1063/1094 variables, 31/78 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 1042/1120 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1095 variables, and 1121 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61939ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 61945ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63135 ms. Remains : 31/31 places, 1075/1075 transitions.
Built C files in :
/tmp/ltsmin3519070853964261059
[2025-06-06 05:50:30] [INFO ] Computing symmetric may disable matrix : 1075 transitions.
[2025-06-06 05:50:31] [INFO ] Computation of Complete disable matrix. took 698 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 05:50:31] [INFO ] Computing symmetric may enable matrix : 1075 transitions.
[2025-06-06 05:50:31] [INFO ] Computation of Complete enable matrix. took 92 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 05:50:31] [INFO ] Computing Do-Not-Accords matrix : 1075 transitions.
[2025-06-06 05:50:31] [INFO ] Computation of Completed DNA matrix. took 136 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 05:50:31] [INFO ] Built C files in 1497ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3519070853964261059
Running compilation step : cd /tmp/ltsmin3519070853964261059;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3519070853964261059;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3519070853964261059;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-06 05:50:35] [INFO ] Flatten gal took : 71 ms
[2025-06-06 05:50:35] [INFO ] Flatten gal took : 71 ms
[2025-06-06 05:50:35] [INFO ] Time to serialize gal into /tmp/LTL1900478015325653184.gal : 17 ms
[2025-06-06 05:50:35] [INFO ] Time to serialize properties into /tmp/LTL13995331081682044186.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/LTL1900478015325653184.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6683716904298245427.hoa' '-atoms' '/tmp/LTL13995331081682044186.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/LTL13995331081682044186.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6683716904298245427.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t18, t23, t28, t33, t38, t43, t48, t66.t2157, t65.t2155, t67.t2153, t64.t2151, t...322
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
771 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,8.46055,139472,1,0,1161,44534,2161,46,43910,27881,2245
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA StigmergyElection-PT-10a-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property StigmergyElection-PT-10a-LTLFireability-09 finished in 235069 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&F(p1)))'
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Applied a total of 0 rules in 9 ms. Remains 82 /82 variables (removed 0) and now considering 2159/2159 (removed 0) transitions.
[2025-06-06 05:50:43] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
// Phase 1: matrix 2148 rows 82 cols
[2025-06-06 05:50:43] [INFO ] Computed 1 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:50:43] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-06 05:50:43] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2025-06-06 05:50:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:50:44] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2025-06-06 05:50:44] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1096 ms to find 0 implicit places.
Running 2158 sub problems to find dead transitions.
[2025-06-06 05:50:44] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2025-06-06 05:50:44] [INFO ] Invariant cache hit.
[2025-06-06 05:50:44] [INFO ] State equation strengthened by 2055 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:11] [INFO ] Deduced a trap composed of 9 places in 813 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:13] [INFO ] Deduced a trap composed of 9 places in 1149 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:14] [INFO ] Deduced a trap composed of 9 places in 886 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:14] [INFO ] Deduced a trap composed of 9 places in 685 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:15] [INFO ] Deduced a trap composed of 9 places in 716 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:16] [INFO ] Deduced a trap composed of 9 places in 701 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:16] [INFO ] Deduced a trap composed of 9 places in 596 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:17] [INFO ] Deduced a trap composed of 9 places in 734 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:18] [INFO ] Deduced a trap composed of 9 places in 1021 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:19] [INFO ] Deduced a trap composed of 9 places in 666 ms of which 17 ms to minimize.
SMT process timed out in 34338ms, After SMT, problems are : Problem set: 0 solved, 2158 unsolved
Search for dead transitions found 0 dead transitions in 34347ms
Finished structural reductions in LTL mode , in 1 iterations and 35460 ms. Remains : 82/82 places, 2159/2159 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : StigmergyElection-PT-10a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-10a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLFireability-10 finished in 35662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&X(p0))))'
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 81 transition count 2138
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 61 transition count 2138
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 41 transition count 2118
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 0 with 1023 rules applied. Total rules applied 1103 place count 41 transition count 1095
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 1113 place count 41 transition count 1085
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 1133 place count 31 transition count 1075
Applied a total of 1133 rules in 655 ms. Remains 31 /82 variables (removed 51) and now considering 1075/2159 (removed 1084) transitions.
[2025-06-06 05:51:20] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2025-06-06 05:51:20] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:51:20] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-06 05:51:20] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:51:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:51:20] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-06 05:51:20] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 05:51:20] [INFO ] Redundant transitions in 102 ms returned []
Running 1065 sub problems to find dead transitions.
[2025-06-06 05:51:20] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:51:20] [INFO ] Invariant cache hit.
[2025-06-06 05:51:20] [INFO ] State equation strengthened by 1043 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:29] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:29] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:29] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:29] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:29] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:29] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:30] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:30] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:30] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:31] [INFO ] Deduced a trap composed of 4 places in 701 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:32] [INFO ] Deduced a trap composed of 4 places in 590 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:32] [INFO ] Deduced a trap composed of 4 places in 537 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:33] [INFO ] Deduced a trap composed of 4 places in 433 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:33] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:33] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:34] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:34] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:34] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:34] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:34] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:35] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:35] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:35] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:36] [INFO ] Deduced a trap composed of 4 places in 614 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:37] [INFO ] Deduced a trap composed of 4 places in 513 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:37] [INFO ] Deduced a trap composed of 4 places in 413 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:37] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:38] [INFO ] Deduced a trap composed of 4 places in 312 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:38] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:45] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:46] [INFO ] Deduced a trap composed of 4 places in 281 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:46] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:46] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 31/1095 variables, and 34 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/31 constraints, ReadFeed: 0/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:57] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:57] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:57] [INFO ] Deduced a trap composed of 4 places in 341 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:58] [INFO ] Deduced a trap composed of 4 places in 390 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:58] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:58] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:59] [INFO ] Deduced a trap composed of 4 places in 371 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:59] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:59] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:04] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:09] [INFO ] Deduced a trap composed of 4 places in 411 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:09] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:10] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (OVERLAPS) 1063/1094 variables, 31/78 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1095 variables, and 1120 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1064/1 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62065ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 62069ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/82 places, 1075/2159 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63364 ms. Remains : 31/82 places, 1075/2159 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLFireability-11
Product exploration explored 100000 steps with 9090 reset in 4366 ms.
Product exploration explored 100000 steps with 9090 reset in 4888 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 79 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 86 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40 steps (0 resets) in 8 ms. (4 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 141 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 112 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
[2025-06-06 05:52:32] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:52:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 05:52:33] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-06 05:52:34] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2025-06-06 05:52:34] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-06 05:52:34] [INFO ] [Real]Added 1043 Read/Feed constraints in 163 ms returned sat
[2025-06-06 05:52: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-06 05:52:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-06 05:52:36] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2025-06-06 05:52:36] [INFO ] [Nat]Added 1043 Read/Feed constraints in 246 ms returned sat
[2025-06-06 05:52:36] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1054 transitions) in 157 ms.
[2025-06-06 05:52:36] [INFO ] Added : 0 causal constraints over 0 iterations in 276 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 1075/1075 transitions.
Applied a total of 0 rules in 357 ms. Remains 31 /31 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
[2025-06-06 05:52:36] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:52:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:52:36] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-06 05:52:36] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:52:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:52:37] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-06 05:52:37] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 05:52:37] [INFO ] Redundant transitions in 150 ms returned []
Running 1065 sub problems to find dead transitions.
[2025-06-06 05:52:37] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:52:37] [INFO ] Invariant cache hit.
[2025-06-06 05:52:37] [INFO ] State equation strengthened by 1043 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:48] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:48] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:48] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:48] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:48] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:48] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:48] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:49] [INFO ] Deduced a trap composed of 4 places in 331 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:49] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:50] [INFO ] Deduced a trap composed of 4 places in 643 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:50] [INFO ] Deduced a trap composed of 4 places in 513 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:51] [INFO ] Deduced a trap composed of 4 places in 466 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:51] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:52] [INFO ] Deduced a trap composed of 4 places in 380 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:52] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:52] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:52] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:53] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:53] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:53] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:54] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:54] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:54] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:55] [INFO ] Deduced a trap composed of 4 places in 602 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:55] [INFO ] Deduced a trap composed of 4 places in 525 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:55] [INFO ] Deduced a trap composed of 4 places in 437 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:56] [INFO ] Deduced a trap composed of 4 places in 382 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:56] [INFO ] Deduced a trap composed of 4 places in 366 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:52:57] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:03] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:04] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:04] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:04] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 31/1095 variables, and 34 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/31 constraints, ReadFeed: 0/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:15] [INFO ] Deduced a trap composed of 4 places in 440 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:15] [INFO ] Deduced a trap composed of 4 places in 366 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:16] [INFO ] Deduced a trap composed of 4 places in 526 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:16] [INFO ] Deduced a trap composed of 4 places in 433 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:16] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:17] [INFO ] Deduced a trap composed of 4 places in 350 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:17] [INFO ] Deduced a trap composed of 4 places in 408 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:17] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:18] [INFO ] Deduced a trap composed of 4 places in 279 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:23] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:28] [INFO ] Deduced a trap composed of 4 places in 427 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:28] [INFO ] Deduced a trap composed of 4 places in 366 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:28] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (OVERLAPS) 1063/1094 variables, 31/78 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 1042/1120 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1095 variables, and 1121 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62016ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 62022ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63301 ms. Remains : 31/31 places, 1075/1075 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 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40 steps (0 resets) in 7 ms. (5 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 90 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 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
[2025-06-06 05:53:40] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:53:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 05:53:41] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-06 05:53:41] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2025-06-06 05:53:41] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-06 05:53:42] [INFO ] [Real]Added 1043 Read/Feed constraints in 215 ms returned sat
[2025-06-06 05:53:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 05:53:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-06 05:53:43] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2025-06-06 05:53:43] [INFO ] [Nat]Added 1043 Read/Feed constraints in 238 ms returned sat
[2025-06-06 05:53:44] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1054 transitions) in 138 ms.
[2025-06-06 05:53:44] [INFO ] Added : 0 causal constraints over 0 iterations in 255 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9090 reset in 4197 ms.
Product exploration explored 100000 steps with 9090 reset in 4486 ms.
Built C files in :
/tmp/ltsmin13278992690498706050
[2025-06-06 05:53:53] [INFO ] Computing symmetric may disable matrix : 1075 transitions.
[2025-06-06 05:53:53] [INFO ] Computation of Complete disable matrix. took 685 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 05:53:53] [INFO ] Computing symmetric may enable matrix : 1075 transitions.
[2025-06-06 05:53:53] [INFO ] Computation of Complete enable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 05:53:54] [INFO ] Computing Do-Not-Accords matrix : 1075 transitions.
[2025-06-06 05:53:54] [INFO ] Computation of Completed DNA matrix. took 93 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 05:53:54] [INFO ] Built C files in 1244ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13278992690498706050
Running compilation step : cd /tmp/ltsmin13278992690498706050;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13278992690498706050;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13278992690498706050;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 10 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 1075/1075 transitions.
Applied a total of 0 rules in 219 ms. Remains 31 /31 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
[2025-06-06 05:53:57] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:53:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:53:57] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-06 05:53:57] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:53:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:53:57] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-06 05:53:58] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 05:53:58] [INFO ] Redundant transitions in 148 ms returned []
Running 1065 sub problems to find dead transitions.
[2025-06-06 05:53:58] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:53:58] [INFO ] Invariant cache hit.
[2025-06-06 05:53:58] [INFO ] State equation strengthened by 1043 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:08] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:08] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:08] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:08] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:09] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:09] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:09] [INFO ] Deduced a trap composed of 4 places in 358 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:09] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:10] [INFO ] Deduced a trap composed of 4 places in 315 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:10] [INFO ] Deduced a trap composed of 4 places in 646 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:11] [INFO ] Deduced a trap composed of 4 places in 514 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:11] [INFO ] Deduced a trap composed of 4 places in 502 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:12] [INFO ] Deduced a trap composed of 4 places in 432 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:12] [INFO ] Deduced a trap composed of 4 places in 346 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:12] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:13] [INFO ] Deduced a trap composed of 4 places in 272 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:13] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:13] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:13] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:13] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:14] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:14] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:14] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:15] [INFO ] Deduced a trap composed of 4 places in 593 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:16] [INFO ] Deduced a trap composed of 4 places in 531 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:16] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:16] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:17] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:17] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:24] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:25] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:25] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:25] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 31/1095 variables, and 34 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/31 constraints, ReadFeed: 0/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:35] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:35] [INFO ] Deduced a trap composed of 4 places in 360 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:36] [INFO ] Deduced a trap composed of 4 places in 495 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:36] [INFO ] Deduced a trap composed of 4 places in 393 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:36] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:37] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:37] [INFO ] Deduced a trap composed of 4 places in 359 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:37] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:38] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:42] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:48] [INFO ] Deduced a trap composed of 4 places in 435 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:48] [INFO ] Deduced a trap composed of 4 places in 359 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:54:48] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
SMT process timed out in 61961ms, After SMT, problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 61968ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62950 ms. Remains : 31/31 places, 1075/1075 transitions.
Built C files in :
/tmp/ltsmin12438549995234509588
[2025-06-06 05:55:00] [INFO ] Computing symmetric may disable matrix : 1075 transitions.
[2025-06-06 05:55:00] [INFO ] Computation of Complete disable matrix. took 566 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 05:55:00] [INFO ] Computing symmetric may enable matrix : 1075 transitions.
[2025-06-06 05:55:00] [INFO ] Computation of Complete enable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 05:55:01] [INFO ] Computing Do-Not-Accords matrix : 1075 transitions.
[2025-06-06 05:55:01] [INFO ] Computation of Completed DNA matrix. took 166 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 05:55:01] [INFO ] Built C files in 1324ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12438549995234509588
Running compilation step : cd /tmp/ltsmin12438549995234509588;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12438549995234509588;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12438549995234509588;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-06 05:55:04] [INFO ] Flatten gal took : 79 ms
[2025-06-06 05:55:04] [INFO ] Flatten gal took : 86 ms
[2025-06-06 05:55:04] [INFO ] Time to serialize gal into /tmp/LTL7452810702387889659.gal : 18 ms
[2025-06-06 05:55:04] [INFO ] Time to serialize properties into /tmp/LTL8427760004185500237.prop : 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/LTL7452810702387889659.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9970665015057947169.hoa' '-atoms' '/tmp/LTL8427760004185500237.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8427760004185500237.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9970665015057947169.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t18, t23, t28, t33, t38, t43, t48, t66.t2157, t65.t2155, t67.t2153, t64.t2151, t...322
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
792 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,8.68566,139464,1,0,1158,44492,2167,45,44073,28340,2243
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA StigmergyElection-PT-10a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property StigmergyElection-PT-10a-LTLFireability-11 finished in 234288 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 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 81 transition count 2138
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 61 transition count 2138
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 41 transition count 2118
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 0 with 1023 rules applied. Total rules applied 1103 place count 41 transition count 1095
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 1113 place count 41 transition count 1085
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 1133 place count 31 transition count 1075
Applied a total of 1133 rules in 790 ms. Remains 31 /82 variables (removed 51) and now considering 1075/2159 (removed 1084) transitions.
[2025-06-06 05:55:14] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:55:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:55:14] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-06 05:55:14] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:55:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:55:14] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-06 05:55:14] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 05:55:15] [INFO ] Redundant transitions in 88 ms returned []
Running 1065 sub problems to find dead transitions.
[2025-06-06 05:55:15] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:55:15] [INFO ] Invariant cache hit.
[2025-06-06 05:55:15] [INFO ] State equation strengthened by 1043 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:25] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:25] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:25] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:25] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:25] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:25] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:26] [INFO ] Deduced a trap composed of 4 places in 350 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:26] [INFO ] Deduced a trap composed of 4 places in 363 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:26] [INFO ] Deduced a trap composed of 4 places in 358 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:27] [INFO ] Deduced a trap composed of 4 places in 696 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:28] [INFO ] Deduced a trap composed of 4 places in 543 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:28] [INFO ] Deduced a trap composed of 4 places in 490 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:29] [INFO ] Deduced a trap composed of 4 places in 406 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:29] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:29] [INFO ] Deduced a trap composed of 4 places in 281 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:30] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:30] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:30] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:30] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:30] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:31] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:31] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:31] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:32] [INFO ] Deduced a trap composed of 4 places in 522 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:32] [INFO ] Deduced a trap composed of 4 places in 432 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:32] [INFO ] Deduced a trap composed of 4 places in 336 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:33] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:33] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:33] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:41] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:41] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:41] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:42] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 31/1095 variables, and 34 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/31 constraints, ReadFeed: 0/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:52] [INFO ] Deduced a trap composed of 4 places in 423 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:53] [INFO ] Deduced a trap composed of 4 places in 346 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:53] [INFO ] Deduced a trap composed of 4 places in 475 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:54] [INFO ] Deduced a trap composed of 4 places in 397 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:54] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:54] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:55] [INFO ] Deduced a trap composed of 4 places in 371 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:55] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:55] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:00] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:05] [INFO ] Deduced a trap composed of 4 places in 415 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:05] [INFO ] Deduced a trap composed of 4 places in 355 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:06] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 31/1095 variables, and 47 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/31 constraints, ReadFeed: 0/1043 constraints, PredecessorRefiner: 1064/1 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62168ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 62173ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/82 places, 1075/2159 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63544 ms. Remains : 31/82 places, 1075/2159 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLFireability-14
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-10a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLFireability-14 finished in 63670 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 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 81 transition count 2138
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 61 transition count 2138
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 41 transition count 2118
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 0 with 1023 rules applied. Total rules applied 1103 place count 41 transition count 1095
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 1113 place count 41 transition count 1085
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 1133 place count 31 transition count 1075
Applied a total of 1133 rules in 939 ms. Remains 31 /82 variables (removed 51) and now considering 1075/2159 (removed 1084) transitions.
[2025-06-06 05:56:18] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:56:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:56:18] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-06 05:56:18] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:56:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:56:18] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2025-06-06 05:56:18] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 05:56:18] [INFO ] Redundant transitions in 164 ms returned []
Running 1065 sub problems to find dead transitions.
[2025-06-06 05:56:18] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2025-06-06 05:56:18] [INFO ] Invariant cache hit.
[2025-06-06 05:56:19] [INFO ] State equation strengthened by 1043 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:29] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:29] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:29] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:29] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:30] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:30] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:30] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:30] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:31] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:31] [INFO ] Deduced a trap composed of 4 places in 676 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:32] [INFO ] Deduced a trap composed of 4 places in 576 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:33] [INFO ] Deduced a trap composed of 4 places in 542 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:33] [INFO ] Deduced a trap composed of 4 places in 433 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:33] [INFO ] Deduced a trap composed of 4 places in 371 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:34] [INFO ] Deduced a trap composed of 4 places in 309 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:34] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:34] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:34] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:35] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:35] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:35] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:36] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:36] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:36] [INFO ] Deduced a trap composed of 4 places in 524 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:37] [INFO ] Deduced a trap composed of 4 places in 431 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:37] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:37] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:38] [INFO ] Deduced a trap composed of 4 places in 279 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:38] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:45] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:46] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:46] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:46] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 31/1095 variables, and 34 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/31 constraints, ReadFeed: 0/1043 constraints, PredecessorRefiner: 1065/1 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:56] [INFO ] Deduced a trap composed of 4 places in 432 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:56] [INFO ] Deduced a trap composed of 4 places in 359 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:57] [INFO ] Deduced a trap composed of 4 places in 464 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:57] [INFO ] Deduced a trap composed of 4 places in 375 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:57] [INFO ] Deduced a trap composed of 4 places in 309 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:58] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:58] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:58] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:56:58] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:03] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:09] [INFO ] Deduced a trap composed of 4 places in 424 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:09] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:57:09] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
SMT process timed out in 62282ms, After SMT, problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 62288ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/82 places, 1075/2159 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63916 ms. Remains : 31/82 places, 1075/2159 transitions.
Stuttering acceptance computed with spot in 103 ms :[p0, p0]
Running random walk in product with property : StigmergyElection-PT-10a-LTLFireability-15
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-10a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLFireability-15 finished in 64044 ms.
All properties solved by simple procedures.
Total runtime 1073448 ms.
BK_STOP 1749189441484
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-10a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-10a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r226-smll-174903491100292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-10a.tgz
mv StigmergyElection-PT-10a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;