Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102700548.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-22a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102700548
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1012K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 216K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K 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 384K 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-22a-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-22a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748988018833

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-22a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 22:00:21] [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 22:00:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 22:00:21] [INFO ] Load time of PNML (sax parser for PT used): 239 ms
[2025-06-03 22:00:21] [INFO ] Transformed 267 places.
[2025-06-03 22:00:21] [INFO ] Transformed 1258 transitions.
[2025-06-03 22:00:21] [INFO ] Found NUPN structural information;
[2025-06-03 22:00:21] [INFO ] Parsed PT model containing 267 places and 1258 transitions and 6375 arcs in 404 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 442 transitions
Reduce redundant transitions removed 442 transitions.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 816/816 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 267 transition count 794
Applied a total of 22 rules in 81 ms. Remains 267 /267 variables (removed 0) and now considering 794/816 (removed 22) transitions.
// Phase 1: matrix 794 rows 267 cols
[2025-06-03 22:00:21] [INFO ] Computed 24 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:00:22] [INFO ] Implicit Places using invariants in 667 ms returned []
[2025-06-03 22:00:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:00:23] [INFO ] State equation strengthened by 573 read => feed constraints.
[2025-06-03 22:00:24] [INFO ] Implicit Places using invariants and state equation in 1588 ms returned []
Implicit Place search using SMT with State Equation took 2310 ms to find 0 implicit places.
Running 793 sub problems to find dead transitions.
[2025-06-03 22:00:24] [INFO ] Invariant cache hit.
[2025-06-03 22:00:24] [INFO ] State equation strengthened by 573 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 266/266 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 2 (OVERLAPS) 1/267 variables, 24/290 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 793 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 267/1061 variables, and 291 constraints, problems are : Problem set: 0 solved, 793 unsolved in 30091 ms.
Refiners :[Domain max(s): 267/267 constraints, Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 0/267 constraints, ReadFeed: 0/573 constraints, PredecessorRefiner: 793/793 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 793 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 266/266 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 2 (OVERLAPS) 1/267 variables, 24/290 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 5 (OVERLAPS) 794/1061 variables, 267/558 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1061 variables, 573/1131 constraints. Problems are: Problem set: 0 solved, 793 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1061/1061 variables, and 1924 constraints, problems are : Problem set: 0 solved, 793 unsolved in 30190 ms.
Refiners :[Domain max(s): 267/267 constraints, Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 267/267 constraints, ReadFeed: 573/573 constraints, PredecessorRefiner: 793/793 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61483ms problems are : Problem set: 0 solved, 793 unsolved
Search for dead transitions found 0 dead transitions in 61527ms
Starting structural reductions in LTL mode, iteration 1 : 267/267 places, 794/816 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63976 ms. Remains : 267/267 places, 794/816 transitions.
Support contains 39 out of 267 places after structural reductions.
[2025-06-03 22:01:26] [INFO ] Flatten gal took : 120 ms
[2025-06-03 22:01:26] [INFO ] Flatten gal took : 73 ms
[2025-06-03 22:01:26] [INFO ] Input system was already deterministic with 794 transitions.
Reduction of identical properties reduced properties to check from 36 to 33
RANDOM walk for 7328 steps (0 resets) in 989 ms. (7 steps per ms) remains 0/33 properties
FORMULA FlexibleBarrier-PT-22a-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FlexibleBarrier-PT-22a-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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(!((p0 U p1) U (F((G(p2)&&X(p3))) U X(p0)))))'
Support contains 8 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 794/794 transitions.
Applied a total of 0 rules in 9 ms. Remains 267 /267 variables (removed 0) and now considering 794/794 (removed 0) transitions.
[2025-06-03 22:01:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:01:27] [INFO ] Implicit Places using invariants in 234 ms returned []
[2025-06-03 22:01:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:01:28] [INFO ] State equation strengthened by 573 read => feed constraints.
[2025-06-03 22:01:28] [INFO ] Implicit Places using invariants and state equation in 861 ms returned []
Implicit Place search using SMT with State Equation took 1099 ms to find 0 implicit places.
Running 793 sub problems to find dead transitions.
[2025-06-03 22:01:28] [INFO ] Invariant cache hit.
[2025-06-03 22:01:28] [INFO ] State equation strengthened by 573 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 266/266 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 2 (OVERLAPS) 1/267 variables, 24/290 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 793 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 267/1061 variables, and 291 constraints, problems are : Problem set: 0 solved, 793 unsolved in 30027 ms.
Refiners :[Domain max(s): 267/267 constraints, Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 0/267 constraints, ReadFeed: 0/573 constraints, PredecessorRefiner: 793/793 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 793 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 266/266 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 2 (OVERLAPS) 1/267 variables, 24/290 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 5 (OVERLAPS) 794/1061 variables, 267/558 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1061 variables, 573/1131 constraints. Problems are: Problem set: 0 solved, 793 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1061/1061 variables, and 1924 constraints, problems are : Problem set: 0 solved, 793 unsolved in 30258 ms.
Refiners :[Domain max(s): 267/267 constraints, Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 267/267 constraints, ReadFeed: 573/573 constraints, PredecessorRefiner: 793/793 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60729ms problems are : Problem set: 0 solved, 793 unsolved
Search for dead transitions found 0 dead transitions in 60734ms
Finished structural reductions in LTL mode , in 1 iterations and 61845 ms. Remains : 267/267 places, 794/794 transitions.
Stuttering acceptance computed with spot in 978 ms :[p0, p0, p0, (AND p2 p0 p3), false, (AND p0 p1), true, false, (AND p2 p0 p3), (AND p2 p0 (NOT p3)), (AND p1 p0), (AND (NOT p0) p2 p3), (AND p2 (NOT p0) p3), p2, (AND p1 (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLFireability-00
Product exploration explored 100000 steps with 25251 reset in 2297 ms.
Product exploration explored 100000 steps with 25120 reset in 2118 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 p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 10 factoid took 432 ms. Reduced automaton from 15 states, 28 edges and 4 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 477 ms :[(AND p2 p0 p3), (AND p2 p0 p3), (AND p2 p0 p3), (AND p2 p0 p3), false, (AND p2 p0 (NOT p3)), (AND (NOT p0) p2 p3), (AND p2 (NOT p0) p3), p2]
RANDOM walk for 34696 steps (7 resets) in 690 ms. (50 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F p0), (F (NOT (OR p0 (NOT p2)))), (F p2), (F (NOT (OR p0 (NOT p2) (NOT p3)))), (F p3), (F (NOT (OR (NOT p0) (NOT p2) (NOT p3))))]
Knowledge based reduction with 10 factoid took 632 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 444 ms :[(AND p2 p0 p3), (AND p2 p0 p3), (AND p2 p0 p3), (AND p2 p0 p3), false, (AND p2 p0 (NOT p3)), (AND (NOT p0) p2 p3), (AND p2 (NOT p0) p3), p2]
Stuttering acceptance computed with spot in 397 ms :[(AND p2 p0 p3), (AND p2 p0 p3), (AND p2 p0 p3), (AND p2 p0 p3), false, (AND p2 p0 (NOT p3)), (AND (NOT p0) p2 p3), (AND p2 (NOT p0) p3), p2]
Support contains 7 out of 267 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 794/794 transitions.
Applied a total of 0 rules in 11 ms. Remains 267 /267 variables (removed 0) and now considering 794/794 (removed 0) transitions.
[2025-06-03 22:02:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:02:37] [INFO ] Implicit Places using invariants in 220 ms returned []
[2025-06-03 22:02:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:02:37] [INFO ] State equation strengthened by 573 read => feed constraints.
[2025-06-03 22:02:38] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1210 ms to find 0 implicit places.
Running 793 sub problems to find dead transitions.
[2025-06-03 22:02:38] [INFO ] Invariant cache hit.
[2025-06-03 22:02:38] [INFO ] State equation strengthened by 573 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 266/266 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 2 (OVERLAPS) 1/267 variables, 24/290 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 793 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 267/1061 variables, and 291 constraints, problems are : Problem set: 0 solved, 793 unsolved in 30032 ms.
Refiners :[Domain max(s): 267/267 constraints, Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 0/267 constraints, ReadFeed: 0/573 constraints, PredecessorRefiner: 793/793 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 793 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 266/266 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 2 (OVERLAPS) 1/267 variables, 24/290 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 793 unsolved
SMT process timed out in 60583ms, After SMT, problems are : Problem set: 0 solved, 793 unsolved
Search for dead transitions found 0 dead transitions in 60587ms
Finished structural reductions in LTL mode , in 1 iterations and 61811 ms. Remains : 267/267 places, 794/794 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 p2) (NOT p0) (NOT p3))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 1 factoid took 199 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 487 ms :[(AND p2 p0 p3), (AND p2 p0 p3), (AND p2 p0 p3), (AND p2 p0 p3), false, (AND p2 p0 (NOT p3)), (AND (NOT p0) p2 p3), (AND p2 (NOT p0) p3), p2]
RANDOM walk for 30114 steps (6 resets) in 634 ms. (47 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F p0), (F (NOT (OR p0 (NOT p2)))), (F p2), (F (NOT (OR p0 (NOT p2) (NOT p3)))), (F p3), (F (NOT (OR (NOT p0) (NOT p2) (NOT p3))))]
Knowledge based reduction with 1 factoid took 413 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 421 ms :[(AND p2 p0 p3), (AND p2 p0 p3), (AND p2 p0 p3), (AND p2 p0 p3), false, (AND p2 p0 (NOT p3)), (AND (NOT p0) p2 p3), (AND p2 (NOT p0) p3), p2]
Stuttering acceptance computed with spot in 474 ms :[(AND p2 p0 p3), (AND p2 p0 p3), (AND p2 p0 p3), (AND p2 p0 p3), false, (AND p2 p0 (NOT p3)), (AND (NOT p0) p2 p3), (AND p2 (NOT p0) p3), p2]
Stuttering acceptance computed with spot in 491 ms :[(AND p2 p0 p3), (AND p2 p0 p3), (AND p2 p0 p3), (AND p2 p0 p3), false, (AND p2 p0 (NOT p3)), (AND (NOT p0) p2 p3), (AND p2 (NOT p0) p3), p2]
Product exploration explored 100000 steps with 20089 reset in 2294 ms.
Product exploration explored 100000 steps with 20166 reset in 1809 ms.
Applying partial POR strategy [false, false, false, true, false, true, false, true, true]
Stuttering acceptance computed with spot in 501 ms :[(AND p2 p0 p3), (AND p2 p0 p3), (AND p2 p0 p3), (AND p2 p0 p3), false, (AND p2 p0 (NOT p3)), (AND (NOT p0) p2 p3), (AND p2 (NOT p0) p3), p2]
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 794/794 transitions.
Graph (trivial) has 209 edges and 267 vertex of which 54 / 267 are part of one of the 18 SCC in 6 ms
Free SCC test removed 36 places
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 172 transitions.
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 0 with 66 rules applied. Total rules applied 67 place count 231 transition count 668
Deduced a syphon composed of 66 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 293 transitions
Redundant transition composition rules discarded 293 transitions
Iterating global reduction 0 with 293 rules applied. Total rules applied 360 place count 231 transition count 375
Deduced a syphon composed of 66 places in 1 ms
Applied a total of 360 rules in 155 ms. Remains 231 /267 variables (removed 36) and now considering 375/794 (removed 419) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 22:03:47] [INFO ] Redundant transitions in 100 ms returned [190, 191, 192, 193, 194, 195]
Found 6 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 6 transitions
Redundant transitions reduction (with SMT) removed 6 transitions.
Running 368 sub problems to find dead transitions.
[2025-06-03 22:03:47] [INFO ] Flow matrix only has 330 transitions (discarded 39 similar events)
// Phase 1: matrix 330 rows 231 cols
[2025-06-03 22:03:47] [INFO ] Computed 24 invariants in 9 ms
[2025-06-03 22:03:47] [INFO ] State equation strengthened by 161 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/231 variables, 24/254 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:03:59] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 17 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 22:03:59] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 4 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:03:59] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:03:59] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 3 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:03:59] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 3 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:03:59] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 4 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:03:59] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:03:59] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 3 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:03:59] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:03:59] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 3 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:03:59] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 4 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:03:59] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 3 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:03:59] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 3 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:03:59] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 4 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:04:00] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 3 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:04:00] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 3 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:04:00] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 4 ms to minimize.
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:04:00] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 3 ms to minimize.
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:04:00] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 3 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:04:00] [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
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD364 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 20/275 constraints. Problems are: Problem set: 102 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:04:01] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 3 ms to minimize.
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 22:04:01] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD244 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 2/277 constraints. Problems are: Problem set: 112 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/277 constraints. Problems are: Problem set: 112 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 329/560 variables, 231/508 constraints. Problems are: Problem set: 112 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/560 variables, 160/668 constraints. Problems are: Problem set: 112 solved, 256 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/561 variables, and 668 constraints, problems are : Problem set: 112 solved, 256 unsolved in 30028 ms.
Refiners :[Domain max(s): 231/231 constraints, Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 231/231 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 112 solved, 256 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 164/164 constraints. Problems are: Problem set: 112 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/164 constraints. Problems are: Problem set: 112 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 67/231 variables, 24/188 constraints. Problems are: Problem set: 112 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 67/255 constraints. Problems are: Problem set: 112 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 22/277 constraints. Problems are: Problem set: 112 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/277 constraints. Problems are: Problem set: 112 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 329/560 variables, 231/508 constraints. Problems are: Problem set: 112 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/560 variables, 160/668 constraints. Problems are: Problem set: 112 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/560 variables, 256/924 constraints. Problems are: Problem set: 112 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 0/924 constraints. Problems are: Problem set: 112 solved, 256 unsolved
At refinement iteration 10 (OVERLAPS) 1/561 variables, 1/925 constraints. Problems are: Problem set: 112 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/561 variables, and 925 constraints, problems are : Problem set: 112 solved, 256 unsolved in 30015 ms.
Refiners :[Domain max(s): 231/231 constraints, Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 231/231 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 256/368 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60123ms problems are : Problem set: 112 solved, 256 unsolved
Search for dead transitions found 112 dead transitions in 60125ms
Found 112 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 112 transitions
Dead transitions reduction (with SMT) removed 112 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 231/267 places, 257/794 transitions.
Graph (complete) has 566 edges and 231 vertex of which 165 are kept as prefixes of interest. Removing 66 places using SCC suffix rule.4 ms
Discarding 66 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 39 ms. Remains 165 /231 variables (removed 66) and now considering 257/257 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 165/267 places, 257/794 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60460 ms. Remains : 165/267 places, 257/794 transitions.
Built C files in :
/tmp/ltsmin2250002072186649812
[2025-06-03 22:04:47] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2250002072186649812
Running compilation step : cd /tmp/ltsmin2250002072186649812;'/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 2663 ms.
Running link step : cd /tmp/ltsmin2250002072186649812;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 90 ms.
Running LTSmin : cd /tmp/ltsmin2250002072186649812;'/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/stateBased17404424583505219539.hoa' '--buchi-type=spotba'
LTSmin run took 8352 ms.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-22a-LTLFireability-00 finished in 211198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((F(p0)&&G(p1))))))))'
Support contains 2 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 794/794 transitions.
Applied a total of 0 rules in 6 ms. Remains 267 /267 variables (removed 0) and now considering 794/794 (removed 0) transitions.
// Phase 1: matrix 794 rows 267 cols
[2025-06-03 22:04:58] [INFO ] Computed 24 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:04:59] [INFO ] Implicit Places using invariants in 690 ms returned [265, 266]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 695 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 265/267 places, 794/794 transitions.
Applied a total of 0 rules in 7 ms. Remains 265 /265 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 708 ms. Remains : 265/267 places, 794/794 transitions.
Stuttering acceptance computed with spot in 343 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLFireability-01
Product exploration explored 100000 steps with 6 reset in 1007 ms.
Stack based approach found an accepted trace after 97 steps with 0 reset with depth 98 and stack size 98 in 9 ms.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLFireability-01 finished in 2091 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((X(F((F(p0)&&p1))) U p2))||(p1 U X(p3)))))'
Support contains 8 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 794/794 transitions.
Applied a total of 0 rules in 6 ms. Remains 267 /267 variables (removed 0) and now considering 794/794 (removed 0) transitions.
[2025-06-03 22:05:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:05:01] [INFO ] Implicit Places using invariants in 434 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 436 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 266/267 places, 794/794 transitions.
Applied a total of 0 rules in 6 ms. Remains 266 /266 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 450 ms. Remains : 266/267 places, 794/794 transitions.
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLFireability-02
Product exploration explored 100000 steps with 2487 reset in 1760 ms.
Stack based approach found an accepted trace after 20 steps with 1 reset with depth 10 and stack size 10 in 0 ms.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLFireability-02 finished in 2575 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(p1)||p2)&&p0)) U p3))'
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 794/794 transitions.
Applied a total of 0 rules in 7 ms. Remains 267 /267 variables (removed 0) and now considering 794/794 (removed 0) transitions.
[2025-06-03 22:05:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:05:03] [INFO ] Implicit Places using invariants in 418 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 431 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 266/267 places, 794/794 transitions.
Applied a total of 0 rules in 7 ms. Remains 266 /266 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 445 ms. Remains : 266/267 places, 794/794 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p3), (OR (NOT p3) (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLFireability-03 finished in 693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(X(p1) U ((X(p1)&&(!p2 U (p3||G(!p2))))||X(G(p1))))))'
Support contains 6 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 794/794 transitions.
Applied a total of 0 rules in 5 ms. Remains 267 /267 variables (removed 0) and now considering 794/794 (removed 0) transitions.
[2025-06-03 22:05:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:05:04] [INFO ] Implicit Places using invariants in 286 ms returned []
[2025-06-03 22:05:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:05:04] [INFO ] State equation strengthened by 573 read => feed constraints.
[2025-06-03 22:05:05] [INFO ] Implicit Places using invariants and state equation in 1233 ms returned []
Implicit Place search using SMT with State Equation took 1522 ms to find 0 implicit places.
Running 793 sub problems to find dead transitions.
[2025-06-03 22:05:05] [INFO ] Invariant cache hit.
[2025-06-03 22:05:05] [INFO ] State equation strengthened by 573 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 266/266 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 2 (OVERLAPS) 1/267 variables, 24/290 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 793 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 267/1061 variables, and 291 constraints, problems are : Problem set: 0 solved, 793 unsolved in 30040 ms.
Refiners :[Domain max(s): 267/267 constraints, Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 0/267 constraints, ReadFeed: 0/573 constraints, PredecessorRefiner: 793/793 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 793 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 266/266 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 2 (OVERLAPS) 1/267 variables, 24/290 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 5 (OVERLAPS) 794/1061 variables, 267/558 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1061 variables, 573/1131 constraints. Problems are: Problem set: 0 solved, 793 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1061/1061 variables, and 1924 constraints, problems are : Problem set: 0 solved, 793 unsolved in 30238 ms.
Refiners :[Domain max(s): 267/267 constraints, Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 267/267 constraints, ReadFeed: 573/573 constraints, PredecessorRefiner: 793/793 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60972ms problems are : Problem set: 0 solved, 793 unsolved
Search for dead transitions found 0 dead transitions in 60983ms
Finished structural reductions in LTL mode , in 1 iterations and 62514 ms. Remains : 267/267 places, 794/794 transitions.
Stuttering acceptance computed with spot in 455 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p3) p2), (NOT p1), true, (AND (NOT p3) p2 (NOT p1)), (AND (NOT p3) p2 p1)]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLFireability-04
Entered a terminal (fully accepting) state of product in 3822 steps with 19 reset in 58 ms.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLFireability-04 finished in 63075 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&(G(p1)||(!p2 U (p3||G(!p2))))))'
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 794/794 transitions.
Applied a total of 0 rules in 8 ms. Remains 267 /267 variables (removed 0) and now considering 794/794 (removed 0) transitions.
[2025-06-03 22:06:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:06:07] [INFO ] Implicit Places using invariants in 430 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 433 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 266/267 places, 794/794 transitions.
Applied a total of 0 rules in 5 ms. Remains 266 /266 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 446 ms. Remains : 266/267 places, 794/794 transitions.
Stuttering acceptance computed with spot in 346 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), true, (NOT p0), (NOT p1), (AND (NOT p3) p2), (AND (NOT p1) (NOT p3) p2), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLFireability-06
Entered a terminal (fully accepting) state of product in 22 steps with 2 reset in 1 ms.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLFireability-06 finished in 832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(!p1 U (p2||G(!p1))))))'
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 794/794 transitions.
Applied a total of 0 rules in 5 ms. Remains 267 /267 variables (removed 0) and now considering 794/794 (removed 0) transitions.
[2025-06-03 22:06:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:06:08] [INFO ] Implicit Places using invariants in 390 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 394 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 266/267 places, 794/794 transitions.
Applied a total of 0 rules in 5 ms. Remains 266 /266 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 405 ms. Remains : 266/267 places, 794/794 transitions.
Stuttering acceptance computed with spot in 254 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLFireability-11 finished in 686 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(!(p0 U G((!p1 U X(p2))))))'
Support contains 9 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 794/794 transitions.
Applied a total of 0 rules in 4 ms. Remains 267 /267 variables (removed 0) and now considering 794/794 (removed 0) transitions.
[2025-06-03 22:06:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:06:09] [INFO ] Implicit Places using invariants in 464 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 467 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 266/267 places, 794/794 transitions.
Applied a total of 0 rules in 4 ms. Remains 266 /266 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 476 ms. Remains : 266/267 places, 794/794 transitions.
Stuttering acceptance computed with spot in 223 ms :[p2, p2, false, p2]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLFireability-14
Product exploration explored 100000 steps with 24328 reset in 2222 ms.
Stack based approach found an accepted trace after 3664 steps with 885 reset with depth 5 and stack size 5 in 111 ms.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLFireability-14 finished in 3066 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((p0||G((X(((!p0 U (G(!p0)||(!p0&&G(!p2)))) U (!p3&&(!p0 U (G(!p0)||(!p0&&G(!p2)))))))||p1)))))'
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 794/794 transitions.
Applied a total of 0 rules in 5 ms. Remains 267 /267 variables (removed 0) and now considering 794/794 (removed 0) transitions.
[2025-06-03 22:06:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:06:12] [INFO ] Implicit Places using invariants in 417 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 419 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 266/267 places, 794/794 transitions.
Applied a total of 0 rules in 4 ms. Remains 266 /266 variables (removed 0) and now considering 794/794 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 428 ms. Remains : 266/267 places, 794/794 transitions.
Stuttering acceptance computed with spot in 425 ms :[(AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3), (OR p3 p0), (OR (AND (NOT p1) p3) (AND p0 (NOT p1))), true, p0, (AND p0 p2), p2]
Running random walk in product with property : FlexibleBarrier-PT-22a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 134 steps with 0 reset in 4 ms.
FORMULA FlexibleBarrier-PT-22a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-LTLFireability-15 finished in 890 ms.
All properties solved by simple procedures.
Total runtime 351415 ms.

BK_STOP 1748988372570

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

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-22a.tgz
mv FlexibleBarrier-PT-22a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;