fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r167-tall-174881266100085
Last Updated
June 24, 2025

About the Execution of 2024-gold for PolyORBNT-PT-S10J20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 699129.00 0.00 0.00 1 4 10 2 1 1 4 ? 1 ? 2 ? 1 1 1 4 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r167-tall-174881266100085.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 gold2024
Input is PolyORBNT-PT-S10J20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266100085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 19K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 276K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 951K 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 14K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 375K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.5M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 13M 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 positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748898661304

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 21:11:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 21:11:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:11:03] [INFO ] Load time of PNML (sax parser for PT used): 598 ms
[2025-06-02 21:11:03] [INFO ] Transformed 474 places.
[2025-06-02 21:11:03] [INFO ] Transformed 11760 transitions.
[2025-06-02 21:11:03] [INFO ] Parsed PT model containing 474 places and 11760 transitions and 111119 arcs in 798 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 13
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 10, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 10, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 21:11:03] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2025-06-02 21:11:03] [INFO ] Computed 72 invariants in 106 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 10, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0] Max Struct:[39, 10, +inf, 79, 39, 61, 190, 158, 19, 158, 39, 1, 752]
RANDOM walk for 10000 steps (560 resets) in 280 ms. (35 steps per ms)
FORMULA PolyORBNT-PT-S10J20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120010 steps (1174 resets) in 447 ms. (267 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 10, 0, 1, 1, 1, 1, 1, 0, 1, 0] Max Struct:[39, 10, +inf, 79, 39, 61, 190, 158, 19, 158, 39, 752]
[2025-06-02 21:11:04] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
[2025-06-02 21:11:04] [INFO ] Invariant cache hit.
[2025-06-02 21:11:04] [INFO ] [Real]Absence check using 45 positive place invariants in 18 ms returned sat
[2025-06-02 21:11:04] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 25 ms returned unsat
[2025-06-02 21:11:04] [INFO ] [Real]Absence check using 45 positive place invariants in 15 ms returned sat
[2025-06-02 21:11:04] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 15 ms returned sat
[2025-06-02 21:11:05] [INFO ] [Real]Absence check using state equation in 521 ms returned sat
[2025-06-02 21:11:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:11:05] [INFO ] [Nat]Absence check using 45 positive place invariants in 16 ms returned sat
[2025-06-02 21:11:05] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 14 ms returned sat
[2025-06-02 21:11:05] [INFO ] [Nat]Absence check using state equation in 564 ms returned sat
[2025-06-02 21:11:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:11:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 221 ms returned sat
[2025-06-02 21:11:06] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 199 ms.
[2025-06-02 21:11:07] [INFO ] Deduced a trap composed of 19 places in 348 ms of which 20 ms to minimize.
[2025-06-02 21:11:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 561 ms
[2025-06-02 21:11:07] [INFO ] Added : 27 causal constraints over 6 iterations in 1348 ms. Result :sat
Minimization took 627 ms.
[2025-06-02 21:11:08] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2025-06-02 21:11:08] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 22 ms returned sat
[2025-06-02 21:11:08] [INFO ] [Real]Absence check using state equation in 631 ms returned unsat
[2025-06-02 21:11:09] [INFO ] [Real]Absence check using 45 positive place invariants in 12 ms returned sat
[2025-06-02 21:11:09] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 19 ms returned sat
[2025-06-02 21:11:09] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2025-06-02 21:11:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:11:09] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2025-06-02 21:11:09] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 17 ms returned sat
[2025-06-02 21:11:10] [INFO ] [Nat]Absence check using state equation in 740 ms returned sat
[2025-06-02 21:11:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 37 ms returned sat
[2025-06-02 21:11:10] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 107 ms.
[2025-06-02 21:11:11] [INFO ] Deduced a trap composed of 141 places in 371 ms of which 3 ms to minimize.
[2025-06-02 21:11:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 662 ms
[2025-06-02 21:11:11] [INFO ] Added : 13 causal constraints over 4 iterations in 1356 ms. Result :sat
Minimization took 641 ms.
[2025-06-02 21:11:12] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2025-06-02 21:11:12] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 14 ms returned unsat
[2025-06-02 21:11:12] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2025-06-02 21:11:12] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 13 ms returned unsat
[2025-06-02 21:11:12] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2025-06-02 21:11:12] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 20 ms returned sat
[2025-06-02 21:11:13] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2025-06-02 21:11:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:11:13] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2025-06-02 21:11:13] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 16 ms returned sat
[2025-06-02 21:11:14] [INFO ] [Nat]Absence check using state equation in 1401 ms returned sat
[2025-06-02 21:11:15] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 21:11:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 577 ms returned sat
[2025-06-02 21:11:15] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 103 ms.
[2025-06-02 21:11:16] [INFO ] Added : 18 causal constraints over 4 iterations in 890 ms. Result :sat
Minimization took 644 ms.
[2025-06-02 21:11:17] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2025-06-02 21:11:17] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 15 ms returned sat
[2025-06-02 21:11:17] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2025-06-02 21:11:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:11:17] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2025-06-02 21:11:17] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 14 ms returned sat
[2025-06-02 21:11:18] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2025-06-02 21:11:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 120 ms returned sat
[2025-06-02 21:11:18] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 113 ms.
[2025-06-02 21:11:19] [INFO ] Added : 10 causal constraints over 2 iterations in 1233 ms. Result :unknown
[2025-06-02 21:11:19] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2025-06-02 21:11:19] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 8 ms returned unsat
[2025-06-02 21:11:19] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2025-06-02 21:11:19] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 17 ms returned sat
[2025-06-02 21:11:20] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2025-06-02 21:11:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:11:20] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2025-06-02 21:11:20] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 14 ms returned sat
[2025-06-02 21:11:20] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2025-06-02 21:11:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 119 ms returned sat
[2025-06-02 21:11:20] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 107 ms.
[2025-06-02 21:11:21] [INFO ] Added : 12 causal constraints over 3 iterations in 392 ms. Result :sat
Minimization took 634 ms.
[2025-06-02 21:11:21] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2025-06-02 21:11:22] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 14 ms returned unsat
[2025-06-02 21:11:22] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2025-06-02 21:11:22] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 14 ms returned sat
[2025-06-02 21:11:22] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2025-06-02 21:11:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:11:22] [INFO ] [Nat]Absence check using 45 positive place invariants in 14 ms returned sat
[2025-06-02 21:11:22] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 13 ms returned sat
[2025-06-02 21:11:23] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2025-06-02 21:11:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 177 ms returned sat
[2025-06-02 21:11:23] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 113 ms.
[2025-06-02 21:11:23] [INFO ] Added : 12 causal constraints over 3 iterations in 408 ms. Result :sat
Minimization took 627 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 10, 0, 1, 1, 1, 1, 1, 0, 1, 0] Max Struct:[1, 10, 10, 79, 1, 1, 190, 158, 1, 158, 1, 752]
FORMULA PolyORBNT-PT-S10J20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 1, 1, 0, 0] Max Struct:[10, 79, 190, 158, 158, 752]
Support contains 15 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 464 transition count 1625
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 61 place count 439 transition count 1624
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 438 transition count 1624
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 62 place count 438 transition count 1600
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 110 place count 414 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 413 transition count 1599
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 413 transition count 1599
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 116 place count 411 transition count 1597
Applied a total of 116 rules in 297 ms. Remains 411 /474 variables (removed 63) and now considering 1597/1650 (removed 53) transitions.
Running 1586 sub problems to find dead transitions.
[2025-06-02 21:11:24] [INFO ] Flow matrix only has 1588 transitions (discarded 9 similar events)
// Phase 1: matrix 1588 rows 411 cols
[2025-06-02 21:11:24] [INFO ] Computed 62 invariants in 42 ms
[2025-06-02 21:11:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1586 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 401/1999 variables, and 52 constraints, problems are : Problem set: 0 solved, 1586 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 43/44 constraints, Generalized P Invariants (flows): 9/18 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1586/586 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1586 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
[2025-06-02 21:12:01] [INFO ] Deduced a trap composed of 18 places in 315 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1999 variables, and 53 constraints, problems are : Problem set: 0 solved, 1586 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 43/44 constraints, Generalized P Invariants (flows): 9/18 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/586 constraints, Known Traps: 1/1 constraints]
After SMT, in 53809ms problems are : Problem set: 0 solved, 1586 unsolved
Search for dead transitions found 0 dead transitions in 53840ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54160 ms. Remains : 411/474 places, 1597/1650 transitions.
[2025-06-02 21:12:18] [INFO ] Flow matrix only has 1588 transitions (discarded 9 similar events)
[2025-06-02 21:12:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 1, 1, 0, 0] Max Struct:[10, 38, 190, 77, 77, 410]
RANDOM walk for 1000000 steps (70180 resets) in 13993 ms. (71 steps per ms)
BEST_FIRST walk for 6000006 steps (54260 resets) in 13885 ms. (432 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 2, 4, 3, 3, 4] Max Struct:[10, 38, 190, 77, 77, 410]
[2025-06-02 21:12:46] [INFO ] Flow matrix only has 1588 transitions (discarded 9 similar events)
[2025-06-02 21:12:46] [INFO ] Invariant cache hit.
[2025-06-02 21:12:46] [INFO ] [Real]Absence check using 44 positive place invariants in 9 ms returned sat
[2025-06-02 21:12:46] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 9 ms returned sat
[2025-06-02 21:12:46] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2025-06-02 21:12:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:12:47] [INFO ] [Nat]Absence check using 44 positive place invariants in 9 ms returned sat
[2025-06-02 21:12:47] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 10 ms returned sat
[2025-06-02 21:12:48] [INFO ] [Nat]Absence check using state equation in 1869 ms returned unsat
[2025-06-02 21:12:48] [INFO ] [Real]Absence check using 44 positive place invariants in 9 ms returned sat
[2025-06-02 21:12:48] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 8 ms returned unsat
[2025-06-02 21:12:49] [INFO ] [Real]Absence check using 44 positive place invariants in 9 ms returned sat
[2025-06-02 21:12:49] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 8 ms returned unsat
[2025-06-02 21:12:49] [INFO ] [Real]Absence check using 44 positive place invariants in 8 ms returned sat
[2025-06-02 21:12:49] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 10 ms returned sat
[2025-06-02 21:12:49] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2025-06-02 21:12:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:12:49] [INFO ] [Nat]Absence check using 44 positive place invariants in 9 ms returned sat
[2025-06-02 21:12:49] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 12 ms returned sat
[2025-06-02 21:12:50] [INFO ] [Nat]Absence check using state equation in 527 ms returned sat
[2025-06-02 21:12:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:12:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 124 ms returned sat
[2025-06-02 21:12:50] [INFO ] Computed and/alt/rep : 1255/4766/1255 causal constraints (skipped 322 transitions) in 102 ms.
[2025-06-02 21:12:50] [INFO ] Added : 11 causal constraints over 3 iterations in 476 ms. Result :sat
Minimization took 5592 ms.
[2025-06-02 21:12:56] [INFO ] [Real]Absence check using 44 positive place invariants in 8 ms returned sat
[2025-06-02 21:12:56] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 10 ms returned sat
[2025-06-02 21:12:56] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2025-06-02 21:12:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:12:56] [INFO ] [Nat]Absence check using 44 positive place invariants in 9 ms returned sat
[2025-06-02 21:12:56] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 10 ms returned sat
[2025-06-02 21:12:57] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2025-06-02 21:12:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 52 ms returned sat
[2025-06-02 21:12:57] [INFO ] Computed and/alt/rep : 1255/4766/1255 causal constraints (skipped 322 transitions) in 101 ms.
[2025-06-02 21:12:57] [INFO ] Added : 10 causal constraints over 3 iterations in 396 ms. Result :sat
Minimization took 5480 ms.
[2025-06-02 21:13:03] [INFO ] [Real]Absence check using 44 positive place invariants in 9 ms returned sat
[2025-06-02 21:13:03] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[4, 2, 4, 3, 3, 4] Max Struct:[4, 2, 4, 77, 77, 4]
FORMULA PolyORBNT-PT-S10J20-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3] Max Struct:[77, 77]
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1597/1597 transitions.
Applied a total of 0 rules in 46 ms. Remains 411 /411 variables (removed 0) and now considering 1597/1597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 411/411 places, 1597/1597 transitions.
[2025-06-02 21:13:03] [INFO ] Flow matrix only has 1588 transitions (discarded 9 similar events)
[2025-06-02 21:13:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3] Max Struct:[77, 77]
RANDOM walk for 1000000 steps (70344 resets) in 13796 ms. (72 steps per ms)
BEST_FIRST walk for 2000002 steps (19164 resets) in 4671 ms. (428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3] Max Struct:[77, 77]
[2025-06-02 21:13:22] [INFO ] Flow matrix only has 1588 transitions (discarded 9 similar events)
[2025-06-02 21:13:22] [INFO ] Invariant cache hit.
[2025-06-02 21:13:22] [INFO ] [Real]Absence check using 44 positive place invariants in 9 ms returned sat
[2025-06-02 21:13:22] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 11 ms returned sat
[2025-06-02 21:13:22] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2025-06-02 21:13:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:13:22] [INFO ] [Nat]Absence check using 44 positive place invariants in 9 ms returned sat
[2025-06-02 21:13:22] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 11 ms returned sat
[2025-06-02 21:13:23] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2025-06-02 21:13:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:13:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 127 ms returned sat
[2025-06-02 21:13:23] [INFO ] Computed and/alt/rep : 1255/4766/1255 causal constraints (skipped 322 transitions) in 102 ms.
[2025-06-02 21:13:23] [INFO ] Added : 11 causal constraints over 3 iterations in 492 ms. Result :sat
Minimization took 5467 ms.
[2025-06-02 21:13:29] [INFO ] [Real]Absence check using 44 positive place invariants in 9 ms returned sat
[2025-06-02 21:13:29] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 11 ms returned sat
[2025-06-02 21:13:29] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2025-06-02 21:13:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:13:29] [INFO ] [Nat]Absence check using 44 positive place invariants in 9 ms returned sat
[2025-06-02 21:13:29] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 10 ms returned sat
[2025-06-02 21:13:30] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2025-06-02 21:13:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 51 ms returned sat
[2025-06-02 21:13:30] [INFO ] Computed and/alt/rep : 1255/4766/1255 causal constraints (skipped 322 transitions) in 99 ms.
[2025-06-02 21:13:30] [INFO ] Added : 10 causal constraints over 3 iterations in 395 ms. Result :sat
Minimization took 5434 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3] Max Struct:[77, 77]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3] Max Struct:[77, 77]
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1597/1597 transitions.
Applied a total of 0 rules in 44 ms. Remains 411 /411 variables (removed 0) and now considering 1597/1597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 411/411 places, 1597/1597 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1597/1597 transitions.
Applied a total of 0 rules in 33 ms. Remains 411 /411 variables (removed 0) and now considering 1597/1597 (removed 0) transitions.
[2025-06-02 21:13:36] [INFO ] Flow matrix only has 1588 transitions (discarded 9 similar events)
[2025-06-02 21:13:36] [INFO ] Invariant cache hit.
[2025-06-02 21:13:36] [INFO ] Implicit Places using invariants in 552 ms returned []
[2025-06-02 21:13:36] [INFO ] Flow matrix only has 1588 transitions (discarded 9 similar events)
[2025-06-02 21:13:36] [INFO ] Invariant cache hit.
[2025-06-02 21:13:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:13:41] [INFO ] Implicit Places using invariants and state equation in 4626 ms returned []
Implicit Place search using SMT with State Equation took 5182 ms to find 0 implicit places.
[2025-06-02 21:13:41] [INFO ] Redundant transitions in 98 ms returned []
Running 1586 sub problems to find dead transitions.
[2025-06-02 21:13:41] [INFO ] Flow matrix only has 1588 transitions (discarded 9 similar events)
[2025-06-02 21:13:41] [INFO ] Invariant cache hit.
[2025-06-02 21:13:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
Problem TDEAD396 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1368 is UNSAT
At refinement iteration 3 (OVERLAPS) 1/402 variables, 1/53 constraints. Problems are: Problem set: 66 solved, 1520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/1999 variables, and 53 constraints, problems are : Problem set: 66 solved, 1520 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 9/18 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1586/586 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 66 solved, 1520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 66 solved, 1520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 66 solved, 1520 unsolved
[2025-06-02 21:14:27] [INFO ] Deduced a trap composed of 18 places in 284 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 1/53 constraints. Problems are: Problem set: 66 solved, 1520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1999 variables, and 53 constraints, problems are : Problem set: 66 solved, 1520 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 43/44 constraints, Generalized P Invariants (flows): 9/18 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 934/586 constraints, Known Traps: 1/1 constraints]
After SMT, in 73112ms problems are : Problem set: 66 solved, 1520 unsolved
Search for dead transitions found 66 dead transitions in 73127ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 411/411 places, 1531/1597 transitions.
Applied a total of 0 rules in 30 ms. Remains 411 /411 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-02 21:14:54] [INFO ] Redundant transitions in 38 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 78528 ms. Remains : 411/411 places, 1531/1597 transitions.
[2025-06-02 21:14:54] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
// Phase 1: matrix 1522 rows 411 cols
[2025-06-02 21:14:54] [INFO ] Computed 62 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3] Max Struct:[77, 77]
RANDOM walk for 1000000 steps (70577 resets) in 13158 ms. (75 steps per ms)
BEST_FIRST walk for 2000002 steps (19130 resets) in 4511 ms. (443 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3] Max Struct:[77, 77]
[2025-06-02 21:15:12] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2025-06-02 21:15:12] [INFO ] Invariant cache hit.
[2025-06-02 21:15:12] [INFO ] [Real]Absence check using 44 positive place invariants in 9 ms returned sat
[2025-06-02 21:15:12] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 11 ms returned sat
[2025-06-02 21:15:12] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2025-06-02 21:15:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:15:13] [INFO ] [Nat]Absence check using 44 positive place invariants in 9 ms returned sat
[2025-06-02 21:15:13] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 10 ms returned sat
[2025-06-02 21:15:13] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2025-06-02 21:15:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:15:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 123 ms returned sat
[2025-06-02 21:15:13] [INFO ] Computed and/alt/rep : 1189/4535/1189 causal constraints (skipped 322 transitions) in 97 ms.
[2025-06-02 21:15:14] [INFO ] Added : 12 causal constraints over 3 iterations in 433 ms. Result :sat
Minimization took 5681 ms.
[2025-06-02 21:15:19] [INFO ] [Real]Absence check using 44 positive place invariants in 9 ms returned sat
[2025-06-02 21:15:19] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 18 ms returned sat
[2025-06-02 21:15:20] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2025-06-02 21:15:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:15:20] [INFO ] [Nat]Absence check using 44 positive place invariants in 8 ms returned sat
[2025-06-02 21:15:20] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 10 ms returned sat
[2025-06-02 21:15:20] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2025-06-02 21:15:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 148 ms returned sat
[2025-06-02 21:15:21] [INFO ] Computed and/alt/rep : 1189/4535/1189 causal constraints (skipped 322 transitions) in 97 ms.
[2025-06-02 21:15:21] [INFO ] Added : 5 causal constraints over 1 iterations in 248 ms. Result :sat
Minimization took 5636 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3] Max Struct:[77, 77]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3] Max Struct:[77, 77]
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1531/1531 transitions.
Applied a total of 0 rules in 38 ms. Remains 411 /411 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 411/411 places, 1531/1531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1531/1531 transitions.
Applied a total of 0 rules in 28 ms. Remains 411 /411 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-02 21:15:26] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2025-06-02 21:15:26] [INFO ] Invariant cache hit.
[2025-06-02 21:15:27] [INFO ] Implicit Places using invariants in 490 ms returned []
[2025-06-02 21:15:27] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2025-06-02 21:15:27] [INFO ] Invariant cache hit.
[2025-06-02 21:15:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:15:31] [INFO ] Implicit Places using invariants and state equation in 3806 ms returned []
Implicit Place search using SMT with State Equation took 4302 ms to find 0 implicit places.
[2025-06-02 21:15:31] [INFO ] Redundant transitions in 101 ms returned []
Running 1520 sub problems to find dead transitions.
[2025-06-02 21:15:31] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2025-06-02 21:15:31] [INFO ] Invariant cache hit.
[2025-06-02 21:15:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 3 (OVERLAPS) 1/402 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/1933 variables, and 53 constraints, problems are : Problem set: 0 solved, 1520 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 9/18 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1520/1520 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
[2025-06-02 21:16:20] [INFO ] Deduced a trap composed of 18 places in 266 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
[2025-06-02 21:16:36] [INFO ] Deduced a trap composed of 148 places in 345 ms of which 7 ms to minimize.
[2025-06-02 21:16:37] [INFO ] Deduced a trap composed of 108 places in 327 ms of which 2 ms to minimize.
[2025-06-02 21:16:37] [INFO ] Deduced a trap composed of 103 places in 328 ms of which 3 ms to minimize.
[2025-06-02 21:16:39] [INFO ] Deduced a trap composed of 59 places in 338 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1933 variables, and 57 constraints, problems are : Problem set: 0 solved, 1520 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 43/44 constraints, Generalized P Invariants (flows): 9/18 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1520 constraints, Known Traps: 5/5 constraints]
After SMT, in 76518ms problems are : Problem set: 0 solved, 1520 unsolved
Search for dead transitions found 0 dead transitions in 76531ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80970 ms. Remains : 411/411 places, 1531/1531 transitions.
RANDOM walk for 40000 steps (2773 resets) in 1862 ms. (21 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (365 resets) in 258 ms. (154 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (377 resets) in 442 ms. (90 steps per ms) remains 4/4 properties
[2025-06-02 21:16:48] [INFO ] Flatten gal took : 524 ms
BEST_FIRST walk for 40004 steps (376 resets) in 303 ms. (131 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (373 resets) in 248 ms. (160 steps per ms) remains 4/4 properties
[2025-06-02 21:16:48] [INFO ] Flatten gal took : 176 ms
[2025-06-02 21:16:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14670293016079798041.gal : 81 ms
[2025-06-02 21:16:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7439422584557223296.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14670293016079798041.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7439422584557223296.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7439422584557223296.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :31 after 32
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :32 after 512
Interrupted probabilistic random walk after 200160 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 4
Probabilistic random walk after 200160 steps, saw 33743 distinct states, run finished after 3004 ms. (steps per millisecond=66 ) properties seen :0
[2025-06-02 21:16:51] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2025-06-02 21:16:51] [INFO ] Invariant cache hit.
[2025-06-02 21:16:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX1 is UNSAT
At refinement iteration 1 (OVERLAPS) 122/124 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem MAX0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 259/383 variables, 43/46 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/46 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/409 variables, 15/61 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/61 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/62 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :512 after 1024
At refinement iteration 9 (OVERLAPS) 1522/1932 variables, 410/472 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1932 variables, 1/473 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1932 variables, 0/473 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/1933 variables, 1/474 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1933 variables, 0/474 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1933 variables, 0/474 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1933/1933 variables, and 474 constraints, problems are : Problem set: 2 solved, 2 unsolved in 766 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 411/411 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 122/124 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 259/383 variables, 43/46 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/46 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/409 variables, 15/61 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/61 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/62 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1522/1932 variables, 410/472 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1932 variables, 1/473 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1932 variables, 0/473 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/1933 variables, 1/474 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1933 variables, 2/476 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1933 variables, 0/476 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1933 variables, 0/476 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1933/1933 variables, and 476 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1125 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 411/411 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1906ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 147 ms.
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1531/1531 transitions.
Applied a total of 0 rules in 31 ms. Remains 411 /411 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Running 1520 sub problems to find dead transitions.
[2025-06-02 21:16:54] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2025-06-02 21:16:54] [INFO ] Invariant cache hit.
[2025-06-02 21:16:54] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1024 after 44598
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :44598 after 55129
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :55129 after 151777
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :151777 after 359353
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
SMT process timed out in 38218ms, After SMT, problems are : Problem set: 0 solved, 1520 unsolved
Search for dead transitions found 0 dead transitions in 38234ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38273 ms. Remains : 411/411 places, 1531/1531 transitions.
RANDOM walk for 40001 steps (2780 resets) in 941 ms. (42 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (393 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (386 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 246551 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 2
Probabilistic random walk after 246551 steps, saw 40876 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2025-06-02 21:17:35] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2025-06-02 21:17:35] [INFO ] Invariant cache hit.
[2025-06-02 21:17:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 122/124 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 259/383 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/409 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1522/1932 variables, 410/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1932 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1932 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/1933 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1933 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1933 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1933/1933 variables, and 474 constraints, problems are : Problem set: 0 solved, 2 unsolved in 739 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 411/411 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 122/124 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 259/383 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/409 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1522/1932 variables, 410/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1932 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1932 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/1933 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1933 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1933 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1933 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1933/1933 variables, and 476 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1181 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 411/411 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1937ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 126 ms.
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1531/1531 transitions.
Applied a total of 0 rules in 35 ms. Remains 411 /411 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 411/411 places, 1531/1531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1531/1531 transitions.
Applied a total of 0 rules in 29 ms. Remains 411 /411 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-02 21:17:37] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2025-06-02 21:17:37] [INFO ] Invariant cache hit.
[2025-06-02 21:17:38] [INFO ] Implicit Places using invariants in 504 ms returned []
[2025-06-02 21:17:38] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2025-06-02 21:17:38] [INFO ] Invariant cache hit.
[2025-06-02 21:17:38] [INFO ] State equation strengthened by 1 read => feed constraints.
Detected timeout of ITS tools.
[2025-06-02 21:17:39] [INFO ] Flatten gal took : 112 ms
[2025-06-02 21:17:39] [INFO ] Applying decomposition
[2025-06-02 21:17:39] [INFO ] Flatten gal took : 95 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10055396799015613977.txt' '-o' '/tmp/graph10055396799015613977.bin' '-w' '/tmp/graph10055396799015613977.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10055396799015613977.bin' '-l' '-1' '-v' '-w' '/tmp/graph10055396799015613977.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:17:39] [INFO ] Decomposing Gal with order
[2025-06-02 21:17:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:17:40] [INFO ] Removed a total of 5201 redundant transitions.
[2025-06-02 21:17:40] [INFO ] Flatten gal took : 341 ms
[2025-06-02 21:17:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 316 labels/synchronizations in 100 ms.
[2025-06-02 21:17:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13928700199998782596.gal : 26 ms
[2025-06-02 21:17:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7764299190727653297.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13928700199998782596.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7764299190727653297.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality7764299190727653297.prop.
[2025-06-02 21:17:42] [INFO ] Implicit Places using invariants and state equation in 3868 ms returned []
Implicit Place search using SMT with State Equation took 4377 ms to find 0 implicit places.
[2025-06-02 21:17:42] [INFO ] Redundant transitions in 40 ms returned []
Running 1520 sub problems to find dead transitions.
[2025-06-02 21:17:42] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2025-06-02 21:17:42] [INFO ] Invariant cache hit.
[2025-06-02 21:17:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1/402 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/1933 variables, and 53 constraints, problems are : Problem set: 0 solved, 1520 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 9/18 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1520/1520 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1520 unsolved
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
[2025-06-02 21:18:33] [INFO ] Deduced a trap composed of 18 places in 279 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
[2025-06-02 21:18:49] [INFO ] Deduced a trap composed of 148 places in 346 ms of which 5 ms to minimize.
[2025-06-02 21:18:50] [INFO ] Deduced a trap composed of 108 places in 327 ms of which 2 ms to minimize.
[2025-06-02 21:18:50] [INFO ] Deduced a trap composed of 103 places in 329 ms of which 2 ms to minimize.
[2025-06-02 21:18:52] [INFO ] Deduced a trap composed of 59 places in 344 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1933 variables, and 57 constraints, problems are : Problem set: 0 solved, 1520 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 43/44 constraints, Generalized P Invariants (flows): 9/18 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1520 constraints, Known Traps: 5/5 constraints]
After SMT, in 78438ms problems are : Problem set: 0 solved, 1520 unsolved
Search for dead transitions found 0 dead transitions in 78452ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82906 ms. Remains : 411/411 places, 1531/1531 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3, 3] Max Struct:[77, 77]
Starting property specific reduction for PolyORBNT-PT-S10J20-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[77]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[77]
[2025-06-02 21:19:00] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2025-06-02 21:19:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[77]
RANDOM walk for 10000 steps (713 resets) in 132 ms. (75 steps per ms)
BEST_FIRST walk for 10001 steps (89 resets) in 23 ms. (416 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[77]
[2025-06-02 21:19:00] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2025-06-02 21:19:00] [INFO ] Invariant cache hit.
[2025-06-02 21:19:00] [INFO ] [Real]Absence check using 44 positive place invariants in 9 ms returned sat
[2025-06-02 21:19:00] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 12 ms returned sat
[2025-06-02 21:19:01] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2025-06-02 21:19:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:19:01] [INFO ] [Nat]Absence check using 44 positive place invariants in 10 ms returned sat
[2025-06-02 21:19:01] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 10 ms returned sat
[2025-06-02 21:19:01] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2025-06-02 21:19:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:19:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 117 ms returned sat
[2025-06-02 21:19:02] [INFO ] Computed and/alt/rep : 1189/4535/1189 causal constraints (skipped 322 transitions) in 95 ms.
[2025-06-02 21:19:02] [INFO ] Added : 12 causal constraints over 3 iterations in 436 ms. Result :sat
Minimization took 634 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[77]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[77]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1531/1531 transitions.
Applied a total of 0 rules in 35 ms. Remains 411 /411 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Running 1520 sub problems to find dead transitions.
[2025-06-02 21:19:03] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2025-06-02 21:19:03] [INFO ] Invariant cache hit.
[2025-06-02 21:19:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
SMT process timed out in 37120ms, After SMT, problems are : Problem set: 0 solved, 1520 unsolved
Search for dead transitions found 0 dead transitions in 37134ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37172 ms. Remains : 411/411 places, 1531/1531 transitions.
[2025-06-02 21:19:40] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2025-06-02 21:19:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[77]
RANDOM walk for 1000000 steps (70356 resets) in 12977 ms. (77 steps per ms)
BEST_FIRST walk for 1000001 steps (9499 resets) in 2231 ms. (448 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[77]
[2025-06-02 21:19:55] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2025-06-02 21:19:55] [INFO ] Invariant cache hit.
[2025-06-02 21:19:55] [INFO ] [Real]Absence check using 44 positive place invariants in 8 ms returned sat
[2025-06-02 21:19:55] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 10 ms returned sat
[2025-06-02 21:19:55] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2025-06-02 21:19:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:19:56] [INFO ] [Nat]Absence check using 44 positive place invariants in 9 ms returned sat
[2025-06-02 21:19:56] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 10 ms returned sat
[2025-06-02 21:19:56] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2025-06-02 21:19:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:19:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 115 ms returned sat
[2025-06-02 21:19:56] [INFO ] Computed and/alt/rep : 1189/4535/1189 causal constraints (skipped 322 transitions) in 103 ms.
[2025-06-02 21:19:57] [INFO ] Added : 12 causal constraints over 3 iterations in 446 ms. Result :sat
Minimization took 5616 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[77]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[77]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1531/1531 transitions.
Applied a total of 0 rules in 37 ms. Remains 411 /411 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 411/411 places, 1531/1531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1531/1531 transitions.
Applied a total of 0 rules in 27 ms. Remains 411 /411 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-02 21:20:02] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2025-06-02 21:20:02] [INFO ] Invariant cache hit.
[2025-06-02 21:20:03] [INFO ] Implicit Places using invariants in 496 ms returned []
[2025-06-02 21:20:03] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2025-06-02 21:20:03] [INFO ] Invariant cache hit.
[2025-06-02 21:20:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:20:07] [INFO ] Implicit Places using invariants and state equation in 3862 ms returned []
Implicit Place search using SMT with State Equation took 4359 ms to find 0 implicit places.
[2025-06-02 21:20:07] [INFO ] Redundant transitions in 43 ms returned []
Running 1520 sub problems to find dead transitions.
[2025-06-02 21:20:07] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2025-06-02 21:20:07] [INFO ] Invariant cache hit.
[2025-06-02 21:20:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 3 (OVERLAPS) 1/402 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/1933 variables, and 53 constraints, problems are : Problem set: 0 solved, 1520 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 9/18 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1520/1520 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
[2025-06-02 21:20:57] [INFO ] Deduced a trap composed of 18 places in 267 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
[2025-06-02 21:21:13] [INFO ] Deduced a trap composed of 148 places in 346 ms of which 3 ms to minimize.
[2025-06-02 21:21:13] [INFO ] Deduced a trap composed of 108 places in 331 ms of which 3 ms to minimize.
[2025-06-02 21:21:14] [INFO ] Deduced a trap composed of 103 places in 330 ms of which 2 ms to minimize.
[2025-06-02 21:21:16] [INFO ] Deduced a trap composed of 59 places in 352 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1933 variables, and 57 constraints, problems are : Problem set: 0 solved, 1520 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 43/44 constraints, Generalized P Invariants (flows): 9/18 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1520 constraints, Known Traps: 5/5 constraints]
After SMT, in 77675ms problems are : Problem set: 0 solved, 1520 unsolved
Search for dead transitions found 0 dead transitions in 77688ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82132 ms. Remains : 411/411 places, 1531/1531 transitions.
[2025-06-02 21:21:25] [INFO ] Flatten gal took : 194 ms
RANDOM walk for 40000 steps (2781 resets) in 858 ms. (46 steps per ms) remains 2/2 properties
[2025-06-02 21:21:25] [INFO ] Flatten gal took : 133 ms
[2025-06-02 21:21:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8673233516343329769.gal : 15 ms
[2025-06-02 21:21:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4918620384701802410.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8673233516343329769.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4918620384701802410.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40003 steps (380 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (388 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality4918620384701802410.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :31 after 32
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 512
Interrupted probabilistic random walk after 247537 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 2
Probabilistic random walk after 247537 steps, saw 41033 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2025-06-02 21:21:28] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2025-06-02 21:21:28] [INFO ] Invariant cache hit.
[2025-06-02 21:21:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 123/124 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
SDD proceeding with computation,2 properties remain. new max is 32
At refinement iteration 3 (OVERLAPS) 259/383 variables, 43/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD size :512 after 1024
At refinement iteration 5 (OVERLAPS) 26/409 variables, 15/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 21:21:28] [INFO ] Deduced a trap composed of 75 places in 228 ms of which 2 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 1/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/410 variables, 1/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1522/1932 variables, 410/473 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1932 variables, 1/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1932 variables, 0/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/1933 variables, 1/475 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1933 variables, 0/475 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1933 variables, 0/475 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1933/1933 variables, and 475 constraints, problems are : Problem set: 1 solved, 1 unsolved in 789 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 411/411 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/124 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 259/383 variables, 43/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/409 variables, 15/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 1/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 21:21:29] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 1/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/410 variables, 1/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1522/1932 variables, 410/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1932 variables, 1/475 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1932 variables, 0/475 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1933 variables, 1/476 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1933 variables, 1/477 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1933 variables, 0/477 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1933 variables, 0/477 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1933/1933 variables, and 477 constraints, problems are : Problem set: 1 solved, 1 unsolved in 927 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 411/411 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1727ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1531/1531 transitions.
Applied a total of 0 rules in 27 ms. Remains 411 /411 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Running 1520 sub problems to find dead transitions.
[2025-06-02 21:21:30] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2025-06-02 21:21:30] [INFO ] Invariant cache hit.
[2025-06-02 21:21:30] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1024 after 44598
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :44598 after 55129
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :55129 after 151777
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :151777 after 359353
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1520 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 401/1933 variables, and 52 constraints, problems are : Problem set: 0 solved, 1520 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 43/44 constraints, Generalized P Invariants (flows): 9/18 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1520/1520 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
[2025-06-02 21:22:10] [INFO ] Deduced a trap composed of 18 places in 262 ms of which 0 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 21:22:15] [INFO ] Flatten gal took : 87 ms
[2025-06-02 21:22:15] [INFO ] Applying decomposition
[2025-06-02 21:22:15] [INFO ] Flatten gal took : 88 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1198342695113354840.txt' '-o' '/tmp/graph1198342695113354840.bin' '-w' '/tmp/graph1198342695113354840.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1198342695113354840.bin' '-l' '-1' '-v' '-w' '/tmp/graph1198342695113354840.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:22:15] [INFO ] Decomposing Gal with order
[2025-06-02 21:22:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:22:15] [INFO ] Removed a total of 4818 redundant transitions.
[2025-06-02 21:22:15] [INFO ] Flatten gal took : 161 ms
[2025-06-02 21:22:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 295 labels/synchronizations in 56 ms.
[2025-06-02 21:22:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7123708823113755606.gal : 13 ms
[2025-06-02 21:22:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2955590693753213971.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7123708823113755606.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2955590693753213971.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality2955590693753213971.prop.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
[2025-06-02 21:22:27] [INFO ] Deduced a trap composed of 148 places in 351 ms of which 2 ms to minimize.
[2025-06-02 21:22:27] [INFO ] Deduced a trap composed of 108 places in 337 ms of which 3 ms to minimize.
[2025-06-02 21:22:27] [INFO ] Deduced a trap composed of 103 places in 340 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1933 variables, and 56 constraints, problems are : Problem set: 0 solved, 1520 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 43/44 constraints, Generalized P Invariants (flows): 9/18 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1520 constraints, Known Traps: 4/4 constraints]
After SMT, in 58026ms problems are : Problem set: 0 solved, 1520 unsolved
Search for dead transitions found 0 dead transitions in 58039ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58070 ms. Remains : 411/411 places, 1531/1531 transitions.
RANDOM walk for 40000 steps (2820 resets) in 783 ms. (51 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (397 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 275036 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 1
Probabilistic random walk after 275036 steps, saw 45220 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
[2025-06-02 21:22:31] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2025-06-02 21:22:31] [INFO ] Invariant cache hit.
[2025-06-02 21:22:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/124 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 259/383 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/409 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1522/1932 variables, 410/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1932 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1932 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1933 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1933 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1933 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1933/1933 variables, and 474 constraints, problems are : Problem set: 0 solved, 1 unsolved in 539 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 411/411 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/124 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 259/383 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/409 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:22:32] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/410 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1522/1932 variables, 410/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1932 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1932 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/1933 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1933 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1933 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1933 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1933/1933 variables, and 476 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1105 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 411/411 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1671ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1531/1531 transitions.
Applied a total of 0 rules in 32 ms. Remains 411 /411 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 411/411 places, 1531/1531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1531/1531 transitions.
Applied a total of 0 rules in 27 ms. Remains 411 /411 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-02 21:22:33] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2025-06-02 21:22:33] [INFO ] Invariant cache hit.
[2025-06-02 21:22:33] [INFO ] Implicit Places using invariants in 505 ms returned []
[2025-06-02 21:22:33] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2025-06-02 21:22:33] [INFO ] Invariant cache hit.
[2025-06-02 21:22:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:22:37] [INFO ] Implicit Places using invariants and state equation in 3992 ms returned []
Implicit Place search using SMT with State Equation took 4500 ms to find 0 implicit places.
[2025-06-02 21:22:37] [INFO ] Redundant transitions in 42 ms returned []
Running 1520 sub problems to find dead transitions.
[2025-06-02 21:22:37] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2025-06-02 21:22:37] [INFO ] Invariant cache hit.
[2025-06-02 21:22:37] [INFO ] State equation strengthened by 1 read => feed constraints.

BK_STOP 1748899360433

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="PolyORBNT-PT-S10J20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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 gold2024"
echo " Input is PolyORBNT-PT-S10J20, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r167-tall-174881266100085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J20.tgz
mv PolyORBNT-PT-S10J20 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;