About the Execution of LTSMin+red for StigmergyCommit-PT-10a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4319.584 | 3600000.00 | 6456149.00 | 7664.80 | T?FFFFT?FTFFFF?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r536-tall-171690531800220.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is StigmergyCommit-PT-10a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690531800220
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 155M
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 155M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-10a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717239320944
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-10a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:55:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 10:55:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:55:27] [INFO ] Load time of PNML (sax parser for PT used): 5401 ms
[2024-06-01 10:55:28] [INFO ] Transformed 400 places.
[2024-06-01 10:55:28] [INFO ] Transformed 136960 transitions.
[2024-06-01 10:55:28] [INFO ] Found NUPN structural information;
[2024-06-01 10:55:28] [INFO ] Parsed PT model containing 400 places and 136960 transitions and 3002181 arcs in 6264 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 132345 transitions
Reduce redundant transitions removed 132345 transitions.
FORMULA StigmergyCommit-PT-10a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 4615/4615 transitions.
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 88 place count 312 transition count 4516
Iterating global reduction 0 with 88 rules applied. Total rules applied 176 place count 312 transition count 4516
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 187 place count 312 transition count 4505
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 232 place count 267 transition count 4449
Iterating global reduction 1 with 45 rules applied. Total rules applied 277 place count 267 transition count 4449
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 288 place count 267 transition count 4438
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 299 place count 256 transition count 4427
Iterating global reduction 2 with 11 rules applied. Total rules applied 310 place count 256 transition count 4427
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 321 place count 245 transition count 4416
Iterating global reduction 2 with 11 rules applied. Total rules applied 332 place count 245 transition count 4416
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 343 place count 234 transition count 4405
Iterating global reduction 2 with 11 rules applied. Total rules applied 354 place count 234 transition count 4405
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 365 place count 223 transition count 4394
Iterating global reduction 2 with 11 rules applied. Total rules applied 376 place count 223 transition count 4394
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 387 place count 223 transition count 4383
Applied a total of 387 rules in 235 ms. Remains 223 /400 variables (removed 177) and now considering 4383/4615 (removed 232) transitions.
[2024-06-01 10:55:29] [INFO ] Flow matrix only has 4371 transitions (discarded 12 similar events)
// Phase 1: matrix 4371 rows 223 cols
[2024-06-01 10:55:29] [INFO ] Computed 2 invariants in 74 ms
[2024-06-01 10:55:29] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-06-01 10:55:29] [INFO ] Flow matrix only has 4371 transitions (discarded 12 similar events)
[2024-06-01 10:55:29] [INFO ] Invariant cache hit.
[2024-06-01 10:55:31] [INFO ] State equation strengthened by 4192 read => feed constraints.
[2024-06-01 10:55:33] [INFO ] Implicit Places using invariants and state equation in 3691 ms returned [222]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4060 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 222/400 places, 4383/4615 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 190 transition count 4351
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 190 transition count 4351
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 75 place count 190 transition count 4340
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 86 place count 179 transition count 4329
Iterating global reduction 1 with 11 rules applied. Total rules applied 97 place count 179 transition count 4329
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 108 place count 168 transition count 4318
Iterating global reduction 1 with 11 rules applied. Total rules applied 119 place count 168 transition count 4318
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 130 place count 157 transition count 4307
Iterating global reduction 1 with 11 rules applied. Total rules applied 141 place count 157 transition count 4307
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 152 place count 146 transition count 4296
Iterating global reduction 1 with 11 rules applied. Total rules applied 163 place count 146 transition count 4296
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 173 place count 136 transition count 4286
Iterating global reduction 1 with 10 rules applied. Total rules applied 183 place count 136 transition count 4286
Applied a total of 183 rules in 190 ms. Remains 136 /222 variables (removed 86) and now considering 4286/4383 (removed 97) transitions.
[2024-06-01 10:55:33] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
// Phase 1: matrix 4274 rows 136 cols
[2024-06-01 10:55:33] [INFO ] Computed 1 invariants in 23 ms
[2024-06-01 10:55:33] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 10:55:33] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 10:55:33] [INFO ] Invariant cache hit.
[2024-06-01 10:55:35] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 10:55:35] [INFO ] Implicit Places using invariants and state equation in 1721 ms returned []
Implicit Place search using SMT with State Equation took 1811 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 136/400 places, 4286/4615 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6315 ms. Remains : 136/400 places, 4286/4615 transitions.
Support contains 11 out of 136 places after structural reductions.
[2024-06-01 10:55:36] [INFO ] Flatten gal took : 529 ms
[2024-06-01 10:55:36] [INFO ] Flatten gal took : 333 ms
[2024-06-01 10:55:37] [INFO ] Input system was already deterministic with 4286 transitions.
Reduction of identical properties reduced properties to check from 10 to 3
RANDOM walk for 40000 steps (9 resets) in 12445 ms. (3 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1043 ms. (38 steps per ms) remains 1/1 properties
[2024-06-01 10:55:41] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 10:55:41] [INFO ] Invariant cache hit.
[2024-06-01 10:55:42] [INFO ] State equation strengthened by 4104 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4273/4409 variables, 136/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4409 variables, 4103/4240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4409 variables, 0/4240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/4410 variables, 1/4241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4410 variables, 0/4241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4410 variables, 0/4241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4410/4410 variables, and 4241 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1593 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 4104/4104 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Int declared 136/4410 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/136 constraints, ReadFeed: 0/4104 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2512ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA StigmergyCommit-PT-10a-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA StigmergyCommit-PT-10a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 3 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((F(p0)&&p1)))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 16 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-06-01 10:55:44] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 10:55:44] [INFO ] Invariant cache hit.
[2024-06-01 10:55:44] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 10:55:44] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 10:55:44] [INFO ] Invariant cache hit.
[2024-06-01 10:55:45] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 10:55:45] [INFO ] Implicit Places using invariants and state equation in 1641 ms returned []
Implicit Place search using SMT with State Equation took 1688 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-06-01 10:55:45] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 10:55:46] [INFO ] Invariant cache hit.
[2024-06-01 10:55:46] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 98236ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 98291ms
Finished structural reductions in LTL mode , in 1 iterations and 100028 ms. Remains : 136/136 places, 4286/4286 transitions.
Stuttering acceptance computed with spot in 280 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-01
Product exploration explored 100000 steps with 1428 reset in 2159 ms.
Product exploration explored 100000 steps with 1428 reset in 2009 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 162 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 40000 steps (8 resets) in 14390 ms. (2 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 879 ms. (45 steps per ms) remains 1/1 properties
[2024-06-01 10:57:33] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 10:57:33] [INFO ] Invariant cache hit.
[2024-06-01 10:57:34] [INFO ] State equation strengthened by 4104 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 11/4410 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/136 constraints, ReadFeed: 0/4104 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 332ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 9 factoid took 179 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-06-01 10:57:34] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 10:57:34] [INFO ] Invariant cache hit.
[2024-06-01 10:57:36] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 10:57:37] [INFO ] [Real]Absence check using state equation in 810 ms returned sat
[2024-06-01 10:57:38] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 10:57:39] [INFO ] [Real]Added 4104 Read/Feed constraints in 416 ms returned sat
[2024-06-01 10:57:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:57:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-06-01 10:57:42] [INFO ] [Nat]Absence check using state equation in 748 ms returned sat
[2024-06-01 10:57:42] [INFO ] [Nat]Added 4104 Read/Feed constraints in 478 ms returned sat
[2024-06-01 10:57:44] [INFO ] Computed and/alt/rep : 145/178/145 causal constraints (skipped 4128 transitions) in 1160 ms.
[2024-06-01 10:57:48] [INFO ] Added : 111 causal constraints over 23 iterations in 5349 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 18 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-06-01 10:57:48] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 10:57:48] [INFO ] Invariant cache hit.
[2024-06-01 10:57:48] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 10:57:48] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 10:57:48] [INFO ] Invariant cache hit.
[2024-06-01 10:57:49] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 10:57:50] [INFO ] Implicit Places using invariants and state equation in 1684 ms returned []
Implicit Place search using SMT with State Equation took 1767 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-06-01 10:57:50] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 10:57:50] [INFO ] Invariant cache hit.
[2024-06-01 10:57:50] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 96917ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 96969ms
Finished structural reductions in LTL mode , in 1 iterations and 98768 ms. Remains : 136/136 places, 4286/4286 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 276 steps (0 resets) in 12 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-06-01 10:59:27] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 10:59:27] [INFO ] Invariant cache hit.
[2024-06-01 10:59:30] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 10:59:31] [INFO ] [Real]Absence check using state equation in 777 ms returned sat
[2024-06-01 10:59:31] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 10:59:31] [INFO ] [Real]Added 4104 Read/Feed constraints in 413 ms returned sat
[2024-06-01 10:59:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:59:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 10:59:34] [INFO ] [Nat]Absence check using state equation in 751 ms returned sat
[2024-06-01 10:59:35] [INFO ] [Nat]Added 4104 Read/Feed constraints in 472 ms returned sat
[2024-06-01 10:59:36] [INFO ] Computed and/alt/rep : 145/178/145 causal constraints (skipped 4128 transitions) in 1142 ms.
[2024-06-01 10:59:40] [INFO ] Added : 111 causal constraints over 23 iterations in 5393 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1428 reset in 1926 ms.
Product exploration explored 100000 steps with 1428 reset in 1941 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 136 transition count 4286
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 34 place count 136 transition count 4297
Deduced a syphon composed of 45 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 45 place count 136 transition count 4297
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 67 place count 114 transition count 4275
Deduced a syphon composed of 23 places in 2 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 89 place count 114 transition count 4275
Performed 45 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 68 places in 1 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 134 place count 114 transition count 4286
Ensure Unique test removed 2069 transitions
Reduce isomorphic transitions removed 2069 transitions.
Iterating post reduction 1 with 2069 rules applied. Total rules applied 2203 place count 114 transition count 2217
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 2227 place count 90 transition count 2193
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 2251 place count 90 transition count 2193
Deduced a syphon composed of 44 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 2273 place count 90 transition count 2171
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 55 places in 1 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 2284 place count 90 transition count 2171
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 2306 place count 68 transition count 2149
Deduced a syphon composed of 33 places in 1 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 2328 place count 68 transition count 2149
Deduced a syphon composed of 33 places in 1 ms
Applied a total of 2328 rules in 2724 ms. Remains 68 /136 variables (removed 68) and now considering 2149/4286 (removed 2137) transitions.
[2024-06-01 10:59:48] [INFO ] Redundant transitions in 331 ms returned []
Running 2148 sub problems to find dead transitions.
[2024-06-01 10:59:48] [INFO ] Flow matrix only has 2137 transitions (discarded 12 similar events)
// Phase 1: matrix 2137 rows 68 cols
[2024-06-01 10:59:48] [INFO ] Computed 1 invariants in 7 ms
[2024-06-01 10:59:48] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-06-01 11:00:29] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 4 ms to minimize.
[2024-06-01 11:00:29] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-06-01 11:00:29] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-06-01 11:00:29] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 2 ms to minimize.
[2024-06-01 11:00:30] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-06-01 11:00:30] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 0 ms to minimize.
[2024-06-01 11:00:30] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-06-01 11:00:30] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-06-01 11:00:30] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-06-01 11:00:30] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2024-06-01 11:00:30] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-06-01 11:00:31] [INFO ] Deduced a trap composed of 5 places in 635 ms of which 1 ms to minimize.
[2024-06-01 11:00:31] [INFO ] Deduced a trap composed of 5 places in 692 ms of which 1 ms to minimize.
[2024-06-01 11:00:32] [INFO ] Deduced a trap composed of 5 places in 548 ms of which 0 ms to minimize.
[2024-06-01 11:00:33] [INFO ] Deduced a trap composed of 5 places in 766 ms of which 1 ms to minimize.
[2024-06-01 11:00:33] [INFO ] Deduced a trap composed of 5 places in 629 ms of which 1 ms to minimize.
[2024-06-01 11:00:34] [INFO ] Deduced a trap composed of 5 places in 624 ms of which 1 ms to minimize.
[2024-06-01 11:00:35] [INFO ] Deduced a trap composed of 5 places in 632 ms of which 1 ms to minimize.
[2024-06-01 11:00:35] [INFO ] Deduced a trap composed of 5 places in 528 ms of which 1 ms to minimize.
[2024-06-01 11:00:36] [INFO ] Deduced a trap composed of 5 places in 417 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-06-01 11:00:37] [INFO ] Deduced a trap composed of 5 places in 426 ms of which 1 ms to minimize.
[2024-06-01 11:00:37] [INFO ] Deduced a trap composed of 5 places in 400 ms of which 1 ms to minimize.
[2024-06-01 11:00:37] [INFO ] Deduced a trap composed of 5 places in 345 ms of which 0 ms to minimize.
[2024-06-01 11:00:38] [INFO ] Deduced a trap composed of 5 places in 342 ms of which 1 ms to minimize.
[2024-06-01 11:00:38] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 1 ms to minimize.
[2024-06-01 11:00:38] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 0 ms to minimize.
[2024-06-01 11:00:38] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 0 ms to minimize.
[2024-06-01 11:00:39] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 1 ms to minimize.
[2024-06-01 11:00:39] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 1 ms to minimize.
[2024-06-01 11:00:39] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 1 ms to minimize.
[2024-06-01 11:00:40] [INFO ] Deduced a trap composed of 5 places in 281 ms of which 1 ms to minimize.
[2024-06-01 11:00:40] [INFO ] Deduced a trap composed of 5 places in 341 ms of which 1 ms to minimize.
[2024-06-01 11:00:40] [INFO ] Deduced a trap composed of 5 places in 327 ms of which 0 ms to minimize.
[2024-06-01 11:00:40] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 2 ms to minimize.
[2024-06-01 11:00:41] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 4 ms to minimize.
[2024-06-01 11:00:41] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 0 ms to minimize.
[2024-06-01 11:00:41] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 1 ms to minimize.
[2024-06-01 11:00:41] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 1 ms to minimize.
[2024-06-01 11:00:42] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 0 ms to minimize.
[2024-06-01 11:00:42] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-06-01 11:00:47] [INFO ] Deduced a trap composed of 5 places in 318 ms of which 0 ms to minimize.
[2024-06-01 11:00:47] [INFO ] Deduced a trap composed of 5 places in 275 ms of which 0 ms to minimize.
[2024-06-01 11:00:48] [INFO ] Deduced a trap composed of 5 places in 278 ms of which 1 ms to minimize.
[2024-06-01 11:00:48] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 0 ms to minimize.
[2024-06-01 11:00:48] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 0 ms to minimize.
[2024-06-01 11:00:48] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 0 ms to minimize.
[2024-06-01 11:00:49] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 0 ms to minimize.
[2024-06-01 11:00:49] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 0 ms to minimize.
[2024-06-01 11:00:49] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 0 ms to minimize.
[2024-06-01 11:00:49] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 1 ms to minimize.
[2024-06-01 11:00:49] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 4 ms to minimize.
[2024-06-01 11:00:49] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 0 ms to minimize.
[2024-06-01 11:00:50] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 1 ms to minimize.
[2024-06-01 11:00:50] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 1 ms to minimize.
[2024-06-01 11:00:50] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 0 ms to minimize.
SMT process timed out in 62193ms, After SMT, problems are : Problem set: 0 solved, 2148 unsolved
Search for dead transitions found 0 dead transitions in 62215ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/136 places, 2149/4286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65292 ms. Remains : 68/136 places, 2149/4286 transitions.
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 23 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-06-01 11:00:50] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
// Phase 1: matrix 4274 rows 136 cols
[2024-06-01 11:00:50] [INFO ] Computed 1 invariants in 17 ms
[2024-06-01 11:00:50] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 11:00:50] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:00:50] [INFO ] Invariant cache hit.
[2024-06-01 11:00:51] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 11:00:52] [INFO ] Implicit Places using invariants and state equation in 1440 ms returned []
Implicit Place search using SMT with State Equation took 1516 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-06-01 11:00:52] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:00:52] [INFO ] Invariant cache hit.
[2024-06-01 11:00:52] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 95772ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 95816ms
Finished structural reductions in LTL mode , in 1 iterations and 97375 ms. Remains : 136/136 places, 4286/4286 transitions.
Treatment of property StigmergyCommit-PT-10a-LTLFireability-01 finished in 404642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G(p0)))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 135 transition count 4251
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 101 transition count 4251
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 68 place count 101 transition count 4240
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 90 transition count 4240
Performed 34 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 158 place count 56 transition count 4194
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 2 with 2047 rules applied. Total rules applied 2205 place count 56 transition count 2147
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 3 with 20 rules applied. Total rules applied 2225 place count 46 transition count 2137
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 2235 place count 46 transition count 2127
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 2246 place count 46 transition count 2116
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 2268 place count 35 transition count 2105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2269 place count 34 transition count 2104
Applied a total of 2269 rules in 3036 ms. Remains 34 /136 variables (removed 102) and now considering 2104/4286 (removed 2182) transitions.
[2024-06-01 11:02:31] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
// Phase 1: matrix 2092 rows 34 cols
[2024-06-01 11:02:31] [INFO ] Computed 1 invariants in 16 ms
[2024-06-01 11:02:31] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 11:02:31] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 11:02:31] [INFO ] Invariant cache hit.
[2024-06-01 11:02:32] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 11:02:32] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
[2024-06-01 11:02:32] [INFO ] Redundant transitions in 268 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-06-01 11:02:32] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 11:02:32] [INFO ] Invariant cache hit.
[2024-06-01 11:02:32] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 11:03:12] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 11:03:12] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-06-01 11:03:12] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 11:03:13] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-06-01 11:03:13] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 1 ms to minimize.
[2024-06-01 11:03:13] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 1 ms to minimize.
[2024-06-01 11:03:13] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 1 ms to minimize.
[2024-06-01 11:03:13] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 1 ms to minimize.
[2024-06-01 11:03:14] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-06-01 11:03:14] [INFO ] Deduced a trap composed of 4 places in 675 ms of which 0 ms to minimize.
[2024-06-01 11:03:15] [INFO ] Deduced a trap composed of 4 places in 629 ms of which 1 ms to minimize.
[2024-06-01 11:03:16] [INFO ] Deduced a trap composed of 4 places in 630 ms of which 1 ms to minimize.
[2024-06-01 11:03:16] [INFO ] Deduced a trap composed of 4 places in 676 ms of which 1 ms to minimize.
[2024-06-01 11:03:17] [INFO ] Deduced a trap composed of 4 places in 667 ms of which 2 ms to minimize.
[2024-06-01 11:03:18] [INFO ] Deduced a trap composed of 4 places in 692 ms of which 1 ms to minimize.
[2024-06-01 11:03:18] [INFO ] Deduced a trap composed of 4 places in 576 ms of which 5 ms to minimize.
[2024-06-01 11:03:19] [INFO ] Deduced a trap composed of 4 places in 511 ms of which 1 ms to minimize.
[2024-06-01 11:03:19] [INFO ] Deduced a trap composed of 4 places in 403 ms of which 1 ms to minimize.
[2024-06-01 11:03:20] [INFO ] Deduced a trap composed of 4 places in 376 ms of which 1 ms to minimize.
[2024-06-01 11:03:20] [INFO ] Deduced a trap composed of 4 places in 571 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 11:03:21] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 11:03:21] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-06-01 11:03:21] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-06-01 11:03:21] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2024-06-01 11:03:21] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2024-06-01 11:03:21] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-06-01 11:03:21] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2024-06-01 11:03:21] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-06-01 11:03:21] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-06-01 11:03:21] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2024-06-01 11:03:21] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 11:03:22] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2024-06-01 11:03:22] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-06-01 11:03:22] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 0 ms to minimize.
[2024-06-01 11:03:22] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 0 ms to minimize.
[2024-06-01 11:03:23] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-06-01 11:03:23] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-06-01 11:03:23] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
[2024-06-01 11:03:23] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2024-06-01 11:03:23] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 11:03:27] [INFO ] Deduced a trap composed of 4 places in 363 ms of which 0 ms to minimize.
[2024-06-01 11:03:27] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 1 ms to minimize.
[2024-06-01 11:03:28] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 1 ms to minimize.
[2024-06-01 11:03:28] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 1 ms to minimize.
[2024-06-01 11:03:28] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2024-06-01 11:03:28] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2024-06-01 11:03:29] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2024-06-01 11:03:29] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2024-06-01 11:03:29] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 1 ms to minimize.
[2024-06-01 11:03:29] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2024-06-01 11:03:29] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2024-06-01 11:03:30] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 0 ms to minimize.
[2024-06-01 11:03:30] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2024-06-01 11:03:30] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2024-06-01 11:03:30] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 93574ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 93595ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/136 places, 2104/4286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97661 ms. Remains : 34/136 places, 2104/4286 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), true, (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-02
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLFireability-02 finished in 97806 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(G(p1))))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 18 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-06-01 11:04:06] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
// Phase 1: matrix 4274 rows 136 cols
[2024-06-01 11:04:06] [INFO ] Computed 1 invariants in 22 ms
[2024-06-01 11:04:06] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-01 11:04:06] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:04:06] [INFO ] Invariant cache hit.
[2024-06-01 11:04:07] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 11:04:08] [INFO ] Implicit Places using invariants and state equation in 1486 ms returned []
Implicit Place search using SMT with State Equation took 1557 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-06-01 11:04:08] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:04:08] [INFO ] Invariant cache hit.
[2024-06-01 11:04:08] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 103642ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 103683ms
Finished structural reductions in LTL mode , in 1 iterations and 105278 ms. Remains : 136/136 places, 4286/4286 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-03
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 12 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLFireability-03 finished in 105488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 135 transition count 4251
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 101 transition count 4251
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 68 place count 101 transition count 4240
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 90 transition count 4240
Performed 34 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 158 place count 56 transition count 4194
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 2 with 2047 rules applied. Total rules applied 2205 place count 56 transition count 2147
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 3 with 20 rules applied. Total rules applied 2225 place count 46 transition count 2137
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 2235 place count 46 transition count 2127
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 2246 place count 46 transition count 2116
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 2268 place count 35 transition count 2105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2269 place count 34 transition count 2104
Applied a total of 2269 rules in 2727 ms. Remains 34 /136 variables (removed 102) and now considering 2104/4286 (removed 2182) transitions.
[2024-06-01 11:05:54] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
// Phase 1: matrix 2092 rows 34 cols
[2024-06-01 11:05:54] [INFO ] Computed 1 invariants in 10 ms
[2024-06-01 11:05:54] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 11:05:54] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 11:05:54] [INFO ] Invariant cache hit.
[2024-06-01 11:05:55] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 11:05:55] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
[2024-06-01 11:05:55] [INFO ] Redundant transitions in 274 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-06-01 11:05:55] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 11:05:55] [INFO ] Invariant cache hit.
[2024-06-01 11:05:55] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 11:06:36] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-06-01 11:06:36] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-06-01 11:06:37] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-06-01 11:06:37] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-06-01 11:06:37] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 1 ms to minimize.
[2024-06-01 11:06:37] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 1 ms to minimize.
[2024-06-01 11:06:37] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2024-06-01 11:06:38] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 1 ms to minimize.
[2024-06-01 11:06:38] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2024-06-01 11:06:38] [INFO ] Deduced a trap composed of 4 places in 691 ms of which 1 ms to minimize.
[2024-06-01 11:06:39] [INFO ] Deduced a trap composed of 4 places in 699 ms of which 1 ms to minimize.
[2024-06-01 11:06:40] [INFO ] Deduced a trap composed of 4 places in 698 ms of which 0 ms to minimize.
[2024-06-01 11:06:41] [INFO ] Deduced a trap composed of 4 places in 688 ms of which 1 ms to minimize.
[2024-06-01 11:06:41] [INFO ] Deduced a trap composed of 4 places in 681 ms of which 0 ms to minimize.
[2024-06-01 11:06:42] [INFO ] Deduced a trap composed of 4 places in 703 ms of which 0 ms to minimize.
[2024-06-01 11:06:43] [INFO ] Deduced a trap composed of 4 places in 601 ms of which 1 ms to minimize.
[2024-06-01 11:06:43] [INFO ] Deduced a trap composed of 4 places in 506 ms of which 1 ms to minimize.
[2024-06-01 11:06:43] [INFO ] Deduced a trap composed of 4 places in 453 ms of which 0 ms to minimize.
[2024-06-01 11:06:44] [INFO ] Deduced a trap composed of 4 places in 362 ms of which 1 ms to minimize.
[2024-06-01 11:06:44] [INFO ] Deduced a trap composed of 4 places in 573 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 11:06:45] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2024-06-01 11:06:45] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-06-01 11:06:45] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-06-01 11:06:45] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2024-06-01 11:06:45] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2024-06-01 11:06:45] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-06-01 11:06:45] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-06-01 11:06:46] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-06-01 11:06:46] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-06-01 11:06:46] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2024-06-01 11:06:46] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-06-01 11:06:46] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-06-01 11:06:46] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-06-01 11:06:46] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 1 ms to minimize.
[2024-06-01 11:06:47] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 0 ms to minimize.
[2024-06-01 11:06:47] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2024-06-01 11:06:47] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 1 ms to minimize.
[2024-06-01 11:06:47] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
[2024-06-01 11:06:47] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2024-06-01 11:06:48] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 11:06:51] [INFO ] Deduced a trap composed of 4 places in 369 ms of which 1 ms to minimize.
[2024-06-01 11:06:52] [INFO ] Deduced a trap composed of 4 places in 392 ms of which 0 ms to minimize.
[2024-06-01 11:06:52] [INFO ] Deduced a trap composed of 4 places in 333 ms of which 1 ms to minimize.
[2024-06-01 11:06:52] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2024-06-01 11:06:53] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2024-06-01 11:06:53] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 0 ms to minimize.
[2024-06-01 11:06:53] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 0 ms to minimize.
[2024-06-01 11:06:53] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2024-06-01 11:06:54] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 1 ms to minimize.
[2024-06-01 11:06:54] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2024-06-01 11:06:54] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-06-01 11:06:54] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-06-01 11:06:54] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-06-01 11:06:54] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-06-01 11:06:54] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 95178ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 95204ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/136 places, 2104/4286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98911 ms. Remains : 34/136 places, 2104/4286 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-04
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 3 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLFireability-04 finished in 99090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 22 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-06-01 11:07:31] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
// Phase 1: matrix 4274 rows 136 cols
[2024-06-01 11:07:31] [INFO ] Computed 1 invariants in 23 ms
[2024-06-01 11:07:31] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 11:07:31] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:07:31] [INFO ] Invariant cache hit.
[2024-06-01 11:07:32] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 11:07:32] [INFO ] Implicit Places using invariants and state equation in 1493 ms returned []
Implicit Place search using SMT with State Equation took 1561 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-06-01 11:07:32] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:07:32] [INFO ] Invariant cache hit.
[2024-06-01 11:07:33] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 103646ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 103693ms
Finished structural reductions in LTL mode , in 1 iterations and 105297 ms. Remains : 136/136 places, 4286/4286 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLFireability-05 finished in 105477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p1)||X((p1 U X(p1)))||p0)))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 15 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-06-01 11:09:16] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:09:16] [INFO ] Invariant cache hit.
[2024-06-01 11:09:16] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 11:09:16] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:09:16] [INFO ] Invariant cache hit.
[2024-06-01 11:09:17] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 11:09:18] [INFO ] Implicit Places using invariants and state equation in 1415 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-06-01 11:09:18] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:09:18] [INFO ] Invariant cache hit.
[2024-06-01 11:09:18] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 97020ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 97064ms
Finished structural reductions in LTL mode , in 1 iterations and 98562 ms. Remains : 136/136 places, 4286/4286 transitions.
Stuttering acceptance computed with spot in 327 ms :[false, false, p1, false, false, (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 251 ms.
Product exploration explored 100000 steps with 50000 reset in 279 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 17 ms. Reduced automaton from 9 states, 13 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-10a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-10a-LTLFireability-06 finished in 99498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 12 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-06-01 11:10:56] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:10:56] [INFO ] Invariant cache hit.
[2024-06-01 11:10:56] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 11:10:56] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:10:56] [INFO ] Invariant cache hit.
[2024-06-01 11:10:57] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 11:10:57] [INFO ] Implicit Places using invariants and state equation in 1407 ms returned []
Implicit Place search using SMT with State Equation took 1453 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-06-01 11:10:57] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:10:57] [INFO ] Invariant cache hit.
[2024-06-01 11:10:57] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 98652ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 98708ms
Finished structural reductions in LTL mode , in 1 iterations and 100192 ms. Remains : 136/136 places, 4286/4286 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-07
Product exploration explored 100000 steps with 1428 reset in 1829 ms.
Product exploration explored 100000 steps with 1428 reset in 1838 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 276 steps (0 resets) in 18 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 112 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 11:12:40] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:12:41] [INFO ] Invariant cache hit.
[2024-06-01 11:12:43] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 11:12:44] [INFO ] [Real]Absence check using state equation in 825 ms returned sat
[2024-06-01 11:12:44] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 11:12:45] [INFO ] [Real]Added 4104 Read/Feed constraints in 376 ms returned sat
[2024-06-01 11:12:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:12:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 11:12:48] [INFO ] [Nat]Absence check using state equation in 749 ms returned sat
[2024-06-01 11:12:48] [INFO ] [Nat]Added 4104 Read/Feed constraints in 474 ms returned sat
[2024-06-01 11:12:49] [INFO ] Computed and/alt/rep : 145/178/145 causal constraints (skipped 4128 transitions) in 1016 ms.
[2024-06-01 11:12:53] [INFO ] Added : 111 causal constraints over 23 iterations in 5188 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 14 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-06-01 11:12:53] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:12:53] [INFO ] Invariant cache hit.
[2024-06-01 11:12:53] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 11:12:53] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:12:53] [INFO ] Invariant cache hit.
[2024-06-01 11:12:54] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 11:12:55] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned []
Implicit Place search using SMT with State Equation took 1537 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-06-01 11:12:55] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:12:55] [INFO ] Invariant cache hit.
[2024-06-01 11:12:55] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 96156ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 96199ms
Finished structural reductions in LTL mode , in 1 iterations and 97764 ms. Remains : 136/136 places, 4286/4286 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 276 steps (0 resets) in 16 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 11:14:32] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:14:32] [INFO ] Invariant cache hit.
[2024-06-01 11:14:34] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 11:14:35] [INFO ] [Real]Absence check using state equation in 745 ms returned sat
[2024-06-01 11:14:35] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 11:14:36] [INFO ] [Real]Added 4104 Read/Feed constraints in 374 ms returned sat
[2024-06-01 11:14:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:14:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 11:14:39] [INFO ] [Nat]Absence check using state equation in 737 ms returned sat
[2024-06-01 11:14:39] [INFO ] [Nat]Added 4104 Read/Feed constraints in 464 ms returned sat
[2024-06-01 11:14:40] [INFO ] Computed and/alt/rep : 145/178/145 causal constraints (skipped 4128 transitions) in 612 ms.
[2024-06-01 11:14:44] [INFO ] Added : 111 causal constraints over 23 iterations in 4533 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1428 reset in 1958 ms.
Product exploration explored 100000 steps with 1428 reset in 1974 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 136 transition count 4286
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 34 place count 136 transition count 4297
Deduced a syphon composed of 45 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 45 place count 136 transition count 4297
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 67 place count 114 transition count 4275
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 89 place count 114 transition count 4275
Performed 45 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 68 places in 1 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 134 place count 114 transition count 4286
Ensure Unique test removed 2069 transitions
Reduce isomorphic transitions removed 2069 transitions.
Iterating post reduction 1 with 2069 rules applied. Total rules applied 2203 place count 114 transition count 2217
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 2227 place count 90 transition count 2193
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 2251 place count 90 transition count 2193
Deduced a syphon composed of 44 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 2273 place count 90 transition count 2171
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 2284 place count 90 transition count 2171
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 2306 place count 68 transition count 2149
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 2328 place count 68 transition count 2149
Deduced a syphon composed of 33 places in 1 ms
Applied a total of 2328 rules in 1933 ms. Remains 68 /136 variables (removed 68) and now considering 2149/4286 (removed 2137) transitions.
[2024-06-01 11:14:51] [INFO ] Redundant transitions in 290 ms returned []
Running 2148 sub problems to find dead transitions.
[2024-06-01 11:14:51] [INFO ] Flow matrix only has 2137 transitions (discarded 12 similar events)
// Phase 1: matrix 2137 rows 68 cols
[2024-06-01 11:14:51] [INFO ] Computed 1 invariants in 12 ms
[2024-06-01 11:14:51] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-06-01 11:15:32] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-06-01 11:15:32] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:15:32] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2024-06-01 11:15:32] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 0 ms to minimize.
[2024-06-01 11:15:32] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2024-06-01 11:15:32] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-06-01 11:15:32] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-06-01 11:15:32] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
[2024-06-01 11:15:32] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-06-01 11:15:32] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2024-06-01 11:15:32] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 0 ms to minimize.
[2024-06-01 11:15:33] [INFO ] Deduced a trap composed of 5 places in 586 ms of which 1 ms to minimize.
[2024-06-01 11:15:34] [INFO ] Deduced a trap composed of 5 places in 614 ms of which 1 ms to minimize.
[2024-06-01 11:15:34] [INFO ] Deduced a trap composed of 5 places in 491 ms of which 1 ms to minimize.
[2024-06-01 11:15:35] [INFO ] Deduced a trap composed of 5 places in 656 ms of which 1 ms to minimize.
[2024-06-01 11:15:36] [INFO ] Deduced a trap composed of 5 places in 540 ms of which 1 ms to minimize.
[2024-06-01 11:15:36] [INFO ] Deduced a trap composed of 5 places in 551 ms of which 0 ms to minimize.
[2024-06-01 11:15:37] [INFO ] Deduced a trap composed of 5 places in 622 ms of which 1 ms to minimize.
[2024-06-01 11:15:37] [INFO ] Deduced a trap composed of 5 places in 531 ms of which 1 ms to minimize.
[2024-06-01 11:15:38] [INFO ] Deduced a trap composed of 5 places in 398 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-06-01 11:15:39] [INFO ] Deduced a trap composed of 5 places in 356 ms of which 0 ms to minimize.
[2024-06-01 11:15:39] [INFO ] Deduced a trap composed of 5 places in 352 ms of which 1 ms to minimize.
[2024-06-01 11:15:39] [INFO ] Deduced a trap composed of 5 places in 343 ms of which 1 ms to minimize.
[2024-06-01 11:15:40] [INFO ] Deduced a trap composed of 5 places in 330 ms of which 0 ms to minimize.
[2024-06-01 11:15:40] [INFO ] Deduced a trap composed of 5 places in 276 ms of which 0 ms to minimize.
[2024-06-01 11:15:40] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 1 ms to minimize.
[2024-06-01 11:15:40] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 1 ms to minimize.
[2024-06-01 11:15:41] [INFO ] Deduced a trap composed of 5 places in 309 ms of which 1 ms to minimize.
[2024-06-01 11:15:41] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 1 ms to minimize.
[2024-06-01 11:15:41] [INFO ] Deduced a trap composed of 5 places in 278 ms of which 0 ms to minimize.
[2024-06-01 11:15:41] [INFO ] Deduced a trap composed of 5 places in 264 ms of which 0 ms to minimize.
[2024-06-01 11:15:42] [INFO ] Deduced a trap composed of 5 places in 309 ms of which 1 ms to minimize.
[2024-06-01 11:15:42] [INFO ] Deduced a trap composed of 5 places in 324 ms of which 1 ms to minimize.
[2024-06-01 11:15:42] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 1 ms to minimize.
[2024-06-01 11:15:43] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 0 ms to minimize.
[2024-06-01 11:15:43] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 0 ms to minimize.
[2024-06-01 11:15:43] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 0 ms to minimize.
[2024-06-01 11:15:43] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 0 ms to minimize.
[2024-06-01 11:15:44] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 1 ms to minimize.
[2024-06-01 11:15:44] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-06-01 11:15:49] [INFO ] Deduced a trap composed of 5 places in 316 ms of which 1 ms to minimize.
[2024-06-01 11:15:49] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 1 ms to minimize.
[2024-06-01 11:15:49] [INFO ] Deduced a trap composed of 5 places in 278 ms of which 0 ms to minimize.
[2024-06-01 11:15:50] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 1 ms to minimize.
[2024-06-01 11:15:50] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 0 ms to minimize.
[2024-06-01 11:15:50] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 1 ms to minimize.
[2024-06-01 11:15:50] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 0 ms to minimize.
[2024-06-01 11:15:50] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 0 ms to minimize.
[2024-06-01 11:15:51] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 0 ms to minimize.
[2024-06-01 11:15:51] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 0 ms to minimize.
[2024-06-01 11:15:51] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 0 ms to minimize.
[2024-06-01 11:15:51] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 0 ms to minimize.
[2024-06-01 11:15:51] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 1 ms to minimize.
[2024-06-01 11:15:51] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 0 ms to minimize.
[2024-06-01 11:15:52] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
[2024-06-01 11:15:52] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 0 ms to minimize.
[2024-06-01 11:15:52] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
[2024-06-01 11:15:52] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 1 ms to minimize.
[2024-06-01 11:15:52] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 1 ms to minimize.
[2024-06-01 11:15:52] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 68/2205 variables, and 61 constraints, problems are : Problem set: 0 solved, 2148 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/68 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2148/56 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 60/61 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-06-01 11:15:59] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 1 ms to minimize.
[2024-06-01 11:15:59] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 1 ms to minimize.
[2024-06-01 11:15:59] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 0 ms to minimize.
[2024-06-01 11:15:59] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 1 ms to minimize.
[2024-06-01 11:16:00] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 0 ms to minimize.
[2024-06-01 11:16:00] [INFO ] Deduced a trap composed of 5 places in 256 ms of which 0 ms to minimize.
[2024-06-01 11:16:00] [INFO ] Deduced a trap composed of 5 places in 272 ms of which 1 ms to minimize.
[2024-06-01 11:16:00] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 0 ms to minimize.
[2024-06-01 11:16:01] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 1 ms to minimize.
[2024-06-01 11:16:01] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 1 ms to minimize.
[2024-06-01 11:16:01] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 0 ms to minimize.
[2024-06-01 11:16:01] [INFO ] Deduced a trap composed of 5 places in 268 ms of which 0 ms to minimize.
[2024-06-01 11:16:02] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 0 ms to minimize.
[2024-06-01 11:16:02] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 0 ms to minimize.
[2024-06-01 11:16:02] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 1 ms to minimize.
[2024-06-01 11:16:02] [INFO ] Deduced a trap composed of 5 places in 276 ms of which 0 ms to minimize.
[2024-06-01 11:16:02] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 1 ms to minimize.
[2024-06-01 11:16:03] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 0 ms to minimize.
[2024-06-01 11:16:03] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 1 ms to minimize.
[2024-06-01 11:16:03] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-06-01 11:16:05] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 0 ms to minimize.
[2024-06-01 11:16:05] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 1 ms to minimize.
[2024-06-01 11:16:05] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2024-06-01 11:16:05] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
[2024-06-01 11:16:08] [INFO ] Deduced a trap composed of 5 places in 372 ms of which 0 ms to minimize.
[2024-06-01 11:16:08] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 1 ms to minimize.
[2024-06-01 11:16:08] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 1 ms to minimize.
[2024-06-01 11:16:09] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 0 ms to minimize.
[2024-06-01 11:16:09] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 0 ms to minimize.
[2024-06-01 11:16:09] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 0 ms to minimize.
[2024-06-01 11:16:09] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 3 ms to minimize.
[2024-06-01 11:16:09] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 0 ms to minimize.
[2024-06-01 11:16:09] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 0 ms to minimize.
[2024-06-01 11:16:10] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 0 ms to minimize.
[2024-06-01 11:16:10] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 0 ms to minimize.
[2024-06-01 11:16:10] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 0 ms to minimize.
[2024-06-01 11:16:10] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 0 ms to minimize.
[2024-06-01 11:16:10] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2024-06-01 11:16:10] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 0 ms to minimize.
[2024-06-01 11:16:11] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 20/101 constraints. Problems are: Problem set: 44 solved, 2104 unsolved
[2024-06-01 11:16:13] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 0 ms to minimize.
[2024-06-01 11:16:13] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 0 ms to minimize.
[2024-06-01 11:16:13] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
[2024-06-01 11:16:13] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 0 ms to minimize.
[2024-06-01 11:16:13] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2024-06-01 11:16:14] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 1 ms to minimize.
[2024-06-01 11:16:14] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 0 ms to minimize.
[2024-06-01 11:16:14] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 0 ms to minimize.
[2024-06-01 11:16:14] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 0 ms to minimize.
[2024-06-01 11:16:15] [INFO ] Deduced a trap composed of 5 places in 359 ms of which 1 ms to minimize.
[2024-06-01 11:16:15] [INFO ] Deduced a trap composed of 5 places in 330 ms of which 0 ms to minimize.
[2024-06-01 11:16:15] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 1 ms to minimize.
[2024-06-01 11:16:15] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 1 ms to minimize.
[2024-06-01 11:16:16] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 1 ms to minimize.
[2024-06-01 11:16:16] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2024-06-01 11:16:16] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 1 ms to minimize.
[2024-06-01 11:16:16] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2024-06-01 11:16:16] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 68/2205 variables, and 119 constraints, problems are : Problem set: 44 solved, 2104 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/68 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2092/56 constraints, Known Traps: 118/118 constraints]
After SMT, in 91892ms problems are : Problem set: 44 solved, 2104 unsolved
Search for dead transitions found 44 dead transitions in 91912ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 68/136 places, 2105/4286 transitions.
Graph (complete) has 419 edges and 68 vertex of which 35 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.7 ms
Discarding 33 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 762 ms. Remains 35 /68 variables (removed 33) and now considering 2105/2105 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/136 places, 2105/4286 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 94929 ms. Remains : 35/136 places, 2105/4286 transitions.
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 11 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-06-01 11:16:23] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
// Phase 1: matrix 4274 rows 136 cols
[2024-06-01 11:16:23] [INFO ] Computed 1 invariants in 20 ms
[2024-06-01 11:16:23] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 11:16:23] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:16:23] [INFO ] Invariant cache hit.
[2024-06-01 11:16:24] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 11:16:25] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned []
Implicit Place search using SMT with State Equation took 1444 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-06-01 11:16:25] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:16:25] [INFO ] Invariant cache hit.
[2024-06-01 11:16:25] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 96102ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 96152ms
Finished structural reductions in LTL mode , in 1 iterations and 97626 ms. Remains : 136/136 places, 4286/4286 transitions.
Treatment of property StigmergyCommit-PT-10a-LTLFireability-07 finished in 425764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 135 transition count 4251
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 101 transition count 4251
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 68 place count 101 transition count 4240
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 90 transition count 4240
Performed 34 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 158 place count 56 transition count 4194
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 2 with 2047 rules applied. Total rules applied 2205 place count 56 transition count 2147
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 3 with 20 rules applied. Total rules applied 2225 place count 46 transition count 2137
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 2235 place count 46 transition count 2127
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 2246 place count 46 transition count 2116
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 2268 place count 35 transition count 2105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2269 place count 34 transition count 2104
Applied a total of 2269 rules in 2723 ms. Remains 34 /136 variables (removed 102) and now considering 2104/4286 (removed 2182) transitions.
[2024-06-01 11:18:04] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
// Phase 1: matrix 2092 rows 34 cols
[2024-06-01 11:18:04] [INFO ] Computed 1 invariants in 11 ms
[2024-06-01 11:18:04] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 11:18:04] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 11:18:04] [INFO ] Invariant cache hit.
[2024-06-01 11:18:05] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 11:18:05] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
[2024-06-01 11:18:05] [INFO ] Redundant transitions in 274 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-06-01 11:18:05] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 11:18:05] [INFO ] Invariant cache hit.
[2024-06-01 11:18:05] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 11:18:49] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 11:18:49] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-06-01 11:18:49] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-06-01 11:18:49] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 11:18:50] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 0 ms to minimize.
[2024-06-01 11:18:50] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
[2024-06-01 11:18:50] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 1 ms to minimize.
[2024-06-01 11:18:50] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 0 ms to minimize.
[2024-06-01 11:18:50] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 1 ms to minimize.
[2024-06-01 11:18:51] [INFO ] Deduced a trap composed of 4 places in 696 ms of which 2 ms to minimize.
[2024-06-01 11:18:52] [INFO ] Deduced a trap composed of 4 places in 697 ms of which 0 ms to minimize.
[2024-06-01 11:18:52] [INFO ] Deduced a trap composed of 4 places in 684 ms of which 1 ms to minimize.
[2024-06-01 11:18:53] [INFO ] Deduced a trap composed of 4 places in 680 ms of which 1 ms to minimize.
[2024-06-01 11:18:54] [INFO ] Deduced a trap composed of 4 places in 597 ms of which 0 ms to minimize.
[2024-06-01 11:18:54] [INFO ] Deduced a trap composed of 4 places in 685 ms of which 1 ms to minimize.
[2024-06-01 11:18:55] [INFO ] Deduced a trap composed of 4 places in 508 ms of which 0 ms to minimize.
[2024-06-01 11:18:55] [INFO ] Deduced a trap composed of 4 places in 442 ms of which 0 ms to minimize.
[2024-06-01 11:18:56] [INFO ] Deduced a trap composed of 4 places in 381 ms of which 0 ms to minimize.
[2024-06-01 11:18:56] [INFO ] Deduced a trap composed of 4 places in 372 ms of which 1 ms to minimize.
[2024-06-01 11:18:57] [INFO ] Deduced a trap composed of 4 places in 507 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 11:18:57] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 11:18:57] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:18:57] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-06-01 11:18:57] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2024-06-01 11:18:57] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-06-01 11:18:58] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:18:58] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-06-01 11:18:58] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-06-01 11:18:58] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-06-01 11:18:58] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-06-01 11:18:58] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:18:58] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2024-06-01 11:18:58] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-06-01 11:18:59] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 0 ms to minimize.
[2024-06-01 11:18:59] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 1 ms to minimize.
[2024-06-01 11:18:59] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2024-06-01 11:18:59] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-06-01 11:18:59] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2024-06-01 11:19:00] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-06-01 11:19:00] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 11:19:03] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 1 ms to minimize.
[2024-06-01 11:19:04] [INFO ] Deduced a trap composed of 4 places in 386 ms of which 0 ms to minimize.
[2024-06-01 11:19:04] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 1 ms to minimize.
[2024-06-01 11:19:04] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 0 ms to minimize.
[2024-06-01 11:19:05] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2024-06-01 11:19:05] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2024-06-01 11:19:05] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 0 ms to minimize.
[2024-06-01 11:19:05] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 0 ms to minimize.
[2024-06-01 11:19:06] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 0 ms to minimize.
[2024-06-01 11:19:06] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2024-06-01 11:19:06] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 0 ms to minimize.
[2024-06-01 11:19:06] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2024-06-01 11:19:06] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-06-01 11:19:06] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2024-06-01 11:19:06] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 97496ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 97516ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/136 places, 2104/4286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101271 ms. Remains : 34/136 places, 2104/4286 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-10
Stuttering criterion allowed to conclude after 3648 steps with 303 reset in 168 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLFireability-10 finished in 101621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G((F(p0)&&p2))&&p1))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 17 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-06-01 11:19:43] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
// Phase 1: matrix 4274 rows 136 cols
[2024-06-01 11:19:43] [INFO ] Computed 1 invariants in 22 ms
[2024-06-01 11:19:43] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 11:19:43] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:19:43] [INFO ] Invariant cache hit.
[2024-06-01 11:19:44] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 11:19:45] [INFO ] Implicit Places using invariants and state equation in 1429 ms returned []
Implicit Place search using SMT with State Equation took 1502 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-06-01 11:19:45] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:19:45] [INFO ] Invariant cache hit.
[2024-06-01 11:19:45] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 103055ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 103097ms
Finished structural reductions in LTL mode , in 1 iterations and 104640 ms. Remains : 136/136 places, 4286/4286 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), true, (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 70 steps with 0 reset in 5 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLFireability-11 finished in 104941 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||G((G(p1)||p2))||p0))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 19 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-06-01 11:21:28] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:21:28] [INFO ] Invariant cache hit.
[2024-06-01 11:21:28] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 11:21:28] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:21:28] [INFO ] Invariant cache hit.
[2024-06-01 11:21:29] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 11:21:30] [INFO ] Implicit Places using invariants and state equation in 1529 ms returned []
Implicit Place search using SMT with State Equation took 1576 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-06-01 11:21:30] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:21:30] [INFO ] Invariant cache hit.
[2024-06-01 11:21:30] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 102320ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 102364ms
Finished structural reductions in LTL mode , in 1 iterations and 103975 ms. Remains : 136/136 places, 4286/4286 transitions.
Stuttering acceptance computed with spot in 294 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-13
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLFireability-13 finished in 104317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 17 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-06-01 11:23:12] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:23:12] [INFO ] Invariant cache hit.
[2024-06-01 11:23:12] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 11:23:12] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:23:12] [INFO ] Invariant cache hit.
[2024-06-01 11:23:13] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 11:23:14] [INFO ] Implicit Places using invariants and state equation in 1535 ms returned []
Implicit Place search using SMT with State Equation took 1577 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-06-01 11:23:14] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:23:14] [INFO ] Invariant cache hit.
[2024-06-01 11:23:14] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 99860ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 99909ms
Finished structural reductions in LTL mode , in 1 iterations and 101520 ms. Remains : 136/136 places, 4286/4286 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-14
Product exploration explored 100000 steps with 1428 reset in 1956 ms.
Product exploration explored 100000 steps with 1428 reset in 1943 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 276 steps (0 resets) in 13 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 11:24:58] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:24:59] [INFO ] Invariant cache hit.
[2024-06-01 11:25:01] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-06-01 11:25:02] [INFO ] [Real]Absence check using state equation in 798 ms returned sat
[2024-06-01 11:25:02] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 11:25:03] [INFO ] [Real]Added 4104 Read/Feed constraints in 413 ms returned sat
[2024-06-01 11:25:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:25:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 11:25:06] [INFO ] [Nat]Absence check using state equation in 756 ms returned sat
[2024-06-01 11:25:06] [INFO ] [Nat]Added 4104 Read/Feed constraints in 481 ms returned sat
[2024-06-01 11:25:07] [INFO ] Computed and/alt/rep : 145/178/145 causal constraints (skipped 4128 transitions) in 612 ms.
[2024-06-01 11:25:11] [INFO ] Added : 111 causal constraints over 23 iterations in 4737 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 13 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-06-01 11:25:11] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:25:11] [INFO ] Invariant cache hit.
[2024-06-01 11:25:11] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 11:25:11] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:25:11] [INFO ] Invariant cache hit.
[2024-06-01 11:25:12] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 11:25:13] [INFO ] Implicit Places using invariants and state equation in 1431 ms returned []
Implicit Place search using SMT with State Equation took 1471 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-06-01 11:25:13] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:25:13] [INFO ] Invariant cache hit.
[2024-06-01 11:25:13] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 96431ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 96471ms
Finished structural reductions in LTL mode , in 1 iterations and 97965 ms. Remains : 136/136 places, 4286/4286 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 276 steps (0 resets) in 12 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 11:26:50] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:26:50] [INFO ] Invariant cache hit.
[2024-06-01 11:26:52] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 11:26:53] [INFO ] [Real]Absence check using state equation in 809 ms returned sat
[2024-06-01 11:26:53] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 11:26:54] [INFO ] [Real]Added 4104 Read/Feed constraints in 394 ms returned sat
[2024-06-01 11:26:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:26:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 11:26:57] [INFO ] [Nat]Absence check using state equation in 766 ms returned sat
[2024-06-01 11:26:57] [INFO ] [Nat]Added 4104 Read/Feed constraints in 478 ms returned sat
[2024-06-01 11:26:58] [INFO ] Computed and/alt/rep : 145/178/145 causal constraints (skipped 4128 transitions) in 628 ms.
[2024-06-01 11:27:02] [INFO ] Added : 111 causal constraints over 23 iterations in 4621 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1428 reset in 1825 ms.
Product exploration explored 100000 steps with 1428 reset in 1844 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 136 transition count 4286
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 34 place count 136 transition count 4297
Deduced a syphon composed of 45 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 45 place count 136 transition count 4297
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 67 place count 114 transition count 4275
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 89 place count 114 transition count 4275
Performed 45 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 68 places in 1 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 134 place count 114 transition count 4286
Ensure Unique test removed 2069 transitions
Reduce isomorphic transitions removed 2069 transitions.
Iterating post reduction 1 with 2069 rules applied. Total rules applied 2203 place count 114 transition count 2217
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 2227 place count 90 transition count 2193
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 2251 place count 90 transition count 2193
Deduced a syphon composed of 44 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 2273 place count 90 transition count 2171
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 55 places in 1 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 2284 place count 90 transition count 2171
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 2306 place count 68 transition count 2149
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 2328 place count 68 transition count 2149
Deduced a syphon composed of 33 places in 0 ms
Applied a total of 2328 rules in 1946 ms. Remains 68 /136 variables (removed 68) and now considering 2149/4286 (removed 2137) transitions.
[2024-06-01 11:27:08] [INFO ] Redundant transitions in 288 ms returned []
Running 2148 sub problems to find dead transitions.
[2024-06-01 11:27:08] [INFO ] Flow matrix only has 2137 transitions (discarded 12 similar events)
// Phase 1: matrix 2137 rows 68 cols
[2024-06-01 11:27:08] [INFO ] Computed 1 invariants in 4 ms
[2024-06-01 11:27:08] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-06-01 11:27:50] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2024-06-01 11:27:50] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 0 ms to minimize.
[2024-06-01 11:27:50] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2024-06-01 11:27:50] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 0 ms to minimize.
[2024-06-01 11:27:50] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2024-06-01 11:27:50] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 0 ms to minimize.
[2024-06-01 11:27:50] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 0 ms to minimize.
[2024-06-01 11:27:50] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-06-01 11:27:50] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2024-06-01 11:27:50] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2024-06-01 11:27:51] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 0 ms to minimize.
[2024-06-01 11:27:51] [INFO ] Deduced a trap composed of 5 places in 653 ms of which 1 ms to minimize.
[2024-06-01 11:27:52] [INFO ] Deduced a trap composed of 5 places in 641 ms of which 1 ms to minimize.
[2024-06-01 11:27:53] [INFO ] Deduced a trap composed of 5 places in 521 ms of which 1 ms to minimize.
[2024-06-01 11:27:53] [INFO ] Deduced a trap composed of 5 places in 684 ms of which 1 ms to minimize.
[2024-06-01 11:27:54] [INFO ] Deduced a trap composed of 5 places in 609 ms of which 1 ms to minimize.
[2024-06-01 11:27:54] [INFO ] Deduced a trap composed of 5 places in 579 ms of which 0 ms to minimize.
[2024-06-01 11:27:55] [INFO ] Deduced a trap composed of 5 places in 579 ms of which 1 ms to minimize.
[2024-06-01 11:27:56] [INFO ] Deduced a trap composed of 5 places in 504 ms of which 1 ms to minimize.
[2024-06-01 11:27:56] [INFO ] Deduced a trap composed of 5 places in 420 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-06-01 11:27:57] [INFO ] Deduced a trap composed of 5 places in 379 ms of which 1 ms to minimize.
[2024-06-01 11:27:57] [INFO ] Deduced a trap composed of 5 places in 369 ms of which 1 ms to minimize.
[2024-06-01 11:27:58] [INFO ] Deduced a trap composed of 5 places in 326 ms of which 0 ms to minimize.
[2024-06-01 11:27:58] [INFO ] Deduced a trap composed of 5 places in 338 ms of which 1 ms to minimize.
[2024-06-01 11:27:58] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 0 ms to minimize.
[2024-06-01 11:27:59] [INFO ] Deduced a trap composed of 5 places in 275 ms of which 1 ms to minimize.
[2024-06-01 11:27:59] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 1 ms to minimize.
[2024-06-01 11:27:59] [INFO ] Deduced a trap composed of 5 places in 301 ms of which 0 ms to minimize.
[2024-06-01 11:27:59] [INFO ] Deduced a trap composed of 5 places in 231 ms of which 0 ms to minimize.
[2024-06-01 11:28:00] [INFO ] Deduced a trap composed of 5 places in 276 ms of which 1 ms to minimize.
[2024-06-01 11:28:00] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 0 ms to minimize.
[2024-06-01 11:28:00] [INFO ] Deduced a trap composed of 5 places in 320 ms of which 1 ms to minimize.
[2024-06-01 11:28:00] [INFO ] Deduced a trap composed of 5 places in 310 ms of which 0 ms to minimize.
[2024-06-01 11:28:01] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 1 ms to minimize.
[2024-06-01 11:28:01] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 0 ms to minimize.
[2024-06-01 11:28:01] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 1 ms to minimize.
[2024-06-01 11:28:01] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 1 ms to minimize.
[2024-06-01 11:28:02] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 0 ms to minimize.
[2024-06-01 11:28:02] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 0 ms to minimize.
[2024-06-01 11:28:02] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
[2024-06-01 11:28:07] [INFO ] Deduced a trap composed of 5 places in 340 ms of which 1 ms to minimize.
[2024-06-01 11:28:08] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 1 ms to minimize.
[2024-06-01 11:28:08] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 1 ms to minimize.
[2024-06-01 11:28:08] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 1 ms to minimize.
[2024-06-01 11:28:08] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 1 ms to minimize.
[2024-06-01 11:28:08] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 0 ms to minimize.
[2024-06-01 11:28:09] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 0 ms to minimize.
[2024-06-01 11:28:09] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
[2024-06-01 11:28:09] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 1 ms to minimize.
[2024-06-01 11:28:09] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 0 ms to minimize.
[2024-06-01 11:28:09] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 0 ms to minimize.
[2024-06-01 11:28:09] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 0 ms to minimize.
[2024-06-01 11:28:10] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 1 ms to minimize.
[2024-06-01 11:28:10] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 1 ms to minimize.
[2024-06-01 11:28:10] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 1 ms to minimize.
[2024-06-01 11:28:10] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 0 ms to minimize.
[2024-06-01 11:28:10] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 0 ms to minimize.
[2024-06-01 11:28:10] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 0 ms to minimize.
[2024-06-01 11:28:11] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 1 ms to minimize.
SMT process timed out in 62416ms, After SMT, problems are : Problem set: 0 solved, 2148 unsolved
Search for dead transitions found 0 dead transitions in 62435ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/136 places, 2149/4286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64681 ms. Remains : 68/136 places, 2149/4286 transitions.
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Applied a total of 0 rules in 11 ms. Remains 136 /136 variables (removed 0) and now considering 4286/4286 (removed 0) transitions.
[2024-06-01 11:28:11] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
// Phase 1: matrix 4274 rows 136 cols
[2024-06-01 11:28:11] [INFO ] Computed 1 invariants in 14 ms
[2024-06-01 11:28:11] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-01 11:28:11] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:28:11] [INFO ] Invariant cache hit.
[2024-06-01 11:28:12] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 11:28:12] [INFO ] Implicit Places using invariants and state equation in 1486 ms returned []
Implicit Place search using SMT with State Equation took 1604 ms to find 0 implicit places.
Running 4285 sub problems to find dead transitions.
[2024-06-01 11:28:12] [INFO ] Flow matrix only has 4274 transitions (discarded 12 similar events)
[2024-06-01 11:28:12] [INFO ] Invariant cache hit.
[2024-06-01 11:28:13] [INFO ] State equation strengthened by 4104 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4285 unsolved
SMT process timed out in 96377ms, After SMT, problems are : Problem set: 0 solved, 4285 unsolved
Search for dead transitions found 0 dead transitions in 96416ms
Finished structural reductions in LTL mode , in 1 iterations and 98040 ms. Remains : 136/136 places, 4286/4286 transitions.
Treatment of property StigmergyCommit-PT-10a-LTLFireability-14 finished in 396813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 135 transition count 4251
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 101 transition count 4251
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 68 place count 101 transition count 4240
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 90 transition count 4240
Performed 34 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 158 place count 56 transition count 4194
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 2 with 2047 rules applied. Total rules applied 2205 place count 56 transition count 2147
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 3 with 20 rules applied. Total rules applied 2225 place count 46 transition count 2137
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 2235 place count 46 transition count 2127
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 2246 place count 46 transition count 2116
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 2268 place count 35 transition count 2105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2269 place count 34 transition count 2104
Applied a total of 2269 rules in 2662 ms. Remains 34 /136 variables (removed 102) and now considering 2104/4286 (removed 2182) transitions.
[2024-06-01 11:29:52] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
// Phase 1: matrix 2092 rows 34 cols
[2024-06-01 11:29:52] [INFO ] Computed 1 invariants in 11 ms
[2024-06-01 11:29:52] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 11:29:52] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 11:29:52] [INFO ] Invariant cache hit.
[2024-06-01 11:29:52] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 11:29:52] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2024-06-01 11:29:53] [INFO ] Redundant transitions in 273 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-06-01 11:29:53] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 11:29:53] [INFO ] Invariant cache hit.
[2024-06-01 11:29:53] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 11:30:32] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-06-01 11:30:32] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:30:32] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-06-01 11:30:32] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-06-01 11:30:32] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 0 ms to minimize.
[2024-06-01 11:30:32] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 0 ms to minimize.
[2024-06-01 11:30:33] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 0 ms to minimize.
[2024-06-01 11:30:33] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 0 ms to minimize.
[2024-06-01 11:30:33] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2024-06-01 11:30:34] [INFO ] Deduced a trap composed of 4 places in 686 ms of which 0 ms to minimize.
[2024-06-01 11:30:34] [INFO ] Deduced a trap composed of 4 places in 711 ms of which 1 ms to minimize.
[2024-06-01 11:30:35] [INFO ] Deduced a trap composed of 4 places in 655 ms of which 1 ms to minimize.
[2024-06-01 11:30:36] [INFO ] Deduced a trap composed of 4 places in 643 ms of which 1 ms to minimize.
[2024-06-01 11:30:36] [INFO ] Deduced a trap composed of 4 places in 676 ms of which 1 ms to minimize.
[2024-06-01 11:30:37] [INFO ] Deduced a trap composed of 4 places in 663 ms of which 1 ms to minimize.
[2024-06-01 11:30:38] [INFO ] Deduced a trap composed of 4 places in 558 ms of which 0 ms to minimize.
[2024-06-01 11:30:38] [INFO ] Deduced a trap composed of 4 places in 498 ms of which 1 ms to minimize.
[2024-06-01 11:30:39] [INFO ] Deduced a trap composed of 4 places in 422 ms of which 0 ms to minimize.
[2024-06-01 11:30:39] [INFO ] Deduced a trap composed of 4 places in 362 ms of which 1 ms to minimize.
[2024-06-01 11:30:40] [INFO ] Deduced a trap composed of 4 places in 554 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 11:30:40] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-06-01 11:30:40] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-06-01 11:30:40] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-06-01 11:30:40] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2024-06-01 11:30:40] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2024-06-01 11:30:40] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-06-01 11:30:41] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2024-06-01 11:30:41] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2024-06-01 11:30:41] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-06-01 11:30:41] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2024-06-01 11:30:41] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-06-01 11:30:41] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-06-01 11:30:41] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2024-06-01 11:30:42] [INFO ] Deduced a trap composed of 4 places in 315 ms of which 1 ms to minimize.
[2024-06-01 11:30:42] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 1 ms to minimize.
[2024-06-01 11:30:42] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 1 ms to minimize.
[2024-06-01 11:30:42] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 0 ms to minimize.
[2024-06-01 11:30:42] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 0 ms to minimize.
[2024-06-01 11:30:43] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2024-06-01 11:30:43] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 11:30:47] [INFO ] Deduced a trap composed of 4 places in 379 ms of which 1 ms to minimize.
[2024-06-01 11:30:47] [INFO ] Deduced a trap composed of 4 places in 392 ms of which 1 ms to minimize.
[2024-06-01 11:30:48] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 0 ms to minimize.
[2024-06-01 11:30:48] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 0 ms to minimize.
[2024-06-01 11:30:48] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2024-06-01 11:30:48] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2024-06-01 11:30:48] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 0 ms to minimize.
[2024-06-01 11:30:49] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 0 ms to minimize.
[2024-06-01 11:30:49] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 1 ms to minimize.
[2024-06-01 11:30:49] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2024-06-01 11:30:49] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2024-06-01 11:30:49] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 0 ms to minimize.
[2024-06-01 11:30:50] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2024-06-01 11:30:50] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2024-06-01 11:30:50] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 92393ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92412ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/136 places, 2104/4286 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96061 ms. Remains : 34/136 places, 2104/4286 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-15
Stuttering criterion allowed to conclude after 22055 steps with 1837 reset in 1018 ms.
FORMULA StigmergyCommit-PT-10a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLFireability-15 finished in 97202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((F(p0)&&p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : StigmergyCommit-PT-10a-LTLFireability-07
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 135 transition count 4251
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 101 transition count 4251
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 68 place count 101 transition count 4240
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 90 transition count 4240
Performed 34 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 158 place count 56 transition count 4194
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 2 with 2047 rules applied. Total rules applied 2205 place count 56 transition count 2147
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 3 with 20 rules applied. Total rules applied 2225 place count 46 transition count 2137
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 2235 place count 46 transition count 2127
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2236 place count 45 transition count 2126
Applied a total of 2236 rules in 327 ms. Remains 45 /136 variables (removed 91) and now considering 2126/4286 (removed 2160) transitions.
[2024-06-01 11:31:27] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
// Phase 1: matrix 2114 rows 45 cols
[2024-06-01 11:31:27] [INFO ] Computed 1 invariants in 11 ms
[2024-06-01 11:31:27] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 11:31:27] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-06-01 11:31:27] [INFO ] Invariant cache hit.
[2024-06-01 11:31:28] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 11:31:28] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
Running 2115 sub problems to find dead transitions.
[2024-06-01 11:31:28] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-06-01 11:31:28] [INFO ] Invariant cache hit.
[2024-06-01 11:31:28] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-06-01 11:32:09] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-06-01 11:32:09] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2024-06-01 11:32:09] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 0 ms to minimize.
[2024-06-01 11:32:09] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-06-01 11:32:09] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 0 ms to minimize.
[2024-06-01 11:32:09] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 0 ms to minimize.
[2024-06-01 11:32:09] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 1 ms to minimize.
[2024-06-01 11:32:09] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 0 ms to minimize.
[2024-06-01 11:32:10] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 0 ms to minimize.
[2024-06-01 11:32:10] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2024-06-01 11:32:10] [INFO ] Deduced a trap composed of 5 places in 552 ms of which 1 ms to minimize.
[2024-06-01 11:32:11] [INFO ] Deduced a trap composed of 5 places in 477 ms of which 1 ms to minimize.
[2024-06-01 11:32:11] [INFO ] Deduced a trap composed of 6 places in 419 ms of which 1 ms to minimize.
[2024-06-01 11:32:12] [INFO ] Deduced a trap composed of 5 places in 422 ms of which 1 ms to minimize.
[2024-06-01 11:32:12] [INFO ] Deduced a trap composed of 5 places in 417 ms of which 1 ms to minimize.
[2024-06-01 11:32:12] [INFO ] Deduced a trap composed of 5 places in 406 ms of which 1 ms to minimize.
[2024-06-01 11:32:13] [INFO ] Deduced a trap composed of 5 places in 397 ms of which 0 ms to minimize.
[2024-06-01 11:32:13] [INFO ] Deduced a trap composed of 5 places in 362 ms of which 1 ms to minimize.
[2024-06-01 11:32:14] [INFO ] Deduced a trap composed of 5 places in 500 ms of which 1 ms to minimize.
[2024-06-01 11:32:14] [INFO ] Deduced a trap composed of 5 places in 503 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-06-01 11:32:15] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-06-01 11:32:15] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 0 ms to minimize.
[2024-06-01 11:32:15] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-06-01 11:32:15] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-06-01 11:32:15] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2024-06-01 11:32:15] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-06-01 11:32:16] [INFO ] Deduced a trap composed of 5 places in 375 ms of which 0 ms to minimize.
[2024-06-01 11:32:16] [INFO ] Deduced a trap composed of 6 places in 320 ms of which 0 ms to minimize.
[2024-06-01 11:32:16] [INFO ] Deduced a trap composed of 5 places in 317 ms of which 1 ms to minimize.
[2024-06-01 11:32:16] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 1 ms to minimize.
[2024-06-01 11:32:17] [INFO ] Deduced a trap composed of 6 places in 332 ms of which 1 ms to minimize.
[2024-06-01 11:32:17] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 0 ms to minimize.
[2024-06-01 11:32:17] [INFO ] Deduced a trap composed of 5 places in 269 ms of which 1 ms to minimize.
[2024-06-01 11:32:18] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 1 ms to minimize.
[2024-06-01 11:32:18] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-06-01 11:32:30] [INFO ] Deduced a trap composed of 5 places in 372 ms of which 0 ms to minimize.
[2024-06-01 11:32:31] [INFO ] Deduced a trap composed of 5 places in 370 ms of which 1 ms to minimize.
[2024-06-01 11:32:31] [INFO ] Deduced a trap composed of 5 places in 309 ms of which 0 ms to minimize.
[2024-06-01 11:32:31] [INFO ] Deduced a trap composed of 5 places in 312 ms of which 1 ms to minimize.
SMT process timed out in 63664ms, After SMT, problems are : Problem set: 0 solved, 2115 unsolved
Search for dead transitions found 0 dead transitions in 63684ms
Starting structural reductions in LI_LTL mode, iteration 1 : 45/136 places, 2126/4286 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 64751 ms. Remains : 45/136 places, 2126/4286 transitions.
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-07
Product exploration explored 100000 steps with 8333 reset in 4590 ms.
Product exploration explored 100000 steps with 8333 reset in 4591 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)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 44 steps (0 resets) in 7 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 154 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 11:32:41] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-06-01 11:32:41] [INFO ] Invariant cache hit.
[2024-06-01 11:32:42] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 11:32:43] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2024-06-01 11:32:43] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 11:32:43] [INFO ] [Real]Added 2069 Read/Feed constraints in 194 ms returned sat
[2024-06-01 11:32:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:32:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 11:32:45] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2024-06-01 11:32:45] [INFO ] [Nat]Added 2069 Read/Feed constraints in 236 ms returned sat
[2024-06-01 11:32:45] [INFO ] Computed and/alt/rep : 11/11/11 causal constraints (skipped 2092 transitions) in 244 ms.
[2024-06-01 11:32:45] [INFO ] Added : 0 causal constraints over 0 iterations in 420 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 2126/2126 transitions.
Applied a total of 0 rules in 9 ms. Remains 45 /45 variables (removed 0) and now considering 2126/2126 (removed 0) transitions.
[2024-06-01 11:32:45] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-06-01 11:32:45] [INFO ] Invariant cache hit.
[2024-06-01 11:32:45] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 11:32:45] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-06-01 11:32:45] [INFO ] Invariant cache hit.
[2024-06-01 11:32:46] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 11:32:46] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
Running 2115 sub problems to find dead transitions.
[2024-06-01 11:32:46] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-06-01 11:32:46] [INFO ] Invariant cache hit.
[2024-06-01 11:32:46] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-06-01 11:33:26] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-06-01 11:33:26] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-06-01 11:33:26] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 0 ms to minimize.
[2024-06-01 11:33:26] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 0 ms to minimize.
[2024-06-01 11:33:26] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 0 ms to minimize.
[2024-06-01 11:33:26] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 3 ms to minimize.
[2024-06-01 11:33:26] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 1 ms to minimize.
[2024-06-01 11:33:27] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 0 ms to minimize.
[2024-06-01 11:33:27] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 0 ms to minimize.
[2024-06-01 11:33:27] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2024-06-01 11:33:27] [INFO ] Deduced a trap composed of 5 places in 588 ms of which 0 ms to minimize.
[2024-06-01 11:33:28] [INFO ] Deduced a trap composed of 5 places in 486 ms of which 0 ms to minimize.
[2024-06-01 11:33:28] [INFO ] Deduced a trap composed of 6 places in 442 ms of which 1 ms to minimize.
[2024-06-01 11:33:29] [INFO ] Deduced a trap composed of 5 places in 418 ms of which 1 ms to minimize.
[2024-06-01 11:33:29] [INFO ] Deduced a trap composed of 5 places in 413 ms of which 1 ms to minimize.
[2024-06-01 11:33:30] [INFO ] Deduced a trap composed of 5 places in 418 ms of which 0 ms to minimize.
[2024-06-01 11:33:30] [INFO ] Deduced a trap composed of 5 places in 434 ms of which 1 ms to minimize.
[2024-06-01 11:33:30] [INFO ] Deduced a trap composed of 5 places in 377 ms of which 0 ms to minimize.
[2024-06-01 11:33:31] [INFO ] Deduced a trap composed of 5 places in 482 ms of which 1 ms to minimize.
[2024-06-01 11:33:31] [INFO ] Deduced a trap composed of 5 places in 494 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-06-01 11:33:32] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 22 ms to minimize.
[2024-06-01 11:33:32] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2024-06-01 11:33:32] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2024-06-01 11:33:32] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-06-01 11:33:32] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-06-01 11:33:32] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2024-06-01 11:33:33] [INFO ] Deduced a trap composed of 5 places in 380 ms of which 0 ms to minimize.
[2024-06-01 11:33:33] [INFO ] Deduced a trap composed of 6 places in 326 ms of which 1 ms to minimize.
[2024-06-01 11:33:34] [INFO ] Deduced a trap composed of 5 places in 338 ms of which 1 ms to minimize.
[2024-06-01 11:33:34] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 0 ms to minimize.
[2024-06-01 11:33:34] [INFO ] Deduced a trap composed of 6 places in 326 ms of which 0 ms to minimize.
[2024-06-01 11:33:34] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 0 ms to minimize.
[2024-06-01 11:33:35] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 0 ms to minimize.
[2024-06-01 11:33:35] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 0 ms to minimize.
[2024-06-01 11:33:35] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-06-01 11:33:48] [INFO ] Deduced a trap composed of 5 places in 381 ms of which 1 ms to minimize.
[2024-06-01 11:33:49] [INFO ] Deduced a trap composed of 5 places in 382 ms of which 1 ms to minimize.
SMT process timed out in 62555ms, After SMT, problems are : Problem set: 0 solved, 2115 unsolved
Search for dead transitions found 0 dead transitions in 62576ms
Finished structural reductions in LTL mode , in 1 iterations and 63251 ms. Remains : 45/45 places, 2126/2126 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)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 44 steps (0 resets) in 9 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 11:33:49] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-06-01 11:33:49] [INFO ] Invariant cache hit.
[2024-06-01 11:33:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 11:33:51] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2024-06-01 11:33:51] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 11:33:51] [INFO ] [Real]Added 2069 Read/Feed constraints in 179 ms returned sat
[2024-06-01 11:33:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:33:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 11:33:53] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2024-06-01 11:33:53] [INFO ] [Nat]Added 2069 Read/Feed constraints in 221 ms returned sat
[2024-06-01 11:33:53] [INFO ] Computed and/alt/rep : 11/11/11 causal constraints (skipped 2092 transitions) in 236 ms.
[2024-06-01 11:33:53] [INFO ] Added : 0 causal constraints over 0 iterations in 418 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8333 reset in 4613 ms.
Product exploration explored 100000 steps with 8333 reset in 4620 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 2126/2126 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 45 transition count 2115
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 45 transition count 2115
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 22 rules in 1628 ms. Remains 45 /45 variables (removed 0) and now considering 2115/2126 (removed 11) transitions.
[2024-06-01 11:34:05] [INFO ] Redundant transitions in 286 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-06-01 11:34:05] [INFO ] Flow matrix only has 2103 transitions (discarded 12 similar events)
// Phase 1: matrix 2103 rows 45 cols
[2024-06-01 11:34:05] [INFO ] Computed 1 invariants in 10 ms
[2024-06-01 11:34:05] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 11:34:45] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-06-01 11:34:45] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-06-01 11:34:45] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-06-01 11:34:45] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-06-01 11:34:45] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-06-01 11:34:45] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-06-01 11:34:45] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 11:34:45] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 11:34:46] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-06-01 11:34:46] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-06-01 11:34:46] [INFO ] Deduced a trap composed of 4 places in 619 ms of which 1 ms to minimize.
[2024-06-01 11:34:47] [INFO ] Deduced a trap composed of 4 places in 524 ms of which 1 ms to minimize.
[2024-06-01 11:34:47] [INFO ] Deduced a trap composed of 4 places in 445 ms of which 0 ms to minimize.
[2024-06-01 11:34:48] [INFO ] Deduced a trap composed of 4 places in 441 ms of which 1 ms to minimize.
[2024-06-01 11:34:48] [INFO ] Deduced a trap composed of 4 places in 510 ms of which 0 ms to minimize.
[2024-06-01 11:34:49] [INFO ] Deduced a trap composed of 4 places in 481 ms of which 0 ms to minimize.
[2024-06-01 11:34:49] [INFO ] Deduced a trap composed of 4 places in 483 ms of which 1 ms to minimize.
[2024-06-01 11:34:50] [INFO ] Deduced a trap composed of 4 places in 364 ms of which 1 ms to minimize.
[2024-06-01 11:34:50] [INFO ] Deduced a trap composed of 4 places in 382 ms of which 0 ms to minimize.
[2024-06-01 11:34:50] [INFO ] Deduced a trap composed of 4 places in 321 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 11:34:51] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2024-06-01 11:34:51] [INFO ] Deduced a trap composed of 4 places in 325 ms of which 0 ms to minimize.
[2024-06-01 11:34:51] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 0 ms to minimize.
[2024-06-01 11:34:52] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 0 ms to minimize.
[2024-06-01 11:34:52] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2024-06-01 11:34:52] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-06-01 11:34:52] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 0 ms to minimize.
[2024-06-01 11:34:52] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 1 ms to minimize.
[2024-06-01 11:34:53] [INFO ] Deduced a trap composed of 4 places in 279 ms of which 0 ms to minimize.
[2024-06-01 11:34:53] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 0 ms to minimize.
[2024-06-01 11:34:53] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-06-01 11:34:53] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2024-06-01 11:34:53] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 11:35:06] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2024-06-01 11:35:06] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 45/2148 variables, and 36 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/45 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2104/12 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 11:35:13] [INFO ] Deduced a trap composed of 4 places in 486 ms of which 0 ms to minimize.
[2024-06-01 11:35:13] [INFO ] Deduced a trap composed of 4 places in 496 ms of which 1 ms to minimize.
[2024-06-01 11:35:13] [INFO ] Deduced a trap composed of 4 places in 417 ms of which 1 ms to minimize.
[2024-06-01 11:35:14] [INFO ] Deduced a trap composed of 4 places in 417 ms of which 0 ms to minimize.
[2024-06-01 11:35:14] [INFO ] Deduced a trap composed of 4 places in 362 ms of which 1 ms to minimize.
[2024-06-01 11:35:15] [INFO ] Deduced a trap composed of 4 places in 357 ms of which 0 ms to minimize.
[2024-06-01 11:35:15] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2024-06-01 11:35:15] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 0 ms to minimize.
[2024-06-01 11:35:15] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-06-01 11:35:16] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 0 ms to minimize.
[2024-06-01 11:35:16] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 1 ms to minimize.
[2024-06-01 11:35:16] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2024-06-01 11:35:16] [INFO ] Deduced a trap composed of 4 places in 299 ms of which 1 ms to minimize.
[2024-06-01 11:35:17] [INFO ] Deduced a trap composed of 4 places in 327 ms of which 0 ms to minimize.
[2024-06-01 11:35:17] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 0 ms to minimize.
[2024-06-01 11:35:17] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-06-01 11:35:17] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2024-06-01 11:35:18] [INFO ] Deduced a trap composed of 4 places in 367 ms of which 1 ms to minimize.
[2024-06-01 11:35:18] [INFO ] Deduced a trap composed of 4 places in 374 ms of which 1 ms to minimize.
[2024-06-01 11:35:19] [INFO ] Deduced a trap composed of 4 places in 364 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 11:35:19] [INFO ] Deduced a trap composed of 4 places in 441 ms of which 1 ms to minimize.
[2024-06-01 11:35:20] [INFO ] Deduced a trap composed of 4 places in 378 ms of which 0 ms to minimize.
[2024-06-01 11:35:20] [INFO ] Deduced a trap composed of 4 places in 331 ms of which 1 ms to minimize.
[2024-06-01 11:35:21] [INFO ] Deduced a trap composed of 4 places in 336 ms of which 1 ms to minimize.
[2024-06-01 11:35:21] [INFO ] Deduced a trap composed of 4 places in 330 ms of which 1 ms to minimize.
[2024-06-01 11:35:21] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
[2024-06-01 11:35:21] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-06-01 11:35:22] [INFO ] Deduced a trap composed of 4 places in 279 ms of which 0 ms to minimize.
[2024-06-01 11:35:22] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 1 ms to minimize.
[2024-06-01 11:35:22] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2024-06-01 11:35:22] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2024-06-01 11:35:22] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2024-06-01 11:35:23] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 0 ms to minimize.
[2024-06-01 11:35:23] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 0 ms to minimize.
[2024-06-01 11:35:23] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2024-06-01 11:35:23] [INFO ] Deduced a trap composed of 4 places in 464 ms of which 0 ms to minimize.
[2024-06-01 11:35:24] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2024-06-01 11:35:24] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 1 ms to minimize.
[2024-06-01 11:35:24] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 1 ms to minimize.
[2024-06-01 11:35:25] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 11:35:26] [INFO ] Deduced a trap composed of 4 places in 447 ms of which 0 ms to minimize.
[2024-06-01 11:35:26] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 1 ms to minimize.
[2024-06-01 11:35:27] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 1 ms to minimize.
[2024-06-01 11:35:27] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 1 ms to minimize.
[2024-06-01 11:35:27] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 1 ms to minimize.
[2024-06-01 11:35:28] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 1 ms to minimize.
[2024-06-01 11:35:28] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 1 ms to minimize.
[2024-06-01 11:35:28] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 1 ms to minimize.
[2024-06-01 11:35:28] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 0 ms to minimize.
[2024-06-01 11:35:29] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 0 ms to minimize.
[2024-06-01 11:35:29] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 0 ms to minimize.
[2024-06-01 11:35:29] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 0 ms to minimize.
[2024-06-01 11:35:29] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 0 ms to minimize.
[2024-06-01 11:35:29] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2024-06-01 11:35:30] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2024-06-01 11:35:30] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
[2024-06-01 11:35:30] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 0 ms to minimize.
[2024-06-01 11:35:30] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2024-06-01 11:35:30] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2024-06-01 11:35:31] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 11:35:32] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 1 ms to minimize.
[2024-06-01 11:35:32] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 0 ms to minimize.
[2024-06-01 11:35:32] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2024-06-01 11:35:33] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 0 ms to minimize.
[2024-06-01 11:35:33] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 1 ms to minimize.
[2024-06-01 11:35:33] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 1 ms to minimize.
[2024-06-01 11:35:33] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-06-01 11:35:33] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2024-06-01 11:35:34] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2024-06-01 11:35:34] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 45/2148 variables, and 106 constraints, problems are : Problem set: 11 solved, 2093 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/45 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2092/12 constraints, Known Traps: 105/105 constraints]
After SMT, in 92574ms problems are : Problem set: 11 solved, 2093 unsolved
Search for dead transitions found 11 dead transitions in 92593ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 45/45 places, 2104/2126 transitions.
Graph (complete) has 408 edges and 45 vertex of which 34 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.6 ms
Discarding 11 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 776 ms. Remains 34 /45 variables (removed 11) and now considering 2104/2104 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/45 places, 2104/2126 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 95301 ms. Remains : 34/45 places, 2104/2126 transitions.
Support contains 11 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 2126/2126 transitions.
Applied a total of 0 rules in 6 ms. Remains 45 /45 variables (removed 0) and now considering 2126/2126 (removed 0) transitions.
[2024-06-01 11:35:38] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
// Phase 1: matrix 2114 rows 45 cols
[2024-06-01 11:35:38] [INFO ] Computed 1 invariants in 9 ms
[2024-06-01 11:35:38] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 11:35:38] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-06-01 11:35:38] [INFO ] Invariant cache hit.
[2024-06-01 11:35:39] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 11:35:39] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
Running 2115 sub problems to find dead transitions.
[2024-06-01 11:35:39] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-06-01 11:35:39] [INFO ] Invariant cache hit.
[2024-06-01 11:35:39] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-06-01 11:36:25] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
[2024-06-01 11:36:25] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 0 ms to minimize.
[2024-06-01 11:36:25] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
[2024-06-01 11:36:25] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2024-06-01 11:36:26] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 0 ms to minimize.
[2024-06-01 11:36:26] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2024-06-01 11:36:26] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2024-06-01 11:36:26] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2024-06-01 11:36:26] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2024-06-01 11:36:26] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2024-06-01 11:36:27] [INFO ] Deduced a trap composed of 5 places in 543 ms of which 1 ms to minimize.
[2024-06-01 11:36:27] [INFO ] Deduced a trap composed of 5 places in 494 ms of which 1 ms to minimize.
[2024-06-01 11:36:28] [INFO ] Deduced a trap composed of 6 places in 402 ms of which 1 ms to minimize.
[2024-06-01 11:36:28] [INFO ] Deduced a trap composed of 5 places in 399 ms of which 0 ms to minimize.
[2024-06-01 11:36:28] [INFO ] Deduced a trap composed of 5 places in 405 ms of which 0 ms to minimize.
[2024-06-01 11:36:29] [INFO ] Deduced a trap composed of 5 places in 394 ms of which 1 ms to minimize.
[2024-06-01 11:36:29] [INFO ] Deduced a trap composed of 5 places in 439 ms of which 1 ms to minimize.
[2024-06-01 11:36:30] [INFO ] Deduced a trap composed of 5 places in 397 ms of which 0 ms to minimize.
[2024-06-01 11:36:30] [INFO ] Deduced a trap composed of 5 places in 486 ms of which 0 ms to minimize.
[2024-06-01 11:36:31] [INFO ] Deduced a trap composed of 5 places in 463 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-06-01 11:36:31] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
[2024-06-01 11:36:31] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 0 ms to minimize.
[2024-06-01 11:36:31] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-06-01 11:36:31] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 0 ms to minimize.
[2024-06-01 11:36:31] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-06-01 11:36:31] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2024-06-01 11:36:32] [INFO ] Deduced a trap composed of 5 places in 400 ms of which 1 ms to minimize.
[2024-06-01 11:36:32] [INFO ] Deduced a trap composed of 6 places in 340 ms of which 1 ms to minimize.
[2024-06-01 11:36:33] [INFO ] Deduced a trap composed of 5 places in 335 ms of which 1 ms to minimize.
[2024-06-01 11:36:33] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 1 ms to minimize.
[2024-06-01 11:36:33] [INFO ] Deduced a trap composed of 6 places in 337 ms of which 0 ms to minimize.
[2024-06-01 11:36:33] [INFO ] Deduced a trap composed of 5 places in 266 ms of which 0 ms to minimize.
[2024-06-01 11:36:34] [INFO ] Deduced a trap composed of 5 places in 283 ms of which 1 ms to minimize.
[2024-06-01 11:36:34] [INFO ] Deduced a trap composed of 6 places in 216 ms of which 1 ms to minimize.
[2024-06-01 11:36:34] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-06-01 11:36:47] [INFO ] Deduced a trap composed of 5 places in 401 ms of which 1 ms to minimize.
[2024-06-01 11:36:48] [INFO ] Deduced a trap composed of 5 places in 364 ms of which 1 ms to minimize.
[2024-06-01 11:36:48] [INFO ] Deduced a trap composed of 5 places in 343 ms of which 0 ms to minimize.
[2024-06-01 11:36:48] [INFO ] Deduced a trap composed of 5 places in 335 ms of which 1 ms to minimize.
SMT process timed out in 69321ms, After SMT, problems are : Problem set: 0 solved, 2115 unsolved
Search for dead transitions found 0 dead transitions in 69346ms
Finished structural reductions in LTL mode , in 1 iterations and 70059 ms. Remains : 45/45 places, 2126/2126 transitions.
Treatment of property StigmergyCommit-PT-10a-LTLFireability-07 finished in 322266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : StigmergyCommit-PT-10a-LTLFireability-14
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 136 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 136/136 places, 4286/4286 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 135 transition count 4251
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 101 transition count 4251
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 68 place count 101 transition count 4240
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 90 transition count 4240
Performed 34 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 158 place count 56 transition count 4194
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 2 with 2047 rules applied. Total rules applied 2205 place count 56 transition count 2147
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 3 with 20 rules applied. Total rules applied 2225 place count 46 transition count 2137
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 2235 place count 46 transition count 2127
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2236 place count 45 transition count 2126
Applied a total of 2236 rules in 299 ms. Remains 45 /136 variables (removed 91) and now considering 2126/4286 (removed 2160) transitions.
[2024-06-01 11:36:49] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-06-01 11:36:49] [INFO ] Invariant cache hit.
[2024-06-01 11:36:49] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 11:36:49] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-06-01 11:36:49] [INFO ] Invariant cache hit.
[2024-06-01 11:36:50] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 11:36:50] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
Running 2115 sub problems to find dead transitions.
[2024-06-01 11:36:50] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-06-01 11:36:50] [INFO ] Invariant cache hit.
[2024-06-01 11:36:50] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-06-01 11:37:29] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2024-06-01 11:37:30] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2024-06-01 11:37:30] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-06-01 11:37:30] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-06-01 11:37:30] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2024-06-01 11:37:30] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-06-01 11:37:30] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 1 ms to minimize.
[2024-06-01 11:37:30] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2024-06-01 11:37:30] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 0 ms to minimize.
[2024-06-01 11:37:30] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 0 ms to minimize.
[2024-06-01 11:37:31] [INFO ] Deduced a trap composed of 5 places in 588 ms of which 0 ms to minimize.
[2024-06-01 11:37:31] [INFO ] Deduced a trap composed of 5 places in 504 ms of which 0 ms to minimize.
[2024-06-01 11:37:32] [INFO ] Deduced a trap composed of 6 places in 446 ms of which 1 ms to minimize.
[2024-06-01 11:37:32] [INFO ] Deduced a trap composed of 5 places in 458 ms of which 1 ms to minimize.
[2024-06-01 11:37:33] [INFO ] Deduced a trap composed of 5 places in 423 ms of which 1 ms to minimize.
[2024-06-01 11:37:33] [INFO ] Deduced a trap composed of 5 places in 459 ms of which 1 ms to minimize.
[2024-06-01 11:37:34] [INFO ] Deduced a trap composed of 5 places in 446 ms of which 0 ms to minimize.
[2024-06-01 11:37:34] [INFO ] Deduced a trap composed of 5 places in 366 ms of which 1 ms to minimize.
[2024-06-01 11:37:35] [INFO ] Deduced a trap composed of 5 places in 527 ms of which 1 ms to minimize.
[2024-06-01 11:37:35] [INFO ] Deduced a trap composed of 5 places in 516 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-06-01 11:37:36] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2024-06-01 11:37:36] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-06-01 11:37:36] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-06-01 11:37:36] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-06-01 11:37:36] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-06-01 11:37:36] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-06-01 11:37:36] [INFO ] Deduced a trap composed of 5 places in 417 ms of which 0 ms to minimize.
[2024-06-01 11:37:37] [INFO ] Deduced a trap composed of 6 places in 310 ms of which 1 ms to minimize.
[2024-06-01 11:37:37] [INFO ] Deduced a trap composed of 5 places in 308 ms of which 0 ms to minimize.
[2024-06-01 11:37:37] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 0 ms to minimize.
[2024-06-01 11:37:38] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 1 ms to minimize.
[2024-06-01 11:37:38] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 1 ms to minimize.
[2024-06-01 11:37:38] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 1 ms to minimize.
[2024-06-01 11:37:38] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 1 ms to minimize.
[2024-06-01 11:37:39] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-06-01 11:37:52] [INFO ] Deduced a trap composed of 5 places in 401 ms of which 1 ms to minimize.
[2024-06-01 11:37:52] [INFO ] Deduced a trap composed of 5 places in 362 ms of which 0 ms to minimize.
[2024-06-01 11:37:52] [INFO ] Deduced a trap composed of 5 places in 341 ms of which 1 ms to minimize.
[2024-06-01 11:37:53] [INFO ] Deduced a trap composed of 5 places in 301 ms of which 0 ms to minimize.
SMT process timed out in 62791ms, After SMT, problems are : Problem set: 0 solved, 2115 unsolved
Search for dead transitions found 0 dead transitions in 62812ms
Starting structural reductions in LI_LTL mode, iteration 1 : 45/136 places, 2126/4286 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 63833 ms. Remains : 45/136 places, 2126/4286 transitions.
Running random walk in product with property : StigmergyCommit-PT-10a-LTLFireability-14
Product exploration explored 100000 steps with 8333 reset in 4611 ms.
Product exploration explored 100000 steps with 8333 reset in 4636 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 44 steps (0 resets) in 8 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 11:38:03] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-06-01 11:38:03] [INFO ] Invariant cache hit.
[2024-06-01 11:38:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 11:38:04] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2024-06-01 11:38:04] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 11:38:05] [INFO ] [Real]Added 2069 Read/Feed constraints in 185 ms returned sat
[2024-06-01 11:38:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:38:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 11:38:06] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2024-06-01 11:38:06] [INFO ] [Nat]Added 2069 Read/Feed constraints in 224 ms returned sat
[2024-06-01 11:38:07] [INFO ] Computed and/alt/rep : 11/11/11 causal constraints (skipped 2092 transitions) in 242 ms.
[2024-06-01 11:38:07] [INFO ] Added : 0 causal constraints over 0 iterations in 415 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 2126/2126 transitions.
Applied a total of 0 rules in 8 ms. Remains 45 /45 variables (removed 0) and now considering 2126/2126 (removed 0) transitions.
[2024-06-01 11:38:07] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-06-01 11:38:07] [INFO ] Invariant cache hit.
[2024-06-01 11:38:07] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 11:38:07] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-06-01 11:38:07] [INFO ] Invariant cache hit.
[2024-06-01 11:38:07] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 11:38:08] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
Running 2115 sub problems to find dead transitions.
[2024-06-01 11:38:08] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-06-01 11:38:08] [INFO ] Invariant cache hit.
[2024-06-01 11:38:08] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-06-01 11:38:51] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
[2024-06-01 11:38:51] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 0 ms to minimize.
[2024-06-01 11:38:51] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-06-01 11:38:52] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-06-01 11:38:52] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 0 ms to minimize.
[2024-06-01 11:38:52] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 0 ms to minimize.
[2024-06-01 11:38:52] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2024-06-01 11:38:52] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2024-06-01 11:38:52] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 0 ms to minimize.
[2024-06-01 11:38:52] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2024-06-01 11:38:53] [INFO ] Deduced a trap composed of 5 places in 605 ms of which 1 ms to minimize.
[2024-06-01 11:38:53] [INFO ] Deduced a trap composed of 5 places in 503 ms of which 0 ms to minimize.
[2024-06-01 11:38:54] [INFO ] Deduced a trap composed of 6 places in 448 ms of which 0 ms to minimize.
[2024-06-01 11:38:54] [INFO ] Deduced a trap composed of 5 places in 447 ms of which 0 ms to minimize.
[2024-06-01 11:38:55] [INFO ] Deduced a trap composed of 5 places in 459 ms of which 1 ms to minimize.
[2024-06-01 11:38:55] [INFO ] Deduced a trap composed of 5 places in 429 ms of which 1 ms to minimize.
[2024-06-01 11:38:56] [INFO ] Deduced a trap composed of 5 places in 450 ms of which 1 ms to minimize.
[2024-06-01 11:38:56] [INFO ] Deduced a trap composed of 5 places in 388 ms of which 0 ms to minimize.
[2024-06-01 11:38:57] [INFO ] Deduced a trap composed of 5 places in 510 ms of which 0 ms to minimize.
[2024-06-01 11:38:57] [INFO ] Deduced a trap composed of 5 places in 515 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-06-01 11:38:58] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-06-01 11:38:58] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 0 ms to minimize.
[2024-06-01 11:38:58] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-06-01 11:38:58] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-06-01 11:38:58] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2024-06-01 11:38:58] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-06-01 11:38:58] [INFO ] Deduced a trap composed of 5 places in 380 ms of which 0 ms to minimize.
[2024-06-01 11:38:59] [INFO ] Deduced a trap composed of 6 places in 317 ms of which 1 ms to minimize.
[2024-06-01 11:38:59] [INFO ] Deduced a trap composed of 5 places in 300 ms of which 1 ms to minimize.
[2024-06-01 11:38:59] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 1 ms to minimize.
[2024-06-01 11:39:00] [INFO ] Deduced a trap composed of 6 places in 348 ms of which 0 ms to minimize.
[2024-06-01 11:39:00] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 0 ms to minimize.
[2024-06-01 11:39:00] [INFO ] Deduced a trap composed of 5 places in 264 ms of which 1 ms to minimize.
[2024-06-01 11:39:00] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 1 ms to minimize.
[2024-06-01 11:39:01] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-06-01 11:39:14] [INFO ] Deduced a trap composed of 5 places in 409 ms of which 1 ms to minimize.
[2024-06-01 11:39:14] [INFO ] Deduced a trap composed of 5 places in 397 ms of which 1 ms to minimize.
[2024-06-01 11:39:14] [INFO ] Deduced a trap composed of 5 places in 345 ms of which 0 ms to minimize.
SMT process timed out in 66779ms, After SMT, problems are : Problem set: 0 solved, 2115 unsolved
Search for dead transitions found 0 dead transitions in 66799ms
Finished structural reductions in LTL mode , in 1 iterations and 67518 ms. Remains : 45/45 places, 2126/2126 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 44 steps (0 resets) in 11 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 11:39:15] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-06-01 11:39:15] [INFO ] Invariant cache hit.
[2024-06-01 11:39:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 11:39:17] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2024-06-01 11:39:17] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 11:39:17] [INFO ] [Real]Added 2069 Read/Feed constraints in 190 ms returned sat
[2024-06-01 11:39:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:39:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 11:39:19] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2024-06-01 11:39:19] [INFO ] [Nat]Added 2069 Read/Feed constraints in 237 ms returned sat
[2024-06-01 11:39:19] [INFO ] Computed and/alt/rep : 11/11/11 causal constraints (skipped 2092 transitions) in 247 ms.
[2024-06-01 11:39:19] [INFO ] Added : 0 causal constraints over 0 iterations in 425 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8333 reset in 4612 ms.
Product exploration explored 100000 steps with 8333 reset in 4596 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 2126/2126 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 45 transition count 2115
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 45 transition count 2115
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 22 rules in 1689 ms. Remains 45 /45 variables (removed 0) and now considering 2115/2126 (removed 11) transitions.
[2024-06-01 11:39:31] [INFO ] Redundant transitions in 283 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-06-01 11:39:31] [INFO ] Flow matrix only has 2103 transitions (discarded 12 similar events)
// Phase 1: matrix 2103 rows 45 cols
[2024-06-01 11:39:31] [INFO ] Computed 1 invariants in 11 ms
[2024-06-01 11:39:31] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 11:40:13] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2024-06-01 11:40:13] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-06-01 11:40:13] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-06-01 11:40:13] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 11:40:13] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-06-01 11:40:13] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-06-01 11:40:13] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-06-01 11:40:13] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 11:40:14] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-06-01 11:40:14] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 11:40:14] [INFO ] Deduced a trap composed of 4 places in 632 ms of which 1 ms to minimize.
[2024-06-01 11:40:15] [INFO ] Deduced a trap composed of 4 places in 549 ms of which 0 ms to minimize.
[2024-06-01 11:40:15] [INFO ] Deduced a trap composed of 4 places in 458 ms of which 0 ms to minimize.
[2024-06-01 11:40:16] [INFO ] Deduced a trap composed of 4 places in 454 ms of which 1 ms to minimize.
[2024-06-01 11:40:16] [INFO ] Deduced a trap composed of 4 places in 512 ms of which 0 ms to minimize.
[2024-06-01 11:40:17] [INFO ] Deduced a trap composed of 4 places in 502 ms of which 1 ms to minimize.
[2024-06-01 11:40:17] [INFO ] Deduced a trap composed of 4 places in 429 ms of which 1 ms to minimize.
[2024-06-01 11:40:18] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 1 ms to minimize.
[2024-06-01 11:40:18] [INFO ] Deduced a trap composed of 4 places in 371 ms of which 0 ms to minimize.
[2024-06-01 11:40:18] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 11:40:19] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-06-01 11:40:19] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 1 ms to minimize.
[2024-06-01 11:40:19] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 1 ms to minimize.
[2024-06-01 11:40:20] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 1 ms to minimize.
[2024-06-01 11:40:20] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 0 ms to minimize.
[2024-06-01 11:40:20] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2024-06-01 11:40:20] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 1 ms to minimize.
[2024-06-01 11:40:21] [INFO ] Deduced a trap composed of 4 places in 272 ms of which 0 ms to minimize.
[2024-06-01 11:40:21] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 0 ms to minimize.
[2024-06-01 11:40:21] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 1 ms to minimize.
[2024-06-01 11:40:21] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 1 ms to minimize.
[2024-06-01 11:40:22] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 0 ms to minimize.
[2024-06-01 11:40:22] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 11:40:34] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2024-06-01 11:40:34] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 45/2148 variables, and 36 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/45 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2104/12 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 11:40:41] [INFO ] Deduced a trap composed of 4 places in 523 ms of which 0 ms to minimize.
[2024-06-01 11:40:41] [INFO ] Deduced a trap composed of 4 places in 496 ms of which 1 ms to minimize.
[2024-06-01 11:40:42] [INFO ] Deduced a trap composed of 4 places in 435 ms of which 1 ms to minimize.
[2024-06-01 11:40:42] [INFO ] Deduced a trap composed of 4 places in 446 ms of which 1 ms to minimize.
[2024-06-01 11:40:42] [INFO ] Deduced a trap composed of 4 places in 385 ms of which 1 ms to minimize.
[2024-06-01 11:40:43] [INFO ] Deduced a trap composed of 4 places in 378 ms of which 1 ms to minimize.
[2024-06-01 11:40:43] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 0 ms to minimize.
[2024-06-01 11:40:43] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 0 ms to minimize.
[2024-06-01 11:40:44] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 0 ms to minimize.
[2024-06-01 11:40:44] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 0 ms to minimize.
[2024-06-01 11:40:44] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 0 ms to minimize.
[2024-06-01 11:40:44] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 1 ms to minimize.
[2024-06-01 11:40:45] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 1 ms to minimize.
[2024-06-01 11:40:45] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 0 ms to minimize.
[2024-06-01 11:40:45] [INFO ] Deduced a trap composed of 4 places in 266 ms of which 1 ms to minimize.
[2024-06-01 11:40:46] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 1 ms to minimize.
[2024-06-01 11:40:46] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 0 ms to minimize.
[2024-06-01 11:40:46] [INFO ] Deduced a trap composed of 4 places in 380 ms of which 1 ms to minimize.
[2024-06-01 11:40:46] [INFO ] Deduced a trap composed of 4 places in 374 ms of which 1 ms to minimize.
[2024-06-01 11:40:47] [INFO ] Deduced a trap composed of 4 places in 382 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 11:40:48] [INFO ] Deduced a trap composed of 4 places in 422 ms of which 0 ms to minimize.
[2024-06-01 11:40:48] [INFO ] Deduced a trap composed of 4 places in 346 ms of which 1 ms to minimize.
[2024-06-01 11:40:49] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 0 ms to minimize.
[2024-06-01 11:40:49] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 0 ms to minimize.
[2024-06-01 11:40:49] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 0 ms to minimize.
[2024-06-01 11:40:49] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 0 ms to minimize.
[2024-06-01 11:40:50] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 1 ms to minimize.
[2024-06-01 11:40:50] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 1 ms to minimize.
[2024-06-01 11:40:50] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2024-06-01 11:40:50] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
[2024-06-01 11:40:50] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2024-06-01 11:40:51] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 0 ms to minimize.
[2024-06-01 11:40:51] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 0 ms to minimize.
[2024-06-01 11:40:51] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 0 ms to minimize.
[2024-06-01 11:40:51] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-06-01 11:40:52] [INFO ] Deduced a trap composed of 4 places in 444 ms of which 4 ms to minimize.
[2024-06-01 11:40:52] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2024-06-01 11:40:52] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 1 ms to minimize.
[2024-06-01 11:40:52] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 0 ms to minimize.
[2024-06-01 11:40:53] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 11:40:54] [INFO ] Deduced a trap composed of 4 places in 432 ms of which 1 ms to minimize.
[2024-06-01 11:40:54] [INFO ] Deduced a trap composed of 4 places in 320 ms of which 0 ms to minimize.
[2024-06-01 11:40:55] [INFO ] Deduced a trap composed of 4 places in 366 ms of which 0 ms to minimize.
[2024-06-01 11:40:55] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 1 ms to minimize.
[2024-06-01 11:40:55] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 1 ms to minimize.
[2024-06-01 11:40:56] [INFO ] Deduced a trap composed of 4 places in 324 ms of which 1 ms to minimize.
[2024-06-01 11:40:56] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 0 ms to minimize.
[2024-06-01 11:40:56] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 0 ms to minimize.
[2024-06-01 11:40:56] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 0 ms to minimize.
[2024-06-01 11:40:57] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 0 ms to minimize.
[2024-06-01 11:40:57] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 1 ms to minimize.
[2024-06-01 11:40:57] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 1 ms to minimize.
[2024-06-01 11:40:57] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2024-06-01 11:40:57] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2024-06-01 11:40:58] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2024-06-01 11:40:58] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 1 ms to minimize.
[2024-06-01 11:40:58] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2024-06-01 11:40:58] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2024-06-01 11:40:58] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 0 ms to minimize.
[2024-06-01 11:40:59] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-06-01 11:41:00] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 0 ms to minimize.
[2024-06-01 11:41:00] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 0 ms to minimize.
[2024-06-01 11:41:00] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2024-06-01 11:41:01] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 1 ms to minimize.
[2024-06-01 11:41:01] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 0 ms to minimize.
[2024-06-01 11:41:01] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 1 ms to minimize.
[2024-06-01 11:41:01] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2024-06-01 11:41:01] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 1 ms to minimize.
[2024-06-01 11:41:02] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2024-06-01 11:41:02] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 45/2148 variables, and 106 constraints, problems are : Problem set: 11 solved, 2093 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/45 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2092/12 constraints, Known Traps: 105/105 constraints]
After SMT, in 94480ms problems are : Problem set: 11 solved, 2093 unsolved
Search for dead transitions found 11 dead transitions in 94500ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 45/45 places, 2104/2126 transitions.
Graph (complete) has 408 edges and 45 vertex of which 34 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.6 ms
Discarding 11 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 754 ms. Remains 34 /45 variables (removed 11) and now considering 2104/2104 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/45 places, 2104/2126 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 97238 ms. Remains : 34/45 places, 2104/2126 transitions.
Support contains 11 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 2126/2126 transitions.
Applied a total of 0 rules in 6 ms. Remains 45 /45 variables (removed 0) and now considering 2126/2126 (removed 0) transitions.
[2024-06-01 11:41:06] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
// Phase 1: matrix 2114 rows 45 cols
[2024-06-01 11:41:06] [INFO ] Computed 1 invariants in 8 ms
[2024-06-01 11:41:06] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 11:41:06] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-06-01 11:41:06] [INFO ] Invariant cache hit.
[2024-06-01 11:41:07] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 11:41:07] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
Running 2115 sub problems to find dead transitions.
[2024-06-01 11:41:07] [INFO ] Flow matrix only has 2114 transitions (discarded 12 similar events)
[2024-06-01 11:41:07] [INFO ] Invariant cache hit.
[2024-06-01 11:41:07] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-06-01 11:41:47] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2024-06-01 11:41:47] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2024-06-01 11:41:47] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-06-01 11:41:47] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 0 ms to minimize.
[2024-06-01 11:41:47] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 1 ms to minimize.
[2024-06-01 11:41:47] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 0 ms to minimize.
[2024-06-01 11:41:47] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2024-06-01 11:41:47] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 0 ms to minimize.
[2024-06-01 11:41:47] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2024-06-01 11:41:47] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2024-06-01 11:41:48] [INFO ] Deduced a trap composed of 5 places in 581 ms of which 1 ms to minimize.
[2024-06-01 11:41:49] [INFO ] Deduced a trap composed of 5 places in 463 ms of which 1 ms to minimize.
[2024-06-01 11:41:49] [INFO ] Deduced a trap composed of 6 places in 428 ms of which 0 ms to minimize.
[2024-06-01 11:41:49] [INFO ] Deduced a trap composed of 5 places in 408 ms of which 1 ms to minimize.
[2024-06-01 11:41:50] [INFO ] Deduced a trap composed of 5 places in 415 ms of which 1 ms to minimize.
[2024-06-01 11:41:50] [INFO ] Deduced a trap composed of 5 places in 455 ms of which 0 ms to minimize.
[2024-06-01 11:41:51] [INFO ] Deduced a trap composed of 5 places in 440 ms of which 1 ms to minimize.
[2024-06-01 11:41:51] [INFO ] Deduced a trap composed of 5 places in 384 ms of which 1 ms to minimize.
[2024-06-01 11:41:52] [INFO ] Deduced a trap composed of 5 places in 512 ms of which 0 ms to minimize.
[2024-06-01 11:41:52] [INFO ] Deduced a trap composed of 5 places in 512 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-06-01 11:41:53] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 0 ms to minimize.
[2024-06-01 11:41:53] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2024-06-01 11:41:53] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-06-01 11:41:53] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2024-06-01 11:41:53] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-06-01 11:41:53] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 0 ms to minimize.
[2024-06-01 11:41:53] [INFO ] Deduced a trap composed of 5 places in 393 ms of which 0 ms to minimize.
[2024-06-01 11:41:54] [INFO ] Deduced a trap composed of 6 places in 317 ms of which 0 ms to minimize.
[2024-06-01 11:41:54] [INFO ] Deduced a trap composed of 5 places in 340 ms of which 1 ms to minimize.
[2024-06-01 11:41:54] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 0 ms to minimize.
[2024-06-01 11:41:55] [INFO ] Deduced a trap composed of 6 places in 314 ms of which 0 ms to minimize.
[2024-06-01 11:41:55] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 0 ms to minimize.
[2024-06-01 11:41:55] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 0 ms to minimize.
[2024-06-01 11:41:55] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 12 ms to minimize.
[2024-06-01 11:41:56] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
[2024-06-01 11:42:08] [INFO ] Deduced a trap composed of 5 places in 382 ms of which 1 ms to minimize.
[2024-06-01 11:42:08] [INFO ] Deduced a trap composed of 5 places in 374 ms of which 1 ms to minimize.
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 5 places in 317 ms of which 1 ms to minimize.
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 5 places in 323 ms of which 1 ms to minimize.
SMT process timed out in 62251ms, After SMT, problems are : Problem set: 0 solved, 2115 unsolved
Search for dead transitions found 0 dead transitions in 62271ms
Finished structural reductions in LTL mode , in 1 iterations and 62966 ms. Remains : 45/45 places, 2126/2126 transitions.
Treatment of property StigmergyCommit-PT-10a-LTLFireability-14 finished in 320815 ms.
[2024-06-01 11:42:10] [INFO ] Flatten gal took : 265 ms
[2024-06-01 11:42:10] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 11:42:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 136 places, 4286 transitions and 90702 arcs took 62 ms.
Total runtime 2808108 ms.
There are residual formulas that ITS could not solve within timeout
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
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="StigmergyCommit-PT-10a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is StigmergyCommit-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 r536-tall-171690531800220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-10a.tgz
mv StigmergyCommit-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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;