About the Execution of ITS-Tools for FlexibleBarrier-PT-10a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 502645.00 | 0.00 | 0.00 | FFFFFTFFTFTFFFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102500452.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is FlexibleBarrier-PT-10a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102500452
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 94K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748931104272
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 06:11:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 06:11:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 06:11:47] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2025-06-03 06:11:47] [INFO ] Transformed 123 places.
[2025-06-03 06:11:47] [INFO ] Transformed 334 transitions.
[2025-06-03 06:11:47] [INFO ] Found NUPN structural information;
[2025-06-03 06:11:47] [INFO ] Parsed PT model containing 123 places and 334 transitions and 1467 arcs in 419 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 82 transitions
Reduce redundant transitions removed 82 transitions.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 252/252 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 123 transition count 242
Applied a total of 10 rules in 60 ms. Remains 123 /123 variables (removed 0) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 123 cols
[2025-06-03 06:11:47] [INFO ] Computed 12 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:11:48] [INFO ] Implicit Places using invariants in 488 ms returned []
[2025-06-03 06:11:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:11:48] [INFO ] State equation strengthened by 141 read => feed constraints.
[2025-06-03 06:11:48] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 1066 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-03 06:11:48] [INFO ] Invariant cache hit.
[2025-06-03 06:11:48] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 24747 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 22654 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47725ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 47768ms
Starting structural reductions in LTL mode, iteration 1 : 123/123 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48959 ms. Remains : 123/123 places, 242/252 transitions.
Support contains 35 out of 123 places after structural reductions.
[2025-06-03 06:12:37] [INFO ] Flatten gal took : 93 ms
[2025-06-03 06:12:37] [INFO ] Flatten gal took : 50 ms
[2025-06-03 06:12:37] [INFO ] Input system was already deterministic with 242 transitions.
Reduction of identical properties reduced properties to check from 37 to 33
RANDOM walk for 7551 steps (0 resets) in 642 ms. (11 steps per ms) remains 0/33 properties
Computed a total of 3 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((p1||F(G(p2)))&&p0)))))'
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-03 06:12:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:12:38] [INFO ] Implicit Places using invariants in 243 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 251 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 9 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 266 ms. Remains : 122/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 498 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-00
Product exploration explored 100000 steps with 66 reset in 879 ms.
Stack based approach found an accepted trace after 59 steps with 0 reset with depth 60 and stack size 60 in 1 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-00 finished in 1736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-03 06:12:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:12:40] [INFO ] Implicit Places using invariants in 176 ms returned [121]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 177 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 6 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 189 ms. Remains : 122/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, p0, p0]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-01
Entered a terminal (fully accepting) state of product in 458 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-01 finished in 319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(((F(p0) U G((p1&&X(p1)))) U X(X(p2)))) U p3))'
Support contains 7 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 9 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-03 06:12:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:12:40] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-06-03 06:12:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:12:40] [INFO ] State equation strengthened by 141 read => feed constraints.
[2025-06-03 06:12:40] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-03 06:12:40] [INFO ] Invariant cache hit.
[2025-06-03 06:12:40] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 23674 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 22728 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46533ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 46537ms
Finished structural reductions in LTL mode , in 1 iterations and 47075 ms. Remains : 123/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 324 ms :[(NOT p3), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-02
Product exploration explored 100000 steps with 8874 reset in 659 ms.
Stack based approach found an accepted trace after 215 steps with 31 reset with depth 81 and stack size 81 in 2 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-02 finished in 48122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((X((X(X(p1))&&G(p2))) U (!p3&&X((X(X(p1))&&G(p2))))))||p0))))'
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-03 06:13:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:13:28] [INFO ] Implicit Places using invariants in 162 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 165 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 175 ms. Remains : 122/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 402 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)), (OR (NOT p1) (NOT p2) p3), (OR (NOT p2) (NOT p1)), true, (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 722 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-03 finished in 627 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(X(F(p1))))))'
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-03 06:13:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:13:29] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-03 06:13:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:13:29] [INFO ] State equation strengthened by 141 read => feed constraints.
[2025-06-03 06:13:29] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-03 06:13:29] [INFO ] Invariant cache hit.
[2025-06-03 06:13:29] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 23709 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 21721 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45539ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 45542ms
Finished structural reductions in LTL mode , in 1 iterations and 45897 ms. Remains : 123/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-05
Product exploration explored 100000 steps with 25000 reset in 507 ms.
Product exploration explored 100000 steps with 25000 reset in 532 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Computed a total of 3 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 24095 steps (5 resets) in 183 ms. (130 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 270 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-03 06:14:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:14:17] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-03 06:14:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:14:17] [INFO ] State equation strengthened by 141 read => feed constraints.
[2025-06-03 06:14:17] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-03 06:14:17] [INFO ] Invariant cache hit.
[2025-06-03 06:14:17] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 23217 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 22556 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45816ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 45817ms
Finished structural reductions in LTL mode , in 1 iterations and 46190 ms. Remains : 123/123 places, 242/242 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Computed a total of 3 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 3976 steps (0 resets) in 25 ms. (152 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 297 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 900 ms.
Product exploration explored 100000 steps with 25000 reset in 841 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 260 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 94 edges and 123 vertex of which 24 / 123 are part of one of the 8 SCC in 5 ms
Free SCC test removed 16 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 0 with 30 rules applied. Total rules applied 31 place count 107 transition count 226
Deduced a syphon composed of 30 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 0 with 58 rules applied. Total rules applied 89 place count 107 transition count 168
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 89 rules in 71 ms. Remains 107 /123 variables (removed 16) and now considering 168/242 (removed 74) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:15:07] [INFO ] Redundant transitions in 31 ms returned [87]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 166 sub problems to find dead transitions.
[2025-06-03 06:15:07] [INFO ] Flow matrix only has 150 transitions (discarded 17 similar events)
// Phase 1: matrix 150 rows 107 cols
[2025-06-03 06:15:07] [INFO ] Computed 12 invariants in 11 ms
[2025-06-03 06:15:07] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:10] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 14 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:10] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 3 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:10] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 3 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:10] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 4 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:10] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 3 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:10] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 3 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:10] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 4 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:11] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 3 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:11] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:11] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 3 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD162 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 10/129 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/129 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 149/256 variables, 107/236 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 71/307 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/307 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 1/257 variables, 1/308 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/308 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 11 (OVERLAPS) 0/257 variables, 0/308 constraints. Problems are: Problem set: 51 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 308 constraints, problems are : Problem set: 51 solved, 115 unsolved in 15050 ms.
Refiners :[Domain max(s): 107/107 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 107/107 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 51 solved, 115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 76/76 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/76 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 31/107 variables, 12/88 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 31/119 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 10/129 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/129 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 149/256 variables, 107/236 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 71/307 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 115/422 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/422 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 1/257 variables, 1/423 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 0/423 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 12 (OVERLAPS) 0/257 variables, 0/423 constraints. Problems are: Problem set: 51 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 423 constraints, problems are : Problem set: 51 solved, 115 unsolved in 13872 ms.
Refiners :[Domain max(s): 107/107 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 107/107 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 115/166 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28960ms problems are : Problem set: 51 solved, 115 unsolved
Search for dead transitions found 51 dead transitions in 28961ms
Found 51 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 51 transitions
Dead transitions reduction (with SMT) removed 51 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 107/123 places, 116/242 transitions.
Graph (complete) has 255 edges and 107 vertex of which 77 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 77 /107 variables (removed 30) and now considering 116/116 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/123 places, 116/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 29106 ms. Remains : 77/123 places, 116/242 transitions.
Built C files in :
/tmp/ltsmin787759983641069270
[2025-06-03 06:15:36] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin787759983641069270
Running compilation step : cd /tmp/ltsmin787759983641069270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 916 ms.
Running link step : cd /tmp/ltsmin787759983641069270;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin787759983641069270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased661963933099898971.hoa' '--buchi-type=spotba'
LTSmin run took 270 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-05 finished in 128661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 99 edges and 123 vertex of which 30 / 123 are part of one of the 10 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 61 place count 73 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 0 with 45 rules applied. Total rules applied 106 place count 73 transition count 111
Applied a total of 106 rules in 39 ms. Remains 73 /123 variables (removed 50) and now considering 111/242 (removed 131) transitions.
[2025-06-03 06:15:37] [INFO ] Flow matrix only has 92 transitions (discarded 19 similar events)
// Phase 1: matrix 92 rows 73 cols
[2025-06-03 06:15:37] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:15:37] [INFO ] Implicit Places using invariants in 119 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 120 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/123 places, 111/242 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 72 transition count 102
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 63 transition count 102
Applied a total of 18 rules in 12 ms. Remains 63 /72 variables (removed 9) and now considering 102/111 (removed 9) transitions.
[2025-06-03 06:15:37] [INFO ] Flow matrix only has 83 transitions (discarded 19 similar events)
// Phase 1: matrix 83 rows 63 cols
[2025-06-03 06:15:37] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:15:37] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-03 06:15:37] [INFO ] Flow matrix only has 83 transitions (discarded 19 similar events)
[2025-06-03 06:15:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:15:38] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-03 06:15:38] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/123 places, 102/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 466 ms. Remains : 63/123 places, 102/242 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-06 finished in 535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X((X(p0)||G(p1))))||(p2 U p3))))'
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2025-06-03 06:15:38] [INFO ] Computed 12 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:15:38] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-06-03 06:15:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:15:38] [INFO ] State equation strengthened by 141 read => feed constraints.
[2025-06-03 06:15:38] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-03 06:15:38] [INFO ] Invariant cache hit.
[2025-06-03 06:15:38] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 23184 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 22158 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45419ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 45420ms
Finished structural reductions in LTL mode , in 1 iterations and 45932 ms. Remains : 123/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 685 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-07
Entered a terminal (fully accepting) state of product in 372 steps with 7 reset in 8 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-07 finished in 46673 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(p1))&&F(p2)))'
Support contains 7 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-03 06:16:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:16:25] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-03 06:16:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:16:25] [INFO ] State equation strengthened by 141 read => feed constraints.
[2025-06-03 06:16:25] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-03 06:16:25] [INFO ] Invariant cache hit.
[2025-06-03 06:16:25] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 22964 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 22240 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45274ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 45276ms
Finished structural reductions in LTL mode , in 1 iterations and 45777 ms. Remains : 123/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true, (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1405 steps with 2 reset in 10 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-09 finished in 46064 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(p0))||(X(F(p2))&&p1)))))'
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-03 06:17:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:17:11] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-03 06:17:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:17:11] [INFO ] State equation strengthened by 141 read => feed constraints.
[2025-06-03 06:17:11] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-03 06:17:11] [INFO ] Invariant cache hit.
[2025-06-03 06:17:11] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 24052 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 21487 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45614ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 45616ms
Finished structural reductions in LTL mode , in 1 iterations and 46144 ms. Remains : 123/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-10
Product exploration explored 100000 steps with 25000 reset in 853 ms.
Product exploration explored 100000 steps with 25000 reset in 667 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Computed a total of 3 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p1)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (8 resets) in 175 ms. (227 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
[2025-06-03 06:17:59] [INFO ] Invariant cache hit.
[2025-06-03 06:17:59] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 12/14 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 109/123 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 109/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 1 unsolved in 242 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf1 is UNSAT
After SMT solving in domain Int declared 2/365 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 25 ms.
Refiners :[Domain max(s): 2/123 constraints, Positive P Invariants (semi-flows): 0/12 constraints, State Equation: 0/123 constraints, ReadFeed: 0/141 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 288ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p1)), (X (X (NOT p2))), (G (OR p0 p2))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p1), (F p2), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 4 factoid took 393 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-03 06:18:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:18:00] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-06-03 06:18:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:18:00] [INFO ] State equation strengthened by 141 read => feed constraints.
[2025-06-03 06:18:00] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-03 06:18:00] [INFO ] Invariant cache hit.
[2025-06-03 06:18:00] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 22381 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 21846 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44307ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 44309ms
Finished structural reductions in LTL mode , in 1 iterations and 44824 ms. Remains : 123/123 places, 242/242 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Computed a total of 3 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 162 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 1032 steps (0 resets) in 10 ms. (93 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 255 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25652 reset in 851 ms.
Product exploration explored 100000 steps with 25630 reset in 521 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 94 edges and 123 vertex of which 24 / 123 are part of one of the 8 SCC in 0 ms
Free SCC test removed 16 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 0 with 30 rules applied. Total rules applied 31 place count 107 transition count 226
Deduced a syphon composed of 30 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 0 with 58 rules applied. Total rules applied 89 place count 107 transition count 168
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 89 rules in 16 ms. Remains 107 /123 variables (removed 16) and now considering 168/242 (removed 74) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:18:48] [INFO ] Redundant transitions in 22 ms returned [86]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 166 sub problems to find dead transitions.
[2025-06-03 06:18:48] [INFO ] Flow matrix only has 150 transitions (discarded 17 similar events)
// Phase 1: matrix 150 rows 107 cols
[2025-06-03 06:18:48] [INFO ] Computed 12 invariants in 17 ms
[2025-06-03 06:18:48] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:51] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 3 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:51] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 3 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:51] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:51] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 3 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:51] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 3 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:51] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:51] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 3 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:51] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:51] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 3 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:51] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 3 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD162 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 10/129 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/129 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 149/256 variables, 107/236 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 71/307 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/307 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 1/257 variables, 1/308 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/308 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 11 (OVERLAPS) 0/257 variables, 0/308 constraints. Problems are: Problem set: 51 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 308 constraints, problems are : Problem set: 51 solved, 115 unsolved in 14359 ms.
Refiners :[Domain max(s): 107/107 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 107/107 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 51 solved, 115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 76/76 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/76 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 31/107 variables, 12/88 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 31/119 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 10/129 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/129 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 149/256 variables, 107/236 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 71/307 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 115/422 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/422 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 1/257 variables, 1/423 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 0/423 constraints. Problems are: Problem set: 51 solved, 115 unsolved
At refinement iteration 12 (OVERLAPS) 0/257 variables, 0/423 constraints. Problems are: Problem set: 51 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 423 constraints, problems are : Problem set: 51 solved, 115 unsolved in 14044 ms.
Refiners :[Domain max(s): 107/107 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 107/107 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 115/166 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28434ms problems are : Problem set: 51 solved, 115 unsolved
Search for dead transitions found 51 dead transitions in 28436ms
Found 51 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 51 transitions
Dead transitions reduction (with SMT) removed 51 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 107/123 places, 116/242 transitions.
Graph (complete) has 255 edges and 107 vertex of which 77 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 77 /107 variables (removed 30) and now considering 116/116 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/123 places, 116/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 28487 ms. Remains : 77/123 places, 116/242 transitions.
Built C files in :
/tmp/ltsmin14629992772062588601
[2025-06-03 06:19:16] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14629992772062588601
Running compilation step : cd /tmp/ltsmin14629992772062588601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 733 ms.
Running link step : cd /tmp/ltsmin14629992772062588601;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14629992772062588601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3893094934205947551.hoa' '--buchi-type=spotba'
LTSmin run took 148 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-10 finished in 126606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((G(p0)||p1)))||(X(p2) U p3)))'
Support contains 7 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2025-06-03 06:19:17] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:19:17] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-06-03 06:19:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:19:17] [INFO ] State equation strengthened by 141 read => feed constraints.
[2025-06-03 06:19:18] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-03 06:19:18] [INFO ] Invariant cache hit.
[2025-06-03 06:19:18] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 23692 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 23267 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47025ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 47027ms
Finished structural reductions in LTL mode , in 1 iterations and 47489 ms. Remains : 123/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 259 ms :[true, (AND (NOT p0) (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-12 finished in 47769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 99 edges and 123 vertex of which 30 / 123 are part of one of the 10 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 61 place count 73 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 0 with 45 rules applied. Total rules applied 106 place count 73 transition count 111
Applied a total of 106 rules in 14 ms. Remains 73 /123 variables (removed 50) and now considering 111/242 (removed 131) transitions.
[2025-06-03 06:20:05] [INFO ] Flow matrix only has 92 transitions (discarded 19 similar events)
// Phase 1: matrix 92 rows 73 cols
[2025-06-03 06:20:05] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:20:05] [INFO ] Implicit Places using invariants in 78 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/123 places, 111/242 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 72 transition count 102
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 63 transition count 102
Applied a total of 18 rules in 7 ms. Remains 63 /72 variables (removed 9) and now considering 102/111 (removed 9) transitions.
[2025-06-03 06:20:05] [INFO ] Flow matrix only has 83 transitions (discarded 19 similar events)
// Phase 1: matrix 83 rows 63 cols
[2025-06-03 06:20:05] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:20:05] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-03 06:20:05] [INFO ] Flow matrix only has 83 transitions (discarded 19 similar events)
[2025-06-03 06:20:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:20:05] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-03 06:20:05] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/123 places, 102/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 350 ms. Remains : 63/123 places, 102/242 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-13 finished in 398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||G(p2)))'
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 93 edges and 123 vertex of which 21 / 123 are part of one of the 7 SCC in 0 ms
Free SCC test removed 14 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 0 with 62 rules applied. Total rules applied 63 place count 78 transition count 176
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 119 place count 78 transition count 120
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 78 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 77 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 77 transition count 119
Applied a total of 122 rules in 24 ms. Remains 77 /123 variables (removed 46) and now considering 119/242 (removed 123) transitions.
[2025-06-03 06:20:05] [INFO ] Flow matrix only has 103 transitions (discarded 16 similar events)
// Phase 1: matrix 103 rows 77 cols
[2025-06-03 06:20:05] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:20:05] [INFO ] Implicit Places using invariants in 122 ms returned [75, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 125 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/123 places, 119/242 transitions.
Graph (trivial) has 106 edges and 75 vertex of which 58 / 75 are part of one of the 10 SCC in 0 ms
Free SCC test removed 48 places
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 27 transition count 40
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 24 transition count 40
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 16 place count 15 transition count 28
Iterating global reduction 2 with 9 rules applied. Total rules applied 25 place count 15 transition count 28
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 29 place count 15 transition count 24
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 14 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 34 place count 12 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 37 place count 12 transition count 19
Applied a total of 37 rules in 8 ms. Remains 12 /75 variables (removed 63) and now considering 19/119 (removed 100) transitions.
[2025-06-03 06:20:05] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 12 cols
[2025-06-03 06:20:05] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:20:05] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-03 06:20:05] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
[2025-06-03 06:20:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:20:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 06:20:05] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/123 places, 19/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 211 ms. Remains : 12/123 places, 19/242 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Product exploration explored 100000 steps with 50000 reset in 101 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 18 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-10a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-14 finished in 574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(((p0 U p1)&&G(p2)))&&G(F(p3))))'
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 91 edges and 123 vertex of which 24 / 123 are part of one of the 8 SCC in 0 ms
Free SCC test removed 16 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 0 with 54 rules applied. Total rules applied 55 place count 80 transition count 178
Drop transitions (Redundant composition of simpler transitions.) removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 0 with 58 rules applied. Total rules applied 113 place count 80 transition count 120
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 115 place count 80 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 116 place count 79 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 117 place count 79 transition count 119
Applied a total of 117 rules in 22 ms. Remains 79 /123 variables (removed 44) and now considering 119/242 (removed 123) transitions.
[2025-06-03 06:20:06] [INFO ] Flow matrix only has 103 transitions (discarded 16 similar events)
// Phase 1: matrix 103 rows 79 cols
[2025-06-03 06:20:06] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:20:06] [INFO ] Implicit Places using invariants in 123 ms returned [78]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 124 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/123 places, 119/242 transitions.
Graph (trivial) has 95 edges and 78 vertex of which 18 / 78 are part of one of the 6 SCC in 1 ms
Free SCC test removed 12 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 66 transition count 86
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 57 transition count 86
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 19 place count 57 transition count 76
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 39 place count 47 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 46 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 46 transition count 75
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 69 place count 32 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 79 place count 32 transition count 51
Applied a total of 79 rules in 9 ms. Remains 32 /78 variables (removed 46) and now considering 51/119 (removed 68) transitions.
[2025-06-03 06:20:06] [INFO ] Flow matrix only has 38 transitions (discarded 13 similar events)
// Phase 1: matrix 38 rows 32 cols
[2025-06-03 06:20:06] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:20:06] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-03 06:20:06] [INFO ] Flow matrix only has 38 transitions (discarded 13 similar events)
[2025-06-03 06:20:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:20:06] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-03 06:20:06] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/123 places, 51/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 258 ms. Remains : 32/123 places, 51/242 transitions.
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2)), (NOT p3), (NOT p3), (NOT p1), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-15 finished in 571 ms.
All properties solved by simple procedures.
Total runtime 499928 ms.
BK_STOP 1748931606917
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-10a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-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 r086-smll-174860102500452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-10a.tgz
mv FlexibleBarrier-PT-10a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;