About the Execution of 2024-gold for PolyORBNT-PT-S05J60
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15685.030 | 2376720.00 | 2906592.00 | 8127.60 | ? 1 2 5 ? 5 1 1 2 1 1 1 ? 1 1 3 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r167-tall-174881266100083.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-S05J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266100083
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 34K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 162K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 257K 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 24K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 301K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 132K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 641K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K 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 1.5M 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-S05J60-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748898613205
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-S05J60
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 21:10:14] [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:10:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:10:14] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2025-06-02 21:10:14] [INFO ] Transformed 909 places.
[2025-06-02 21:10:14] [INFO ] Transformed 1970 transitions.
[2025-06-02 21:10:14] [INFO ] Parsed PT model containing 909 places and 1970 transitions and 12584 arcs in 297 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 5, 0, 5, 1, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +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, 0, 5, 0, 5, 1, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 21:10:14] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2025-06-02 21:10:14] [INFO ] Computed 142 invariants in 131 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 5, 0, 5, 1, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[262, 361, 131, 201, 262, 201, 262, 88, 262, 245, 1, 65, 1, 53, 786]
RANDOM walk for 10000 steps (690 resets) in 148 ms. (67 steps per ms)
FORMULA PolyORBNT-PT-S05J60-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 140013 steps (1560 resets) in 409 ms. (341 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 1, 2, 5, 3, 5, 1, 1, 2, 1, 0, 1, 1, 3] Max Struct:[262, 361, 131, 201, 262, 201, 262, 88, 262, 245, 1, 65, 53, 786]
[2025-06-02 21:10:15] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2025-06-02 21:10:15] [INFO ] Invariant cache hit.
[2025-06-02 21:10:15] [INFO ] [Real]Absence check using 111 positive place invariants in 45 ms returned sat
[2025-06-02 21:10:16] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 39 ms returned sat
[2025-06-02 21:10:16] [INFO ] [Real]Absence check using state equation in 742 ms returned sat
[2025-06-02 21:10:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:10:16] [INFO ] [Nat]Absence check using 111 positive place invariants in 27 ms returned sat
[2025-06-02 21:10:17] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 34 ms returned sat
[2025-06-02 21:10:17] [INFO ] [Nat]Absence check using state equation in 760 ms returned sat
[2025-06-02 21:10:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:10:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 311 ms returned sat
[2025-06-02 21:10:18] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 118 ms.
[2025-06-02 21:10:18] [INFO ] Added : 16 causal constraints over 4 iterations in 612 ms. Result :sat
Minimization took 563 ms.
[2025-06-02 21:10:19] [INFO ] [Real]Absence check using 111 positive place invariants in 24 ms returned sat
[2025-06-02 21:10:19] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 32 ms returned unsat
[2025-06-02 21:10:19] [INFO ] [Real]Absence check using 111 positive place invariants in 27 ms returned sat
[2025-06-02 21:10:19] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 28 ms returned unsat
[2025-06-02 21:10:19] [INFO ] [Real]Absence check using 111 positive place invariants in 24 ms returned sat
[2025-06-02 21:10:19] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 32 ms returned unsat
[2025-06-02 21:10:19] [INFO ] [Real]Absence check using 111 positive place invariants in 25 ms returned sat
[2025-06-02 21:10:20] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 34 ms returned sat
[2025-06-02 21:10:20] [INFO ] [Real]Absence check using state equation in 790 ms returned sat
[2025-06-02 21:10:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:10:21] [INFO ] [Nat]Absence check using 111 positive place invariants in 24 ms returned sat
[2025-06-02 21:10:21] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 34 ms returned sat
[2025-06-02 21:10:22] [INFO ] [Nat]Absence check using state equation in 1005 ms returned sat
[2025-06-02 21:10:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 332 ms returned sat
[2025-06-02 21:10:22] [INFO ] Deduced a trap composed of 540 places in 435 ms of which 51 ms to minimize.
[2025-06-02 21:10:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 613 ms
[2025-06-02 21:10:23] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 104 ms.
[2025-06-02 21:10:23] [INFO ] Added : 17 causal constraints over 4 iterations in 798 ms. Result :sat
Minimization took 555 ms.
[2025-06-02 21:10:24] [INFO ] [Real]Absence check using 111 positive place invariants in 47 ms returned sat
[2025-06-02 21:10:24] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 75 ms returned unsat
[2025-06-02 21:10:24] [INFO ] [Real]Absence check using 111 positive place invariants in 21 ms returned sat
[2025-06-02 21:10:24] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 27 ms returned unsat
[2025-06-02 21:10:24] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2025-06-02 21:10:24] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 32 ms returned unsat
[2025-06-02 21:10:25] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2025-06-02 21:10:25] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 34 ms returned unsat
[2025-06-02 21:10:25] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2025-06-02 21:10:25] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 41 ms returned unsat
[2025-06-02 21:10:25] [INFO ] [Real]Absence check using 111 positive place invariants in 40 ms returned sat
[2025-06-02 21:10:25] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 37 ms returned sat
[2025-06-02 21:10:25] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2025-06-02 21:10:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:10:26] [INFO ] [Nat]Absence check using 111 positive place invariants in 25 ms returned sat
[2025-06-02 21:10:26] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 34 ms returned sat
[2025-06-02 21:10:26] [INFO ] [Nat]Absence check using state equation in 512 ms returned sat
[2025-06-02 21:10:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 377 ms returned sat
[2025-06-02 21:10:27] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 82 ms.
[2025-06-02 21:10:28] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 2 ms to minimize.
[2025-06-02 21:10:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2025-06-02 21:10:28] [INFO ] Added : 35 causal constraints over 7 iterations in 1158 ms. Result :sat
Minimization took 831 ms.
[2025-06-02 21:10:29] [INFO ] [Real]Absence check using 111 positive place invariants in 24 ms returned sat
[2025-06-02 21:10:29] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 37 ms returned unsat
[2025-06-02 21:10:29] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2025-06-02 21:10:29] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 4 ms returned unsat
[2025-06-02 21:10:29] [INFO ] [Real]Absence check using 111 positive place invariants in 25 ms returned sat
[2025-06-02 21:10:29] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 38 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[3, 1, 2, 5, 3, 5, 1, 1, 2, 1, 0, 1, 1, 3] Max Struct:[262, 1, 2, 5, 262, 5, 1, 1, 2, 1, 1, 1, 1, 3]
FORMULA PolyORBNT-PT-S05J60-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3, 0] Max Struct:[262, 262, 1]
Support contains 3 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 904 transition count 1250
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 136 place count 839 transition count 1249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 137 place count 838 transition count 1185
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 265 place count 774 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 266 place count 773 transition count 1184
Iterating global reduction 3 with 1 rules applied. Total rules applied 267 place count 773 transition count 1184
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 271 place count 771 transition count 1182
Applied a total of 271 rules in 297 ms. Remains 771 /909 variables (removed 138) and now considering 1182/1315 (removed 133) transitions.
Running 1176 sub problems to find dead transitions.
[2025-06-02 21:10:29] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
// Phase 1: matrix 1178 rows 771 cols
[2025-06-02 21:10:29] [INFO ] Computed 137 invariants in 65 ms
[2025-06-02 21:10:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1949 variables, and 132 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
[2025-06-02 21:10:58] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 2 ms to minimize.
[2025-06-02 21:10:58] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 2 ms to minimize.
[2025-06-02 21:11:02] [INFO ] Deduced a trap composed of 214 places in 316 ms of which 5 ms to minimize.
[2025-06-02 21:11:03] [INFO ] Deduced a trap composed of 193 places in 313 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1949 variables, and 136 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 4/4 constraints]
After SMT, in 43084ms problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 43111ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43430 ms. Remains : 771/909 places, 1182/1315 transitions.
[2025-06-02 21:11:12] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:11:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3, 0] Max Struct:[136, 136, 1]
RANDOM walk for 1000000 steps (47367 resets) in 6647 ms. (150 steps per ms)
FORMULA PolyORBNT-PT-S05J60-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (6776 resets) in 2908 ms. (687 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3] Max Struct:[136, 136]
[2025-06-02 21:11:22] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:11:22] [INFO ] Invariant cache hit.
[2025-06-02 21:11:22] [INFO ] [Real]Absence check using 111 positive place invariants in 20 ms returned sat
[2025-06-02 21:11:22] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 30 ms returned sat
[2025-06-02 21:11:23] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2025-06-02 21:11:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:11:23] [INFO ] [Nat]Absence check using 111 positive place invariants in 24 ms returned sat
[2025-06-02 21:11:23] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 25 ms returned sat
[2025-06-02 21:11:23] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2025-06-02 21:11:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:11:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 420 ms returned sat
[2025-06-02 21:11:24] [INFO ] Computed and/alt/rep : 617/2122/617 causal constraints (skipped 555 transitions) in 63 ms.
[2025-06-02 21:11:24] [INFO ] Added : 10 causal constraints over 3 iterations in 551 ms. Result :sat
Minimization took 2144 ms.
[2025-06-02 21:11:27] [INFO ] [Real]Absence check using 111 positive place invariants in 20 ms returned sat
[2025-06-02 21:11:27] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 25 ms returned sat
[2025-06-02 21:11:27] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2025-06-02 21:11:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:11:27] [INFO ] [Nat]Absence check using 111 positive place invariants in 20 ms returned sat
[2025-06-02 21:11:27] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 25 ms returned sat
[2025-06-02 21:11:28] [INFO ] [Nat]Absence check using state equation in 658 ms returned sat
[2025-06-02 21:11:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 257 ms returned sat
[2025-06-02 21:11:28] [INFO ] Computed and/alt/rep : 617/2122/617 causal constraints (skipped 555 transitions) in 61 ms.
[2025-06-02 21:11:29] [INFO ] Added : 11 causal constraints over 3 iterations in 401 ms. Result :sat
Minimization took 2145 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3] Max Struct:[136, 136]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3] Max Struct:[136, 136]
Support contains 2 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1182/1182 transitions.
Applied a total of 0 rules in 43 ms. Remains 771 /771 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 771/771 places, 1182/1182 transitions.
[2025-06-02 21:11:31] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:11:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3] Max Struct:[136, 136]
RANDOM walk for 1000000 steps (47336 resets) in 6646 ms. (150 steps per ms)
BEST_FIRST walk for 2000002 steps (6610 resets) in 2912 ms. (686 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3] Max Struct:[136, 136]
[2025-06-02 21:11:40] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:11:40] [INFO ] Invariant cache hit.
[2025-06-02 21:11:41] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2025-06-02 21:11:41] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 28 ms returned sat
[2025-06-02 21:11:41] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2025-06-02 21:11:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:11:41] [INFO ] [Nat]Absence check using 111 positive place invariants in 22 ms returned sat
[2025-06-02 21:11:41] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 26 ms returned sat
[2025-06-02 21:11:42] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2025-06-02 21:11:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:11:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 422 ms returned sat
[2025-06-02 21:11:42] [INFO ] Computed and/alt/rep : 617/2122/617 causal constraints (skipped 555 transitions) in 62 ms.
[2025-06-02 21:11:43] [INFO ] Added : 10 causal constraints over 3 iterations in 550 ms. Result :sat
Minimization took 2124 ms.
[2025-06-02 21:11:45] [INFO ] [Real]Absence check using 111 positive place invariants in 21 ms returned sat
[2025-06-02 21:11:45] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 24 ms returned sat
[2025-06-02 21:11:45] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2025-06-02 21:11:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:11:45] [INFO ] [Nat]Absence check using 111 positive place invariants in 22 ms returned sat
[2025-06-02 21:11:45] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 27 ms returned sat
[2025-06-02 21:11:46] [INFO ] [Nat]Absence check using state equation in 664 ms returned sat
[2025-06-02 21:11:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 259 ms returned sat
[2025-06-02 21:11:47] [INFO ] Computed and/alt/rep : 617/2122/617 causal constraints (skipped 555 transitions) in 62 ms.
[2025-06-02 21:11:47] [INFO ] Added : 11 causal constraints over 3 iterations in 410 ms. Result :sat
Minimization took 2139 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3] Max Struct:[136, 136]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3] Max Struct:[136, 136]
Support contains 2 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1182/1182 transitions.
Applied a total of 0 rules in 45 ms. Remains 771 /771 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 771/771 places, 1182/1182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1182/1182 transitions.
Applied a total of 0 rules in 45 ms. Remains 771 /771 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
[2025-06-02 21:11:49] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:11:49] [INFO ] Invariant cache hit.
[2025-06-02 21:11:51] [INFO ] Implicit Places using invariants in 1536 ms returned []
[2025-06-02 21:11:51] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:11:51] [INFO ] Invariant cache hit.
[2025-06-02 21:11:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:12:05] [INFO ] Implicit Places using invariants and state equation in 14618 ms returned []
Implicit Place search using SMT with State Equation took 16159 ms to find 0 implicit places.
[2025-06-02 21:12:05] [INFO ] Redundant transitions in 65 ms returned []
Running 1176 sub problems to find dead transitions.
[2025-06-02 21:12:05] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:12:05] [INFO ] Invariant cache hit.
[2025-06-02 21:12:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
[2025-06-02 21:12:33] [INFO ] Deduced a trap composed of 14 places in 296 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1949 variables, and 133 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
[2025-06-02 21:12:40] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2025-06-02 21:12:48] [INFO ] Deduced a trap composed of 214 places in 314 ms of which 4 ms to minimize.
[2025-06-02 21:12:48] [INFO ] Deduced a trap composed of 187 places in 302 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1949 variables, and 136 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 4/4 constraints]
After SMT, in 62521ms problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 62532ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78815 ms. Remains : 771/771 places, 1182/1182 transitions.
RANDOM walk for 40001 steps (1892 resets) in 1358 ms. (29 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (122 resets) in 202 ms. (197 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (138 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (154 resets) in 179 ms. (222 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (123 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
[2025-06-02 21:13:09] [INFO ] Flatten gal took : 299 ms
[2025-06-02 21:13:09] [INFO ] Flatten gal took : 103 ms
[2025-06-02 21:13:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13170100278011462476.gal : 44 ms
[2025-06-02 21:13:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7533459958074962565.prop : 1 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/ReachabilityCardinality13170100278011462476.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7533459958074962565.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/ReachabilityCardinality7533459958074962565.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :8 after 32
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :32 after 68
Interrupted probabilistic random walk after 121949 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 4
Probabilistic random walk after 121949 steps, saw 36905 distinct states, run finished after 3004 ms. (steps per millisecond=40 ) properties seen :0
[2025-06-02 21:13:12] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:13:12] [INFO ] Invariant cache hit.
[2025-06-02 21:13:12] [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 MAX0 is UNSAT
At refinement iteration 1 (OVERLAPS) 332/334 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem MAX1 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 406/740 variables, 111/114 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/740 variables, 0/114 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/770 variables, 23/137 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/770 variables, 0/137 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1178/1948 variables, 770/907 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1948 variables, 1/908 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1948 variables, 0/908 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1949 variables, 1/909 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1949 variables, 0/909 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1949 variables, 0/909 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1949/1949 variables, and 909 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1118 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 771/771 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) 332/334 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 406/740 variables, 111/114 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/740 variables, 0/114 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/770 variables, 23/137 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/770 variables, 0/137 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1178/1948 variables, 770/907 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1948 variables, 1/908 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1948 variables, 0/908 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1949 variables, 1/909 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1949 variables, 2/911 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2025-06-02 21:13:14] [INFO ] Deduced a trap composed of 214 places in 310 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1949 variables, 1/912 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1949 variables, 0/912 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1949 variables, 0/912 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1949/1949 variables, and 912 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1617 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 771/771 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 2755ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 75 ms.
Support contains 2 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1182/1182 transitions.
Applied a total of 0 rules in 39 ms. Remains 771 /771 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
Running 1176 sub problems to find dead transitions.
[2025-06-02 21:13:14] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:13:14] [INFO ] Invariant cache hit.
[2025-06-02 21:13:14] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :68 after 12173
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 4.0)
(s178 0.0)
(s179 0.0)
(s180 4.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 5.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 5.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 4.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 1.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 4.0)
(s452 0.0)
(s453 0.0)
(s454 1.0)
(s455 0.0)
(s456 1.0)
(s457 4.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 1.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 1.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 1.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 1.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 1.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 1.0)
(s576 0.0)
(s577 1.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 1.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 1.0)
(s606 9.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 1.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 1.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 1.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 1.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 1.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 4.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 1.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 1.0)
(s720 1.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 1.0)
(s736 0.0)
(s737 1.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 1.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 1.0)
(s750 1.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1949 variables, and 132 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
[2025-06-02 21:13:39] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 2 ms to minimize.
[2025-06-02 21:13:54] [INFO ] Deduced a trap composed of 14 places in 333 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 0)
(s180 4)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 1)
(s215 0)
(s216 1)
(s217 0)
(s218 0)
(s219 1)
(s220 8)
(s221 0)
(s222 0)
(s223 0)
(s224 1)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 1)
(s259 1)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 2)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 1)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 1)
(s348 1)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 1)
(s370 0)
(s371 0)
(s372 0)
(s373 1)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 1)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 1)
(s391 0)
(s392 4)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 1)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 1)
(s414 1)
(s415 0)
(s416 1)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 1)
(s429 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 1)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 1)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 1)
(s451 4)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 4)
(s458 0)
(s459 1)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 1)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 1)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 1)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 1)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1949 variables, and 134 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 2/2 constraints]
After SMT, in 42775ms problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 42787ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42831 ms. Remains : 771/771 places, 1182/1182 transitions.
RANDOM walk for 40000 steps (1897 resets) in 530 ms. (75 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (133 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (145 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
Detected timeout of ITS tools.
[2025-06-02 21:13:59] [INFO ] Flatten gal took : 78 ms
[2025-06-02 21:13:59] [INFO ] Applying decomposition
[2025-06-02 21:13:59] [INFO ] Flatten gal took : 65 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/graph1304813682490614524.txt' '-o' '/tmp/graph1304813682490614524.bin' '-w' '/tmp/graph1304813682490614524.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1304813682490614524.bin' '-l' '-1' '-v' '-w' '/tmp/graph1304813682490614524.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:13:59] [INFO ] Decomposing Gal with order
[2025-06-02 21:13:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:14:00] [INFO ] Removed a total of 1081 redundant transitions.
[2025-06-02 21:14:00] [INFO ] Flatten gal took : 296 ms
[2025-06-02 21:14:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 35 ms.
[2025-06-02 21:14:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality593386987105393683.gal : 21 ms
[2025-06-02 21:14:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15829252493318115559.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/ReachabilityCardinality593386987105393683.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15829252493318115559.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/ReachabilityCardinality15829252493318115559.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 66
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :66 after 68
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :68 after 72
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :72 after 78
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :78 after 88
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :88 after 105
Interrupted probabilistic random walk after 133776 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 2
Probabilistic random walk after 133776 steps, saw 40198 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2025-06-02 21:14:01] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:14:01] [INFO ] Invariant cache hit.
[2025-06-02 21:14:01] [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) 332/334 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 406/740 variables, 111/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/740 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/770 variables, 23/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/770 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1178/1948 variables, 770/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1948 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1948 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1949 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1949 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1949 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1949/1949 variables, and 909 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1011 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 771/771 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) 332/334 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 406/740 variables, 111/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/740 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/770 variables, 23/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/770 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1178/1948 variables, 770/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1948 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1948 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1949 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1949 variables, 2/911 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:14:03] [INFO ] Deduced a trap composed of 214 places in 333 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1949 variables, 1/912 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1949 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1949 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1949/1949 variables, and 912 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1678 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 771/771 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2699ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 73 ms.
Support contains 2 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1182/1182 transitions.
Applied a total of 0 rules in 38 ms. Remains 771 /771 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 771/771 places, 1182/1182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1182/1182 transitions.
Applied a total of 0 rules in 30 ms. Remains 771 /771 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
[2025-06-02 21:14:03] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:14:03] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :105 after 1.41892e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.41892e+07 after 1.41892e+07
[2025-06-02 21:14:05] [INFO ] Implicit Places using invariants in 1525 ms returned []
[2025-06-02 21:14:05] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:14:05] [INFO ] Invariant cache hit.
[2025-06-02 21:14:06] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.41892e+07 after 1.22859e+08
[2025-06-02 21:14:20] [INFO ] Implicit Places using invariants and state equation in 14834 ms returned []
Implicit Place search using SMT with State Equation took 16361 ms to find 0 implicit places.
[2025-06-02 21:14:20] [INFO ] Redundant transitions in 81 ms returned []
Running 1176 sub problems to find dead transitions.
[2025-06-02 21:14:20] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:14:20] [INFO ] Invariant cache hit.
[2025-06-02 21:14:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
[2025-06-02 21:14:49] [INFO ] Deduced a trap composed of 14 places in 315 ms of which 5 ms to minimize.
Detected timeout of ITS tools.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1949 variables, and 133 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
[2025-06-02 21:14:55] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:15:03] [INFO ] Deduced a trap composed of 214 places in 315 ms of which 5 ms to minimize.
[2025-06-02 21:15:04] [INFO ] Deduced a trap composed of 187 places in 306 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1949 variables, and 136 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 4/4 constraints]
After SMT, in 63178ms problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 63188ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79684 ms. Remains : 771/771 places, 1182/1182 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3, 3] Max Struct:[136, 136]
Starting property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-00
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:[136]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[136]
[2025-06-02 21:15:23] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:15:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[136]
RANDOM walk for 10000 steps (481 resets) in 68 ms. (144 steps per ms)
BEST_FIRST walk for 10001 steps (25 resets) in 15 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[136]
[2025-06-02 21:15:23] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:15:23] [INFO ] Invariant cache hit.
[2025-06-02 21:15:23] [INFO ] [Real]Absence check using 111 positive place invariants in 21 ms returned sat
[2025-06-02 21:15:23] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 27 ms returned sat
[2025-06-02 21:15:24] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2025-06-02 21:15:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:15:24] [INFO ] [Nat]Absence check using 111 positive place invariants in 20 ms returned sat
[2025-06-02 21:15:24] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 28 ms returned sat
[2025-06-02 21:15:24] [INFO ] [Nat]Absence check using state equation in 539 ms returned sat
[2025-06-02 21:15:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:15:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 434 ms returned sat
[2025-06-02 21:15:25] [INFO ] Computed and/alt/rep : 617/2122/617 causal constraints (skipped 555 transitions) in 64 ms.
[2025-06-02 21:15:25] [INFO ] Added : 10 causal constraints over 3 iterations in 560 ms. Result :sat
Minimization took 583 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[136]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[136]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1182/1182 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 771 transition count 1181
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 770 transition count 1181
Applied a total of 2 rules in 44 ms. Remains 770 /771 variables (removed 1) and now considering 1181/1182 (removed 1) transitions.
Running 1175 sub problems to find dead transitions.
[2025-06-02 21:15:26] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
// Phase 1: matrix 1177 rows 770 cols
[2025-06-02 21:15:26] [INFO ] Computed 137 invariants in 31 ms
[2025-06-02 21:15:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1175 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 765/1947 variables, and 132 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
[2025-06-02 21:15:51] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1947 variables, and 133 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 1/1 constraints]
After SMT, in 42740ms problems are : Problem set: 0 solved, 1175 unsolved
Search for dead transitions found 0 dead transitions in 42752ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42799 ms. Remains : 770/771 places, 1181/1182 transitions.
[2025-06-02 21:16:09] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2025-06-02 21:16:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[136]
RANDOM walk for 1000000 steps (52370 resets) in 7080 ms. (141 steps per ms)
BEST_FIRST walk for 1000001 steps (3479 resets) in 1462 ms. (683 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[136]
[2025-06-02 21:16:17] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2025-06-02 21:16:17] [INFO ] Invariant cache hit.
[2025-06-02 21:16:17] [INFO ] [Real]Absence check using 111 positive place invariants in 20 ms returned sat
[2025-06-02 21:16:17] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 26 ms returned sat
[2025-06-02 21:16:18] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2025-06-02 21:16:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:16:18] [INFO ] [Nat]Absence check using 111 positive place invariants in 21 ms returned sat
[2025-06-02 21:16:18] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 26 ms returned sat
[2025-06-02 21:16:18] [INFO ] [Nat]Absence check using state equation in 394 ms returned sat
[2025-06-02 21:16:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:16:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 238 ms returned sat
[2025-06-02 21:16:19] [INFO ] Computed and/alt/rep : 616/2116/616 causal constraints (skipped 555 transitions) in 63 ms.
[2025-06-02 21:16:19] [INFO ] Added : 11 causal constraints over 3 iterations in 429 ms. Result :sat
Minimization took 3374 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[136]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[136]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 30 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 770/770 places, 1181/1181 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 29 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
[2025-06-02 21:16:23] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2025-06-02 21:16:23] [INFO ] Invariant cache hit.
[2025-06-02 21:16:24] [INFO ] Implicit Places using invariants in 1411 ms returned []
[2025-06-02 21:16:24] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2025-06-02 21:16:24] [INFO ] Invariant cache hit.
[2025-06-02 21:16:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:16:39] [INFO ] Implicit Places using invariants and state equation in 14620 ms returned []
Implicit Place search using SMT with State Equation took 16033 ms to find 0 implicit places.
[2025-06-02 21:16:39] [INFO ] Redundant transitions in 26 ms returned []
Running 1175 sub problems to find dead transitions.
[2025-06-02 21:16:39] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2025-06-02 21:16:39] [INFO ] Invariant cache hit.
[2025-06-02 21:16:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 3 (OVERLAPS) 5/770 variables, 5/137 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 770/1947 variables, and 137 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
[2025-06-02 21:17:16] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 3 ms to minimize.
[2025-06-02 21:17:34] [INFO ] Deduced a trap composed of 13 places in 292 ms of which 5 ms to minimize.
[2025-06-02 21:17:42] [INFO ] Deduced a trap composed of 274 places in 298 ms of which 7 ms to minimize.
SMT process timed out in 62980ms, After SMT, problems are : Problem set: 0 solved, 1175 unsolved
Search for dead transitions found 0 dead transitions in 62991ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79090 ms. Remains : 770/770 places, 1181/1181 transitions.
[2025-06-02 21:17:42] [INFO ] Flatten gal took : 55 ms
[2025-06-02 21:17:42] [INFO ] Flatten gal took : 55 ms
[2025-06-02 21:17:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4410865080690425038.gal : 11 ms
[2025-06-02 21:17:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4977367494322469003.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/ReachabilityCardinality4410865080690425038.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4977367494322469003.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
RANDOM walk for 40000 steps (2069 resets) in 625 ms. (63 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality4977367494322469003.prop.
BEST_FIRST walk for 40004 steps (139 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (112 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 32
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :32 after 68
Interrupted probabilistic random walk after 134410 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 2
Probabilistic random walk after 134410 steps, saw 39686 distinct states, run finished after 3002 ms. (steps per millisecond=44 ) properties seen :0
[2025-06-02 21:17:45] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2025-06-02 21:17:45] [INFO ] Invariant cache hit.
[2025-06-02 21:17:45] [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) 331/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1946/1947 variables, and 906 constraints, problems are : Problem set: 1 solved, 1 unsolved in 983 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 769/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 331/332 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1177/1946 variables, 769/906 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :68 after 12445
At refinement iteration 8 (INCLUDED_ONLY) 0/1946 variables, 1/907 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 21:17:47] [INFO ] Deduced a trap composed of 392 places in 318 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1946 variables, 1/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1946 variables, 0/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/1947 variables, 1/909 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1947 variables, 1/910 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1947 variables, 0/910 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1947 variables, 0/910 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1947/1947 variables, and 910 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1565 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2581ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 32 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
Running 1175 sub problems to find dead transitions.
[2025-06-02 21:17:48] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2025-06-02 21:17:48] [INFO ] Invariant cache hit.
[2025-06-02 21:17:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 4.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 9.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 1.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 4.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 1.0)
(s413 1.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 1.0)
(s450 4.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 4.0)
(s457 0.0)
(s458 1.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 1.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 1.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 1.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 1.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 1.0)
(s575 0.0)
(s576 1.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 timeout
0.0)
(s582 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1947 variables, and 132 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
[2025-06-02 21:18:15] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 2 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 765/1947 variables, and 133 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 1/1 constraints]
After SMT, in 42753ms problems are : Problem set: 0 solved, 1175 unsolved
Search for dead transitions found 0 dead transitions in 42772ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42808 ms. Remains : 770/770 places, 1181/1181 transitions.
RANDOM walk for 40000 steps (2040 resets) in 437 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (139 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Detected timeout of ITS tools.
[2025-06-02 21:18:32] [INFO ] Flatten gal took : 51 ms
[2025-06-02 21:18:32] [INFO ] Applying decomposition
[2025-06-02 21:18:32] [INFO ] Flatten gal took : 50 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/graph3010165689619341987.txt' '-o' '/tmp/graph3010165689619341987.bin' '-w' '/tmp/graph3010165689619341987.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3010165689619341987.bin' '-l' '-1' '-v' '-w' '/tmp/graph3010165689619341987.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:18:32] [INFO ] Decomposing Gal with order
[2025-06-02 21:18:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:18:32] [INFO ] Removed a total of 1600 redundant transitions.
[2025-06-02 21:18:32] [INFO ] Flatten gal took : 187 ms
[2025-06-02 21:18:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 465 labels/synchronizations in 46 ms.
[2025-06-02 21:18:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11389430288679679340.gal : 15 ms
[2025-06-02 21:18:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14687673845953767858.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/ReachabilityCardinality11389430288679679340.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14687673845953767858.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 ...309
Loading property file /tmp/ReachabilityCardinality14687673845953767858.prop.
Interrupted probabilistic random walk after 159720 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 1
Probabilistic random walk after 159720 steps, saw 46772 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
[2025-06-02 21:18:34] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2025-06-02 21:18:34] [INFO ] Invariant cache hit.
[2025-06-02 21:18:34] [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) 331/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1177/1946 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1946 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1946 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1947 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1947 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1947 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1947/1947 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 869 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 770/770 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) 331/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1177/1946 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1946 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:18:36] [INFO ] Deduced a trap composed of 392 places in 356 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1946 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1946 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/1947 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1947 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1947 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1947 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1947/1947 variables, and 910 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1780 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2690ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 31 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 770/770 places, 1181/1181 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 29 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
[2025-06-02 21:18:36] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2025-06-02 21:18:36] [INFO ] Invariant cache hit.
[2025-06-02 21:18:38] [INFO ] Implicit Places using invariants in 1779 ms returned []
[2025-06-02 21:18:38] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2025-06-02 21:18:38] [INFO ] Invariant cache hit.
[2025-06-02 21:18:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:18:52] [INFO ] Implicit Places using invariants and state equation in 14145 ms returned []
Implicit Place search using SMT with State Equation took 15928 ms to find 0 implicit places.
[2025-06-02 21:18:52] [INFO ] Redundant transitions in 21 ms returned []
Running 1175 sub problems to find dead transitions.
[2025-06-02 21:18:52] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2025-06-02 21:18:52] [INFO ] Invariant cache hit.
[2025-06-02 21:18:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Detected timeout of ITS tools.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Problem TDEAD739 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/770 variables, 5/137 constraints. Problems are: Problem set: 95 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 770/1947 variables, and 137 constraints, problems are : Problem set: 95 solved, 1080 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 95 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 95 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 95 solved, 1080 unsolved
[2025-06-02 21:19:27] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 1/133 constraints. Problems are: Problem set: 95 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1947 variables, and 133 constraints, problems are : Problem set: 95 solved, 1080 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 1/1 constraints]
After SMT, in 62808ms problems are : Problem set: 95 solved, 1080 unsolved
Search for dead transitions found 95 dead transitions in 62823ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) removed 95 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 770/770 places, 1086/1181 transitions.
Applied a total of 0 rules in 40 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2025-06-02 21:19:55] [INFO ] Redundant transitions in 19 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 78897 ms. Remains : 770/770 places, 1086/1181 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[136]
Ending property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-00 in 272329 ms.
Starting property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-04
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:[136]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[136]
[2025-06-02 21:19:55] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
// Phase 1: matrix 1178 rows 771 cols
[2025-06-02 21:19:55] [INFO ] Computed 137 invariants in 29 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[136]
RANDOM walk for 10000 steps (465 resets) in 73 ms. (135 steps per ms)
BEST_FIRST walk for 10001 steps (34 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[136]
[2025-06-02 21:19:55] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:19:55] [INFO ] Invariant cache hit.
[2025-06-02 21:19:56] [INFO ] [Real]Absence check using 111 positive place invariants in 21 ms returned sat
[2025-06-02 21:19:56] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 24 ms returned sat
[2025-06-02 21:19:56] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2025-06-02 21:19:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:19:56] [INFO ] [Nat]Absence check using 111 positive place invariants in 21 ms returned sat
[2025-06-02 21:19:56] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 26 ms returned sat
[2025-06-02 21:19:57] [INFO ] [Nat]Absence check using state equation in 660 ms returned sat
[2025-06-02 21:19:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:19:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 257 ms returned sat
[2025-06-02 21:19:57] [INFO ] Computed and/alt/rep : 617/2122/617 causal constraints (skipped 555 transitions) in 64 ms.
[2025-06-02 21:19:58] [INFO ] Added : 11 causal constraints over 3 iterations in 417 ms. Result :sat
Minimization took 778 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[136]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[136]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1182/1182 transitions.
Applied a total of 0 rules in 37 ms. Remains 771 /771 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
Running 1176 sub problems to find dead transitions.
[2025-06-02 21:19:58] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:19:58] [INFO ] Invariant cache hit.
[2025-06-02 21:19:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1949 variables, and 132 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
[2025-06-02 21:20:22] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 2 ms to minimize.
[2025-06-02 21:20:37] [INFO ] Deduced a trap composed of 14 places in 304 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1949 variables, and 134 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 2/2 constraints]
After SMT, in 42420ms problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 42430ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42469 ms. Remains : 771/771 places, 1182/1182 transitions.
[2025-06-02 21:20:41] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:20:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[136]
RANDOM walk for 1000000 steps (47447 resets) in 6552 ms. (152 steps per ms)
BEST_FIRST walk for 1000001 steps (3224 resets) in 1455 ms. (686 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[136]
[2025-06-02 21:20:49] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:20:49] [INFO ] Invariant cache hit.
[2025-06-02 21:20:49] [INFO ] [Real]Absence check using 111 positive place invariants in 22 ms returned sat
[2025-06-02 21:20:49] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 25 ms returned sat
[2025-06-02 21:20:49] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2025-06-02 21:20:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:20:49] [INFO ] [Nat]Absence check using 111 positive place invariants in 21 ms returned sat
[2025-06-02 21:20:49] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 28 ms returned sat
[2025-06-02 21:20:50] [INFO ] [Nat]Absence check using state equation in 681 ms returned sat
[2025-06-02 21:20:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:20:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 263 ms returned sat
[2025-06-02 21:20:51] [INFO ] Computed and/alt/rep : 617/2122/617 causal constraints (skipped 555 transitions) in 61 ms.
[2025-06-02 21:20:51] [INFO ] Added : 11 causal constraints over 3 iterations in 416 ms. Result :sat
Minimization took 2177 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[136]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[136]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1182/1182 transitions.
Applied a total of 0 rules in 38 ms. Remains 771 /771 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 771/771 places, 1182/1182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1182/1182 transitions.
Applied a total of 0 rules in 28 ms. Remains 771 /771 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
[2025-06-02 21:20:53] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:20:53] [INFO ] Invariant cache hit.
[2025-06-02 21:20:55] [INFO ] Implicit Places using invariants in 1344 ms returned []
[2025-06-02 21:20:55] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:20:55] [INFO ] Invariant cache hit.
[2025-06-02 21:20:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:21:09] [INFO ] Implicit Places using invariants and state equation in 14403 ms returned []
Implicit Place search using SMT with State Equation took 15747 ms to find 0 implicit places.
[2025-06-02 21:21:09] [INFO ] Redundant transitions in 18 ms returned []
Running 1176 sub problems to find dead transitions.
[2025-06-02 21:21:09] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:21:09] [INFO ] Invariant cache hit.
[2025-06-02 21:21:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
[2025-06-02 21:21:38] [INFO ] Deduced a trap composed of 14 places in 319 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1949 variables, and 133 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
[2025-06-02 21:21:43] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2025-06-02 21:21:52] [INFO ] Deduced a trap composed of 214 places in 335 ms of which 4 ms to minimize.
[2025-06-02 21:21:53] [INFO ] Deduced a trap composed of 187 places in 329 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 1)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 1)
(s215 0)
(s216 1)
(s217 0)
(s218 0)
(s219 1)
(s220 8)
(s221 0)
(s222 0)
(s223 0)
(s224 1)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 1)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 2)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 1)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 1)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 1)
(s349 0)
(s350 0)
(s351 1)
(s352 1)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 1)
(s370 0)
(s371 0)
(s372 0)
(s373 1)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 1)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 1)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 1)
(s414 1)
(s415 0)
(s416 1)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 1)
(s429 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 1)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 1)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 1)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 1)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 1)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 1)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 1)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 1)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 1)
(s576 0)
(s577 1)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 1)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 1)
(s606 1)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1949 variables, and 136 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 4/4 constraints]
After SMT, in 62441ms problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 62452ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78257 ms. Remains : 771/771 places, 1182/1182 transitions.
[2025-06-02 21:22:11] [INFO ] Flatten gal took : 45 ms
[2025-06-02 21:22:12] [INFO ] Flatten gal took : 86 ms
[2025-06-02 21:22:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15129812397995469033.gal : 12 ms
[2025-06-02 21:22:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11428453930816765044.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/ReachabilityCardinality15129812397995469033.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11428453930816765044.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 ...330
RANDOM walk for 40001 steps (1801 resets) in 566 ms. (70 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (136 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (132 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality11428453930816765044.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 32
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :32 after 68
Interrupted probabilistic random walk after 142599 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 2
Probabilistic random walk after 142599 steps, saw 42782 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
[2025-06-02 21:22:15] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:22:15] [INFO ] Invariant cache hit.
[2025-06-02 21:22:15] [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) 333/334 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 406/740 variables, 111/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/740 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/770 variables, 23/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/770 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1178/1948 variables, 770/907 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1948 variables, 1/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1948 variables, 0/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1949 variables, 1/909 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1949 variables, 0/909 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1949 variables, 0/909 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1949/1949 variables, and 909 constraints, problems are : Problem set: 1 solved, 1 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 771/771 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 333/334 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/740 variables, 111/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/740 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/770 variables, 23/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/770 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1178/1948 variables, 770/907 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1948 variables, 1/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1948 variables, 0/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1949 variables, 1/909 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1949 variables, 1/910 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1949 variables, 0/910 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1949 variables, 0/910 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1949/1949 variables, and 910 constraints, problems are : Problem set: 1 solved, 1 unsolved in 880 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 771/771 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1559ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1182/1182 transitions.
Applied a total of 0 rules in 43 ms. Remains 771 /771 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
Running 1176 sub problems to find dead transitions.
[2025-06-02 21:22:16] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:22:16] [INFO ] Invariant cache hit.
[2025-06-02 21:22:16] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :68 after 12173
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1949 variables, and 132 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
[2025-06-02 21:22:40] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
[2025-06-02 21:22:56] [INFO ] Deduced a trap composed of 14 places in 300 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1949 variables, and 134 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 2/2 constraints]
After SMT, in 42921ms problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 42930ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42980 ms. Remains : 771/771 places, 1182/1182 transitions.
RANDOM walk for 40000 steps (1895 resets) in 412 ms. (96 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (141 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Detected timeout of ITS tools.
[2025-06-02 21:23:02] [INFO ] Flatten gal took : 41 ms
[2025-06-02 21:23:02] [INFO ] Applying decomposition
[2025-06-02 21:23:02] [INFO ] Flatten gal took : 42 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/graph16326157112257373119.txt' '-o' '/tmp/graph16326157112257373119.bin' '-w' '/tmp/graph16326157112257373119.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16326157112257373119.bin' '-l' '-1' '-v' '-w' '/tmp/graph16326157112257373119.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:23:02] [INFO ] Decomposing Gal with order
[2025-06-02 21:23:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:23:02] [INFO ] Removed a total of 1269 redundant transitions.
[2025-06-02 21:23:02] [INFO ] Flatten gal took : 109 ms
[2025-06-02 21:23:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 17 ms.
[2025-06-02 21:23:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8453238686250330991.gal : 11 ms
[2025-06-02 21:23:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1689717153491726806.prop : 1 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/ReachabilityCardinality8453238686250330991.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1689717153491726806.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/ReachabilityCardinality1689717153491726806.prop.
Interrupted probabilistic random walk after 164198 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 1
Probabilistic random walk after 164198 steps, saw 48872 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
[2025-06-02 21:23:02] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:23:02] [INFO ] Invariant cache hit.
[2025-06-02 21:23:02] [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) 333/334 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 406/740 variables, 111/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/740 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/770 variables, 23/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/770 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 66
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :66 after 82
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :82 after 67901
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :67901 after 101828
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :101828 after 102677
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :102677 after 145773
At refinement iteration 7 (OVERLAPS) 1178/1948 variables, 770/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1948 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1948 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1949 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1949 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1949 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1949/1949 variables, and 909 constraints, problems are : Problem set: 0 solved, 1 unsolved in 934 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 771/771 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) 333/334 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/740 variables, 111/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/740 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/770 variables, 23/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/770 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1178/1948 variables, 770/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1948 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1948 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1949 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1949 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1949 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1949 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1949/1949 variables, and 910 constraints, problems are : Problem set: 0 solved, 1 unsolved in 865 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 771/771 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1815ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1182/1182 transitions.
Applied a total of 0 rules in 45 ms. Remains 771 /771 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 771/771 places, 1182/1182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 1182/1182 transitions.
Applied a total of 0 rules in 27 ms. Remains 771 /771 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
[2025-06-02 21:23:04] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:23:04] [INFO ] Invariant cache hit.
[2025-06-02 21:23:06] [INFO ] Implicit Places using invariants in 1416 ms returned []
[2025-06-02 21:23:06] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:23:06] [INFO ] Invariant cache hit.
[2025-06-02 21:23:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:23:20] [INFO ] Implicit Places using invariants and state equation in 14604 ms returned []
Implicit Place search using SMT with State Equation took 16024 ms to find 0 implicit places.
[2025-06-02 21:23:20] [INFO ] Redundant transitions in 18 ms returned []
Running 1176 sub problems to find dead transitions.
[2025-06-02 21:23:20] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
[2025-06-02 21:23:20] [INFO ] Invariant cache hit.
[2025-06-02 21:23:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
[2025-06-02 21:23:51] [INFO ] Deduced a trap composed of 14 places in 377 ms of which 4 ms to minimize.
Detected timeout of ITS tools.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1949 variables, and 133 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1176/1176 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
[2025-06-02 21:23:55] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2025-06-02 21:24:04] [INFO ] Deduced a trap composed of 214 places in 333 ms of which 4 ms to minimize.
[2025-06-02 21:24:05] [INFO ] Deduced a trap composed of 187 places in 328 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1949 variables, and 136 constraints, problems are : Problem set: 0 solved, 1176 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1176 constraints, Known Traps: 4/4 constraints]
After SMT, in 62994ms problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 63004ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79087 ms. Remains : 771/771 places, 1182/1182 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[136]
Ending property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-04 in 268046 ms.
[2025-06-02 21:24:23] [INFO ] Flatten gal took : 49 ms
[2025-06-02 21:24:23] [INFO ] Applying decomposition
[2025-06-02 21:24:24] [INFO ] Flatten gal took : 43 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/graph1262201721148276479.txt' '-o' '/tmp/graph1262201721148276479.bin' '-w' '/tmp/graph1262201721148276479.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1262201721148276479.bin' '-l' '-1' '-v' '-w' '/tmp/graph1262201721148276479.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:24:24] [INFO ] Decomposing Gal with order
[2025-06-02 21:24:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:24:24] [INFO ] Removed a total of 1081 redundant transitions.
[2025-06-02 21:24:24] [INFO ] Flatten gal took : 159 ms
[2025-06-02 21:24:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 465 labels/synchronizations in 24 ms.
[2025-06-02 21:24:24] [INFO ] Time to serialize gal into /tmp/UpperBounds13193037123998643891.gal : 12 ms
[2025-06-02 21:24:24] [INFO ] Time to serialize properties into /tmp/UpperBounds12039494648183158926.prop : 1 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/UpperBounds13193037123998643891.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12039494648183158926.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 ...285
Loading property file /tmp/UpperBounds12039494648183158926.prop.
ITS-tools command line returned an error code 137
[2025-06-02 21:32:35] [INFO ] Flatten gal took : 55 ms
[2025-06-02 21:32:35] [INFO ] Time to serialize gal into /tmp/UpperBounds10141528010205074823.gal : 8 ms
[2025-06-02 21:32:35] [INFO ] Time to serialize properties into /tmp/UpperBounds6602673508715456425.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/UpperBounds10141528010205074823.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6602673508715456425.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 ...305
Loading property file /tmp/UpperBounds6602673508715456425.prop.
ITS-tools command line returned an error code 137
[2025-06-02 21:41:11] [INFO ] Flatten gal took : 39 ms
[2025-06-02 21:41:11] [INFO ] Input system was already deterministic with 1182 transitions.
[2025-06-02 21:41:11] [INFO ] Transformed 771 places.
[2025-06-02 21:41:11] [INFO ] Transformed 1182 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-02 21:41:41] [INFO ] Time to serialize gal into /tmp/UpperBounds5976731730065932262.gal : 12 ms
[2025-06-02 21:41:41] [INFO ] Time to serialize properties into /tmp/UpperBounds10793098397585935656.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/UpperBounds5976731730065932262.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10793098397585935656.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds10793098397585935656.prop.
ITS-tools command line returned an error code 137
Total runtime 2375396 ms.
BK_STOP 1748900989925
--------------------
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-S05J60"
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-S05J60, 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-174881266100083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J60.tgz
mv PolyORBNT-PT-S05J60 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 '
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 ;