Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853728700179.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 Anderson-PT-08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853728700179
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 667K 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 Anderson-PT-08-LTLCardinality-00
FORMULA_NAME Anderson-PT-08-LTLCardinality-01
FORMULA_NAME Anderson-PT-08-LTLCardinality-02
FORMULA_NAME Anderson-PT-08-LTLCardinality-03
FORMULA_NAME Anderson-PT-08-LTLCardinality-04
FORMULA_NAME Anderson-PT-08-LTLCardinality-05
FORMULA_NAME Anderson-PT-08-LTLCardinality-06
FORMULA_NAME Anderson-PT-08-LTLCardinality-07
FORMULA_NAME Anderson-PT-08-LTLCardinality-08
FORMULA_NAME Anderson-PT-08-LTLCardinality-09
FORMULA_NAME Anderson-PT-08-LTLCardinality-10
FORMULA_NAME Anderson-PT-08-LTLCardinality-11
FORMULA_NAME Anderson-PT-08-LTLCardinality-12
FORMULA_NAME Anderson-PT-08-LTLCardinality-13
FORMULA_NAME Anderson-PT-08-LTLCardinality-14
FORMULA_NAME Anderson-PT-08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748543362535

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-29 18:29:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 18:29:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:29:23] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2025-05-29 18:29:23] [INFO ] Transformed 401 places.
[2025-05-29 18:29:23] [INFO ] Transformed 1328 transitions.
[2025-05-29 18:29:23] [INFO ] Found NUPN structural information;
[2025-05-29 18:29:24] [INFO ] Parsed PT model containing 401 places and 1328 transitions and 5088 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-08-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Discarding 97 places :
Symmetric choice reduction at 0 with 97 rule applications. Total rules 97 place count 304 transition count 517
Iterating global reduction 0 with 97 rules applied. Total rules applied 194 place count 304 transition count 517
Applied a total of 194 rules in 63 ms. Remains 304 /401 variables (removed 97) and now considering 517/1328 (removed 811) transitions.
// Phase 1: matrix 517 rows 304 cols
[2025-05-29 18:29:24] [INFO ] Computed 19 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:29:24] [INFO ] Implicit Places using invariants in 525 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 558 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 303/401 places, 517/1328 transitions.
Applied a total of 0 rules in 9 ms. Remains 303 /303 variables (removed 0) and now considering 517/517 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 658 ms. Remains : 303/401 places, 517/1328 transitions.
Support contains 28 out of 303 places after structural reductions.
[2025-05-29 18:29:25] [INFO ] Flatten gal took : 59 ms
[2025-05-29 18:29:25] [INFO ] Flatten gal took : 34 ms
[2025-05-29 18:29:25] [INFO ] Input system was already deterministic with 517 transitions.
RANDOM walk for 40000 steps (8 resets) in 1333 ms. (29 steps per ms) remains 1/17 properties
BEST_FIRST walk for 21503 steps (4 resets) in 98 ms. (217 steps per ms) remains 0/1 properties
FORMULA Anderson-PT-08-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 517/517 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 288 transition count 432
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 288 transition count 432
Applied a total of 30 rules in 18 ms. Remains 288 /303 variables (removed 15) and now considering 432/517 (removed 85) transitions.
// Phase 1: matrix 432 rows 288 cols
[2025-05-29 18:29:25] [INFO ] Computed 18 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:29:26] [INFO ] Implicit Places using invariants in 239 ms returned []
[2025-05-29 18:29:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:29:26] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-29 18:29:27] [INFO ] Implicit Places using invariants and state equation in 1078 ms returned []
Implicit Place search using SMT with State Equation took 1319 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2025-05-29 18:29:27] [INFO ] Invariant cache hit.
[2025-05-29 18:29:27] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:29:34] [INFO ] Deduced a trap composed of 70 places in 162 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:29:35] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:29:36] [INFO ] Deduced a trap composed of 63 places in 142 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:29:39] [INFO ] Deduced a trap composed of 63 places in 153 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:29:43] [INFO ] Deduced a trap composed of 63 places in 126 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:29:43] [INFO ] Deduced a trap composed of 63 places in 142 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:29:43] [INFO ] Deduced a trap composed of 63 places in 135 ms of which 29 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:29:46] [INFO ] Deduced a trap composed of 63 places in 139 ms of which 28 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 7 (OVERLAPS) 1/288 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 424 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 288/720 variables, and 26 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/288 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:30:00] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:30:00] [INFO ] Deduced a trap composed of 93 places in 145 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:30:02] [INFO ] Deduced a trap composed of 86 places in 156 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:30:03] [INFO ] Deduced a trap composed of 86 places in 138 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 287/720 variables, and 29 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 7/8 constraints, State Equation: 0/288 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 0/424 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60217ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 60875ms
Starting structural reductions in LTL mode, iteration 1 : 288/303 places, 432/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62218 ms. Remains : 288/303 places, 432/517 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Anderson-PT-08-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Product exploration explored 100000 steps with 50000 reset in 200 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-08-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-08-LTLCardinality-00 finished in 62956 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((F(G((p0 U p1)))&&((X(p2)&&F(p3))||X(G(p2)))))))'
Support contains 6 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 517/517 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 292 transition count 464
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 292 transition count 464
Applied a total of 22 rules in 21 ms. Remains 292 /303 variables (removed 11) and now considering 464/517 (removed 53) transitions.
// Phase 1: matrix 464 rows 292 cols
[2025-05-29 18:30:28] [INFO ] Computed 18 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:30:29] [INFO ] Implicit Places using invariants in 219 ms returned []
[2025-05-29 18:30:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:30:29] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-29 18:30:30] [INFO ] Implicit Places using invariants and state equation in 1273 ms returned []
Implicit Place search using SMT with State Equation took 1494 ms to find 0 implicit places.
Running 456 sub problems to find dead transitions.
[2025-05-29 18:30:30] [INFO ] Invariant cache hit.
[2025-05-29 18:30:30] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/292 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:30:33] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:30:33] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:30:34] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:30:35] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:30:36] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:30:36] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:30:38] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:30:38] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:30:44] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:30:46] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:30:46] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 22 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:30:50] [INFO ] Deduced a trap composed of 64 places in 156 ms of which 31 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 8 (OVERLAPS) 464/756 variables, 292/322 constraints. Problems are: Problem set: 0 solved, 456 unsolved
SMT process timed out in 30127ms, After SMT, problems are : Problem set: 0 solved, 456 unsolved
Search for dead transitions found 0 dead transitions in 30131ms
Starting structural reductions in LTL mode, iteration 1 : 292/303 places, 464/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31656 ms. Remains : 292/303 places, 464/517 transitions.
Stuttering acceptance computed with spot in 394 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (AND (NOT p3) (NOT p2)), (NOT p1), true, (NOT p3)]
Running random walk in product with property : Anderson-PT-08-LTLCardinality-03
Product exploration explored 100000 steps with 28 reset in 269 ms.
Product exploration explored 100000 steps with 59 reset in 253 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 p1 p0 p2), (X (X (NOT (AND (NOT p1) p0)))), (X (X p3)), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 74 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), true]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (8 resets) in 208 ms. (191 steps per ms) remains 1/5 properties
BEST_FIRST walk for 15497 steps (3 resets) in 32 ms. (469 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p3 p1 p0 p2), (X (X (NOT (AND (NOT p1) p0)))), (X (X p3)), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), true]
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), true]
Support contains 5 out of 292 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 464/464 transitions.
Applied a total of 0 rules in 15 ms. Remains 292 /292 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2025-05-29 18:31:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:31:02] [INFO ] Implicit Places using invariants in 213 ms returned []
[2025-05-29 18:31:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:31:02] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-29 18:31:04] [INFO ] Implicit Places using invariants and state equation in 1271 ms returned []
Implicit Place search using SMT with State Equation took 1486 ms to find 0 implicit places.
Running 456 sub problems to find dead transitions.
[2025-05-29 18:31:04] [INFO ] Invariant cache hit.
[2025-05-29 18:31:04] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/292 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:06] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:07] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:07] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:09] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:09] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:10] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:11] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:12] [INFO ] Deduced a trap composed of 56 places in 139 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:18] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:20] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:20] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 22 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:23] [INFO ] Deduced a trap composed of 64 places in 147 ms of which 32 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 8 (OVERLAPS) 464/756 variables, 292/322 constraints. Problems are: Problem set: 0 solved, 456 unsolved
SMT process timed out in 30112ms, After SMT, problems are : Problem set: 0 solved, 456 unsolved
Search for dead transitions found 0 dead transitions in 30116ms
Finished structural reductions in LTL mode , in 1 iterations and 31620 ms. Remains : 292/292 places, 464/464 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), true]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (8 resets) in 128 ms. (310 steps per ms) remains 1/5 properties
BEST_FIRST walk for 9557 steps (1 resets) in 15 ms. (597 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 217 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), true]
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), true]
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), true]
Product exploration explored 100000 steps with 74 reset in 134 ms.
Product exploration explored 100000 steps with 53 reset in 159 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), true]
Support contains 5 out of 292 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 292/292 places, 464/464 transitions.
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 292 transition count 464
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 53 Pre rules applied. Total rules applied 62 place count 292 transition count 464
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 1 with 53 rules applied. Total rules applied 115 place count 292 transition count 464
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 291 transition count 463
Deduced a syphon composed of 115 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 291 transition count 463
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 291 transition count 463
Deduced a syphon composed of 116 places in 1 ms
Applied a total of 118 rules in 70 ms. Remains 291 /292 variables (removed 1) and now considering 463/464 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 18:31:36] [INFO ] Redundant transitions in 25 ms returned []
Running 455 sub problems to find dead transitions.
// Phase 1: matrix 463 rows 291 cols
[2025-05-29 18:31:36] [INFO ] Computed 18 invariants in 3 ms
[2025-05-29 18:31:36] [INFO ] State equation strengthened by 101 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/291 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:39] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:39] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:39] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:39] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:39] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:39] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:40] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:40] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:41] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 2 ms to minimize.
Problem TDEAD215 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:41] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:41] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:41] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 12/30 constraints. Problems are: Problem set: 116 solved, 339 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:42] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:43] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:43] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:43] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:44] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:44] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 6/36 constraints. Problems are: Problem set: 116 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/36 constraints. Problems are: Problem set: 116 solved, 339 unsolved
At refinement iteration 5 (OVERLAPS) 463/754 variables, 291/327 constraints. Problems are: Problem set: 116 solved, 339 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/754 variables, 101/428 constraints. Problems are: Problem set: 116 solved, 339 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:31:55] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 21 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/754 variables, 1/429 constraints. Problems are: Problem set: 116 solved, 339 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/754 variables, 0/429 constraints. Problems are: Problem set: 116 solved, 339 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 754/754 variables, and 429 constraints, problems are : Problem set: 116 solved, 339 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 291/291 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 116 solved, 339 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 19/19 constraints. Problems are: Problem set: 116 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/19 constraints. Problems are: Problem set: 116 solved, 339 unsolved
At refinement iteration 2 (OVERLAPS) 116/291 variables, 11/30 constraints. Problems are: Problem set: 116 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 7/37 constraints. Problems are: Problem set: 116 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/37 constraints. Problems are: Problem set: 116 solved, 339 unsolved
SMT process timed out in 60140ms, After SMT, problems are : Problem set: 116 solved, 339 unsolved
Search for dead transitions found 116 dead transitions in 60141ms
Found 116 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 116 transitions
Dead transitions reduction (with SMT) removed 116 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 291/292 places, 347/464 transitions.
Graph (complete) has 915 edges and 291 vertex of which 175 are kept as prefixes of interest. Removing 116 places using SCC suffix rule.3 ms
Discarding 116 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 175 /291 variables (removed 116) and now considering 347/347 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 175/292 places, 347/464 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60265 ms. Remains : 175/292 places, 347/464 transitions.
Built C files in :
/tmp/ltsmin6709710460262590478
[2025-05-29 18:32:36] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6709710460262590478
Running compilation step : cd /tmp/ltsmin6709710460262590478;'/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 790 ms.
Running link step : cd /tmp/ltsmin6709710460262590478;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin6709710460262590478;'/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/stateBased14918184746944695686.hoa' '--buchi-type=spotba'
LTSmin run took 328 ms.
FORMULA Anderson-PT-08-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-08-LTLCardinality-03 finished in 129178 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(F(p0))&&(p1||X(X(X((p2 U X(X(p1))))))))))'
Support contains 4 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 517/517 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 290 transition count 462
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 290 transition count 462
Applied a total of 26 rules in 14 ms. Remains 290 /303 variables (removed 13) and now considering 462/517 (removed 55) transitions.
// Phase 1: matrix 462 rows 290 cols
[2025-05-29 18:32:38] [INFO ] Computed 18 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:32:38] [INFO ] Implicit Places using invariants in 206 ms returned []
[2025-05-29 18:32:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:32:38] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-29 18:32:39] [INFO ] Implicit Places using invariants and state equation in 1424 ms returned []
Implicit Place search using SMT with State Equation took 1633 ms to find 0 implicit places.
Running 454 sub problems to find dead transitions.
[2025-05-29 18:32:39] [INFO ] Invariant cache hit.
[2025-05-29 18:32:39] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:42] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:42] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:43] [INFO ] Deduced a trap composed of 56 places in 127 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:43] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:44] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 35 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:46] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:47] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:48] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:49] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 26 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:52] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:53] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:54] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 27 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:32:56] [INFO ] Deduced a trap composed of 56 places in 141 ms of which 25 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 7 (OVERLAPS) 462/752 variables, 290/321 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 56/377 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 752/752 variables, and 377 constraints, problems are : Problem set: 0 solved, 454 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 290/290 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 454/454 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 13/31 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/752 variables, and 31 constraints, problems are : Problem set: 0 solved, 454 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/290 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 0/454 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 454 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Starting structural reductions in LTL mode, iteration 1 : 290/303 places, 462/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61769 ms. Remains : 290/303 places, 462/517 transitions.
Stuttering acceptance computed with spot in 438 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Anderson-PT-08-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 51 steps with 2 reset in 1 ms.
FORMULA Anderson-PT-08-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-08-LTLCardinality-05 finished in 62234 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(p1)&&X(p2))||p0)))'
Support contains 6 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 517/517 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 291 transition count 435
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 291 transition count 435
Applied a total of 24 rules in 14 ms. Remains 291 /303 variables (removed 12) and now considering 435/517 (removed 82) transitions.
// Phase 1: matrix 435 rows 291 cols
[2025-05-29 18:33:40] [INFO ] Computed 18 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:33:40] [INFO ] Implicit Places using invariants in 201 ms returned []
[2025-05-29 18:33:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:33:40] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-29 18:33:41] [INFO ] Implicit Places using invariants and state equation in 1044 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2025-05-29 18:33:41] [INFO ] Invariant cache hit.
[2025-05-29 18:33:41] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:33:44] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:33:46] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:33:46] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:33:48] [INFO ] Deduced a trap composed of 64 places in 133 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:33:53] [INFO ] Deduced a trap composed of 63 places in 135 ms of which 30 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:33:56] [INFO ] Deduced a trap composed of 64 places in 136 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:33:56] [INFO ] Deduced a trap composed of 63 places in 131 ms of which 28 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:33:59] [INFO ] Deduced a trap composed of 63 places in 137 ms of which 27 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 8 (OVERLAPS) 1/291 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:34:09] [INFO ] Deduced a trap composed of 48 places in 139 ms of which 26 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 291/726 variables, and 27 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/291 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 1/291 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 291/726 variables, and 27 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/291 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 0/427 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 291/303 places, 435/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61373 ms. Remains : 291/303 places, 435/517 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), true]
Running random walk in product with property : Anderson-PT-08-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 225 ms.
Product exploration explored 100000 steps with 50000 reset in 183 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 19 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-08-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-08-LTLCardinality-06 finished in 61986 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 303/303 places, 517/517 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 303 transition count 455
Reduce places removed 62 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 64 rules applied. Total rules applied 126 place count 241 transition count 453
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 128 place count 239 transition count 453
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 128 place count 239 transition count 399
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 236 place count 185 transition count 399
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 249 place count 172 transition count 316
Iterating global reduction 3 with 13 rules applied. Total rules applied 262 place count 172 transition count 316
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 266 place count 170 transition count 314
Applied a total of 266 rules in 32 ms. Remains 170 /303 variables (removed 133) and now considering 314/517 (removed 203) transitions.
// Phase 1: matrix 314 rows 170 cols
[2025-05-29 18:34:42] [INFO ] Computed 18 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:34:42] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-05-29 18:34:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:34:42] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-29 18:34:42] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 18:34:42] [INFO ] Redundant transitions in 6 ms returned []
Running 306 sub problems to find dead transitions.
[2025-05-29 18:34:42] [INFO ] Invariant cache hit.
[2025-05-29 18:34:42] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 1/170 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:34:47] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:34:47] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:34:47] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:34:48] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 314/484 variables, 170/192 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 56/248 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 10 (OVERLAPS) 0/484 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 484/484 variables, and 248 constraints, problems are : Problem set: 0 solved, 306 unsolved in 15429 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 170/170 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 1/170 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:04] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:05] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:13] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:24] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/484 variables, and 26 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/170 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 0/306 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45505ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 45506ms
Starting structural reductions in SI_LTL mode, iteration 1 : 170/303 places, 314/517 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46058 ms. Remains : 170/303 places, 314/517 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-08-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 120 ms.
Stack based approach found an accepted trace after 295 steps with 0 reset with depth 296 and stack size 186 in 0 ms.
FORMULA Anderson-PT-08-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLCardinality-07 finished in 46309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 303/303 places, 517/517 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 303 transition count 455
Reduce places removed 62 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 125 place count 241 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 126 place count 240 transition count 454
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 126 place count 240 transition count 398
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 238 place count 184 transition count 398
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 252 place count 170 transition count 328
Iterating global reduction 3 with 14 rules applied. Total rules applied 266 place count 170 transition count 328
Applied a total of 266 rules in 22 ms. Remains 170 /303 variables (removed 133) and now considering 328/517 (removed 189) transitions.
// Phase 1: matrix 328 rows 170 cols
[2025-05-29 18:35:28] [INFO ] Computed 18 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:35:28] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-05-29 18:35:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:35:28] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-29 18:35:29] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 18:35:29] [INFO ] Redundant transitions in 3 ms returned []
Running 320 sub problems to find dead transitions.
[2025-05-29 18:35:29] [INFO ] Invariant cache hit.
[2025-05-29 18:35:29] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:30] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:30] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:31] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:32] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:32] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:34] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:35] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:35] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:35:36] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 328/498 variables, 170/197 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 56/253 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 10 (OVERLAPS) 0/498 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 253 constraints, problems are : Problem set: 0 solved, 320 unsolved in 18954 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 170/170 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 328/498 variables, 170/197 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 56/253 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/498 variables, and 573 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 170/170 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49091ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 49093ms
Starting structural reductions in SI_LTL mode, iteration 1 : 170/303 places, 328/517 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49656 ms. Remains : 170/303 places, 328/517 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 125 ms.
Stack based approach found an accepted trace after 2667 steps with 0 reset with depth 2668 and stack size 1990 in 5 ms.
FORMULA Anderson-PT-08-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLCardinality-10 finished in 49835 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(G((p0&&F((G(p0)&&p1))))))))'
Support contains 4 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 517/517 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 291 transition count 435
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 291 transition count 435
Applied a total of 24 rules in 13 ms. Remains 291 /303 variables (removed 12) and now considering 435/517 (removed 82) transitions.
// Phase 1: matrix 435 rows 291 cols
[2025-05-29 18:36:18] [INFO ] Computed 18 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:36:18] [INFO ] Implicit Places using invariants in 213 ms returned []
[2025-05-29 18:36:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:36:18] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-29 18:36:19] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned []
Implicit Place search using SMT with State Equation took 1493 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2025-05-29 18:36:19] [INFO ] Invariant cache hit.
[2025-05-29 18:36:19] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:36:23] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:36:24] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:36:25] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 1/291 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:36:33] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:36:33] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:36:35] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 24 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:36:37] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:36:37] [INFO ] Deduced a trap composed of 48 places in 127 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:36:38] [INFO ] Deduced a trap composed of 64 places in 138 ms of which 29 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:36:42] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 24 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (OVERLAPS) 435/726 variables, 291/319 constraints. Problems are: Problem set: 0 solved, 427 unsolved
SMT process timed out in 30080ms, After SMT, problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 30082ms
Starting structural reductions in LTL mode, iteration 1 : 291/303 places, 435/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31590 ms. Remains : 291/303 places, 435/517 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 145 ms.
Stack based approach found an accepted trace after 2466 steps with 0 reset with depth 2467 and stack size 1670 in 5 ms.
FORMULA Anderson-PT-08-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLCardinality-15 finished in 32046 ms.
All properties solved by simple procedures.
Total runtime 446634 ms.

BK_STOP 1748543810445

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-08"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is Anderson-PT-08, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853728700179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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