MCC'2024- Execution of r290-tajo-171654447200477

About the Execution of ITS-Tools for PolyORBNT-PT-S05J80

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

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654447200477.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBNT-PT-S05J80, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447200477
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 38K Apr 12 09:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 12 09:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 74K Apr 12 09:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 357K Apr 12 09:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 44K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 50K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 156K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 79K Apr 12 10:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 324K Apr 12 10:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 131K Apr 12 10:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 566K Apr 12 10:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.8M May 18 16:43 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

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

=== Now, execution of the tool begins

BK_START 1716932572270

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J80
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-28 21:42:53] [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]
[2024-05-28 21:42:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:42:54] [INFO ] Load time of PNML (sax parser for PT used): 300 ms
[2024-05-28 21:42:54] [INFO ] Transformed 1189 places.
[2024-05-28 21:42:54] [INFO ] Transformed 2350 transitions.
[2024-05-28 21:42:54] [INFO ] Parsed PT model containing 1189 places and 2350 transitions and 14464 arcs in 448 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 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, 0, 0, 0, 0, 0, 0, 0, 3, 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, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 21:42:54] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2024-05-28 21:42:54] [INFO ] Computed 182 invariants in 227 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0] Max Struct:[273, 3, 273, 393, 273, 988, 99, 393, 1, 1, 3, 2, 3, 396, 2]
FORMULA PolyORBNT-PT-S05J80-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (698 resets) in 155 ms. (64 steps per ms)
FORMULA PolyORBNT-PT-S05J80-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110010 steps (1390 resets) in 397 ms. (276 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 4, 1, 3, 1, 4, 0, 0, 4, 0] Max Struct:[273, 273, 393, 273, 988, 99, 393, 1, 2, 396, 2]
[2024-05-28 21:42:55] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
[2024-05-28 21:42:55] [INFO ] Invariant cache hit.
[2024-05-28 21:42:55] [INFO ] [Real]Absence check using 157 positive place invariants in 51 ms returned sat
[2024-05-28 21:42:55] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 46 ms returned unsat
[2024-05-28 21:42:55] [INFO ] [Real]Absence check using 157 positive place invariants in 37 ms returned sat
[2024-05-28 21:42:55] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 34 ms returned unsat
[2024-05-28 21:42:56] [INFO ] [Real]Absence check using 157 positive place invariants in 34 ms returned sat
[2024-05-28 21:42:56] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 35 ms returned unsat
[2024-05-28 21:42:56] [INFO ] [Real]Absence check using 157 positive place invariants in 35 ms returned sat
[2024-05-28 21:42:56] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 63 ms returned unsat
[2024-05-28 21:42:56] [INFO ] [Real]Absence check using 157 positive place invariants in 71 ms returned sat
[2024-05-28 21:42:56] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 56 ms returned sat
[2024-05-28 21:42:58] [INFO ] [Real]Absence check using state equation in 1785 ms returned sat
[2024-05-28 21:42:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:42:58] [INFO ] [Nat]Absence check using 157 positive place invariants in 34 ms returned sat
[2024-05-28 21:42:58] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 33 ms returned sat
[2024-05-28 21:43:00] [INFO ] [Nat]Absence check using state equation in 1241 ms returned sat
[2024-05-28 21:43:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:43:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 291 ms returned sat
[2024-05-28 21:43:00] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 185 ms.
[2024-05-28 21:43:01] [INFO ] Added : 15 causal constraints over 3 iterations in 1479 ms. Result :sat
Minimization took 647 ms.
[2024-05-28 21:43:02] [INFO ] [Real]Absence check using 157 positive place invariants in 43 ms returned sat
[2024-05-28 21:43:02] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 34 ms returned unsat
[2024-05-28 21:43:03] [INFO ] [Real]Absence check using 157 positive place invariants in 42 ms returned sat
[2024-05-28 21:43:03] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 51 ms returned unsat
[2024-05-28 21:43:03] [INFO ] [Real]Absence check using 157 positive place invariants in 64 ms returned sat
[2024-05-28 21:43:03] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 84 ms returned sat
[2024-05-28 21:43:04] [INFO ] [Real]Absence check using state equation in 1129 ms returned sat
[2024-05-28 21:43:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:43:05] [INFO ] [Nat]Absence check using 157 positive place invariants in 64 ms returned sat
[2024-05-28 21:43:05] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 88 ms returned sat
[2024-05-28 21:43:06] [INFO ] [Nat]Absence check using state equation in 1379 ms returned sat
[2024-05-28 21:43:07] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 21:43:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1028 ms returned unknown
[2024-05-28 21:43:07] [INFO ] [Real]Absence check using 157 positive place invariants in 47 ms returned sat
[2024-05-28 21:43:07] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 58 ms returned sat
[2024-05-28 21:43:08] [INFO ] [Real]Absence check using state equation in 752 ms returned sat
[2024-05-28 21:43:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:43:09] [INFO ] [Nat]Absence check using 157 positive place invariants in 43 ms returned sat
[2024-05-28 21:43:09] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 42 ms returned sat
[2024-05-28 21:43:10] [INFO ] [Nat]Absence check using state equation in 1798 ms returned unknown
[2024-05-28 21:43:11] [INFO ] [Real]Absence check using 157 positive place invariants in 34 ms returned sat
[2024-05-28 21:43:11] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 48 ms returned sat
[2024-05-28 21:43:12] [INFO ] [Real]Absence check using state equation in 1515 ms returned sat
[2024-05-28 21:43:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:43:12] [INFO ] [Nat]Absence check using 157 positive place invariants in 42 ms returned sat
[2024-05-28 21:43:13] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 50 ms returned sat
[2024-05-28 21:43:14] [INFO ] [Nat]Absence check using state equation in 1462 ms returned unknown
[2024-05-28 21:43:14] [INFO ] [Real]Absence check using 157 positive place invariants in 39 ms returned sat
[2024-05-28 21:43:14] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 44 ms returned sat
[2024-05-28 21:43:16] [INFO ] [Real]Absence check using state equation in 1998 ms returned sat
[2024-05-28 21:43:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:43:16] [INFO ] [Nat]Absence check using 157 positive place invariants in 40 ms returned sat
[2024-05-28 21:43:17] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 53 ms returned sat
[2024-05-28 21:43:18] [INFO ] [Nat]Absence check using state equation in 1303 ms returned sat
[2024-05-28 21:43:18] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 21:43:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 678 ms returned sat
[2024-05-28 21:43:19] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 141 ms.
[2024-05-28 21:43:20] [INFO ] Added : 20 causal constraints over 4 iterations in 1828 ms. Result :sat
Minimization took 591 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 4, 1, 3, 1, 4, 0, 0, 4, 0] Max Struct:[1, 1, 4, 1, 988, 1, 4, 1, 2, 396, 2]
FORMULA PolyORBNT-PT-S05J80-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 0, 0, 4, 0] Max Struct:[988, 1, 2, 396, 2]
Support contains 5 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 1184 transition count 1611
Reduce places removed 84 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 85 rules applied. Total rules applied 174 place count 1100 transition count 1610
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 175 place count 1099 transition count 1610
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 175 place count 1099 transition count 1526
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 343 place count 1015 transition count 1526
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 344 place count 1014 transition count 1525
Iterating global reduction 3 with 1 rules applied. Total rules applied 345 place count 1014 transition count 1525
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 349 place count 1012 transition count 1523
Applied a total of 349 rules in 555 ms. Remains 1012 /1189 variables (removed 177) and now considering 1523/1695 (removed 172) transitions.
Running 1517 sub problems to find dead transitions.
[2024-05-28 21:43:22] [INFO ] Flow matrix only has 1519 transitions (discarded 4 similar events)
// Phase 1: matrix 1519 rows 1012 cols
[2024-05-28 21:43:22] [INFO ] Computed 177 invariants in 104 ms
[2024-05-28 21:43:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1007 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1007 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/2531 variables, and 172 constraints, problems are : Problem set: 0 solved, 1517 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1012 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1517/1517 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1007 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1007 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/2531 variables, and 172 constraints, problems are : Problem set: 0 solved, 1517 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1012 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1517 constraints, Known Traps: 0/0 constraints]
After SMT, in 45241ms problems are : Problem set: 0 solved, 1517 unsolved
Search for dead transitions found 0 dead transitions in 45284ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45876 ms. Remains : 1012/1189 places, 1523/1695 transitions.
[2024-05-28 21:44:07] [INFO ] Flow matrix only has 1519 transitions (discarded 4 similar events)
[2024-05-28 21:44:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 0, 0, 4, 0] Max Struct:[334, 1, 2, 396, 2]
RANDOM walk for 1000000 steps (47218 resets) in 8872 ms. (112 steps per ms)
FORMULA PolyORBNT-PT-S05J80-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (4478 resets) in 4005 ms. (499 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 4] Max Struct:[334, 396]
[2024-05-28 21:44:20] [INFO ] Flow matrix only has 1519 transitions (discarded 4 similar events)
[2024-05-28 21:44:20] [INFO ] Invariant cache hit.
[2024-05-28 21:44:20] [INFO ] [Real]Absence check using 157 positive place invariants in 27 ms returned sat
[2024-05-28 21:44:20] [INFO ] [Real]Absence check using 157 positive and 20 generalized place invariants in 24 ms returned sat
[2024-05-28 21:44:20] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2024-05-28 21:44:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:44:21] [INFO ] [Real]Added 1 Read/Feed constraints in 60 ms returned sat
[2024-05-28 21:44:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:44:21] [INFO ] [Nat]Absence check using 157 positive place invariants in 41 ms returned sat
[2024-05-28 21:44:21] [INFO ] [Nat]Absence check using 157 positive and 20 generalized place invariants in 32 ms returned sat
[2024-05-28 21:44:22] [INFO ] [Nat]Absence check using state equation in 851 ms returned sat
[2024-05-28 21:44:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 477 ms returned sat
[2024-05-28 21:44:22] [INFO ] Computed and/alt/rep : 778/2675/778 causal constraints (skipped 735 transitions) in 126 ms.
[2024-05-28 21:44:23] [INFO ] Added : 10 causal constraints over 3 iterations in 967 ms. Result :sat
Minimization took 2634 ms.
[2024-05-28 21:44:26] [INFO ] [Real]Absence check using 157 positive place invariants in 42 ms returned sat
[2024-05-28 21:44:26] [INFO ] [Real]Absence check using 157 positive and 20 generalized place invariants in 33 ms returned sat
[2024-05-28 21:44:27] [INFO ] [Real]Absence check using state equation in 834 ms returned sat
[2024-05-28 21:44:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:44:27] [INFO ] [Nat]Absence check using 157 positive place invariants in 35 ms returned sat
[2024-05-28 21:44:27] [INFO ] [Nat]Absence check using 157 positive and 20 generalized place invariants in 30 ms returned sat
[2024-05-28 21:44:29] [INFO ] [Nat]Absence check using state equation in 2007 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[3, 4] Max Struct:[334, 4]
FORMULA PolyORBNT-PT-S05J80-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[334]
Support contains 1 out of 1012 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1012/1012 places, 1523/1523 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 1012 transition count 1522
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1011 transition count 1522
Applied a total of 2 rules in 112 ms. Remains 1011 /1012 variables (removed 1) and now considering 1522/1523 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 1011/1012 places, 1522/1523 transitions.
[2024-05-28 21:44:29] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
// Phase 1: matrix 1518 rows 1011 cols
[2024-05-28 21:44:29] [INFO ] Computed 177 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[333]
RANDOM walk for 1000000 steps (47317 resets) in 9251 ms. (108 steps per ms)
BEST_FIRST walk for 1000001 steps (2687 resets) in 2010 ms. (497 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[333]
[2024-05-28 21:44:41] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 21:44:41] [INFO ] Invariant cache hit.
[2024-05-28 21:44:41] [INFO ] [Real]Absence check using 157 positive place invariants in 37 ms returned sat
[2024-05-28 21:44:41] [INFO ] [Real]Absence check using 157 positive and 20 generalized place invariants in 36 ms returned sat
[2024-05-28 21:44:42] [INFO ] [Real]Absence check using state equation in 1212 ms returned sat
[2024-05-28 21:44:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:44:42] [INFO ] [Nat]Absence check using 157 positive place invariants in 38 ms returned sat
[2024-05-28 21:44:42] [INFO ] [Nat]Absence check using 157 positive and 20 generalized place invariants in 33 ms returned sat
[2024-05-28 21:44:43] [INFO ] [Nat]Absence check using state equation in 942 ms returned sat
[2024-05-28 21:44:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:44:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1195 ms returned sat
[2024-05-28 21:44:45] [INFO ] Deduced a trap composed of 443 places in 626 ms of which 56 ms to minimize.
[2024-05-28 21:44:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 822 ms
[2024-05-28 21:44:46] [INFO ] Computed and/alt/rep : 777/2682/777 causal constraints (skipped 735 transitions) in 166 ms.
[2024-05-28 21:44:46] [INFO ] Added : 12 causal constraints over 3 iterations in 1010 ms. Result :sat
Minimization took 2947 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[333]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[333]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 73 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 1011/1011 places, 1522/1522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 65 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2024-05-28 21:44:50] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 21:44:50] [INFO ] Invariant cache hit.
[2024-05-28 21:44:53] [INFO ] Implicit Places using invariants in 3019 ms returned []
[2024-05-28 21:44:53] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 21:44:53] [INFO ] Invariant cache hit.
[2024-05-28 21:44:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:45:23] [INFO ] Implicit Places using invariants and state equation in 30318 ms returned []
Implicit Place search using SMT with State Equation took 33340 ms to find 0 implicit places.
[2024-05-28 21:45:23] [INFO ] Redundant transitions in 95 ms returned []
Running 1516 sub problems to find dead transitions.
[2024-05-28 21:45:23] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 21:45:23] [INFO ] Invariant cache hit.
[2024-05-28 21:45:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 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 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 21:46:05] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1006 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1516 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 Int declared 1006/2529 variables, and 173 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 1/1 constraints]
After SMT, in 66161ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 66183ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99712 ms. Remains : 1011/1011 places, 1522/1522 transitions.
RANDOM walk for 40000 steps (1887 resets) in 1731 ms. (23 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (104 resets) in 320 ms. (124 steps per ms) remains 2/2 properties
[2024-05-28 21:46:30] [INFO ] Flatten gal took : 315 ms
BEST_FIRST walk for 40004 steps (100 resets) in 273 ms. (146 steps per ms) remains 2/2 properties
[2024-05-28 21:46:30] [INFO ] Flatten gal took : 175 ms
[2024-05-28 21:46:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality714836163064624248.gal : 69 ms
[2024-05-28 21:46:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2510586607379715521.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/ReachabilityCardinality714836163064624248.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2510586607379715521.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 ...327
Loading property file /tmp/ReachabilityCardinality2510586607379715521.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 72
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :72 after 80
Interrupted probabilistic random walk after 113414 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 2
Probabilistic random walk after 113414 steps, saw 34333 distinct states, run finished after 3004 ms. (steps per millisecond=37 ) properties seen :0
[2024-05-28 21:46:33] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 21:46:33] [INFO ] Invariant cache hit.
[2024-05-28 21:46:33] [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) 296/297 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 472/769 variables, 115/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/769 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 166/935 variables, 34/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/935 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 7 (OVERLAPS) 67/1002 variables, 19/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1002 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/1010 variables, 8/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 0/1188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2529 variables, 1/1189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2529/2529 variables, and 1189 constraints, problems are : Problem set: 1 solved, 1 unsolved in 868 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1011/1011 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) 296/297 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 472/769 variables, 115/116 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/769 variables, 0/116 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 166/935 variables, 34/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/935 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 67/1002 variables, 19/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1002 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/1010 variables, 8/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 21:46:35] [INFO ] Deduced a trap composed of 529 places in 508 ms of which 6 ms to minimize.
[2024-05-28 21:46:36] [INFO ] Deduced a trap composed of 306 places in 525 ms of which 16 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 2/1190 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2528 variables, 0/1190 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2529 variables, 1/1191 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2529 variables, 1/1192 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2529 variables, 0/1192 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2529 variables, 0/1192 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2529/2529 variables, and 1192 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2297 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1011/1011 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 3188ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 82 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Running 1516 sub problems to find dead transitions.
[2024-05-28 21:46:36] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 21:46:36] [INFO ] Invariant cache hit.
[2024-05-28 21:46:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 21:47:11] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2024-05-28 21:47:21] [INFO ] Flatten gal took : 175 ms
[2024-05-28 21:47:21] [INFO ] Applying decomposition
[2024-05-28 21:47:21] [INFO ] Flatten gal took : 154 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/graph14127462129380269872.txt' '-o' '/tmp/graph14127462129380269872.bin' '-w' '/tmp/graph14127462129380269872.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14127462129380269872.bin' '-l' '-1' '-v' '-w' '/tmp/graph14127462129380269872.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:47:21] [INFO ] Decomposing Gal with order
[2024-05-28 21:47:22] [INFO ] Rewriting arrays to variables to allow decomposition.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2529 variables, and 173 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 1/1 constraints]
After SMT, in 45952ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 45979ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46076 ms. Remains : 1011/1011 places, 1522/1522 transitions.
[2024-05-28 21:47:22] [INFO ] Removed a total of 1957 redundant transitions.
RANDOM walk for 40001 steps (1878 resets) in 826 ms. (48 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (114 resets) in 231 ms. (172 steps per ms) remains 1/1 properties
[2024-05-28 21:47:23] [INFO ] Flatten gal took : 1122 ms
[2024-05-28 21:47:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 731 labels/synchronizations in 128 ms.
[2024-05-28 21:47:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7216359890796676608.gal : 64 ms
[2024-05-28 21:47:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12141881390713530239.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/ReachabilityCardinality7216359890796676608.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12141881390713530239.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality12141881390713530239.prop.
Interrupted probabilistic random walk after 88502 steps, run timeout after 3010 ms. (steps per millisecond=29 ) properties seen :0 out of 1
Probabilistic random walk after 88502 steps, saw 26957 distinct states, run finished after 3010 ms. (steps per millisecond=29 ) properties seen :0
[2024-05-28 21:47:26] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 21:47:26] [INFO ] Invariant cache hit.
[2024-05-28 21:47:26] [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) 296/297 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 472/769 variables, 115/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/769 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 166/935 variables, 34/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/935 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 67/1002 variables, 19/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1002 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/1010 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2529 variables, 1/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2529/2529 variables, and 1189 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1173 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1011/1011 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) 296/297 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 472/769 variables, 115/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/769 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 166/935 variables, 34/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/935 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 67/1002 variables, 19/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1002 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/1010 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:47:28] [INFO ] Deduced a trap composed of 529 places in 468 ms of which 13 ms to minimize.
[2024-05-28 21:47:29] [INFO ] Deduced a trap composed of 306 places in 704 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 2/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2528 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2529 variables, 1/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2529 variables, 1/1192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2529 variables, 0/1192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2529 variables, 0/1192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2529/2529 variables, and 1192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2622 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1011/1011 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 3829ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 86 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 1011/1011 places, 1522/1522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 59 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2024-05-28 21:47:30] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 21:47:30] [INFO ] Invariant cache hit.
[2024-05-28 21:47:33] [INFO ] Implicit Places using invariants in 3009 ms returned []
[2024-05-28 21:47:33] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 21:47:33] [INFO ] Invariant cache hit.
[2024-05-28 21:47:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:48:02] [INFO ] Implicit Places using invariants and state equation in 28737 ms returned []
Implicit Place search using SMT with State Equation took 31760 ms to find 0 implicit places.
[2024-05-28 21:48:02] [INFO ] Redundant transitions in 110 ms returned []
Running 1516 sub problems to find dead transitions.
[2024-05-28 21:48:02] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 21:48:02] [INFO ] Invariant cache hit.
[2024-05-28 21:48:02] [INFO ] State equation strengthened by 1 read => feed constraints.
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 21:48:43] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1006 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2529 variables, and 173 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 1/1 constraints]
After SMT, in 65812ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 65833ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97782 ms. Remains : 1011/1011 places, 1522/1522 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[333]
Starting property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-05
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:[333]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[333]
[2024-05-28 21:49:08] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 21:49:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[333]
RANDOM walk for 10000 steps (484 resets) in 89 ms. (111 steps per ms)
BEST_FIRST walk for 10001 steps (21 resets) in 20 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[333]
[2024-05-28 21:49:08] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 21:49:08] [INFO ] Invariant cache hit.
[2024-05-28 21:49:08] [INFO ] [Real]Absence check using 157 positive place invariants in 35 ms returned sat
[2024-05-28 21:49:08] [INFO ] [Real]Absence check using 157 positive and 20 generalized place invariants in 29 ms returned sat
[2024-05-28 21:49:09] [INFO ] [Real]Absence check using state equation in 936 ms returned sat
[2024-05-28 21:49:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:49:09] [INFO ] [Nat]Absence check using 157 positive place invariants in 33 ms returned sat
[2024-05-28 21:49:09] [INFO ] [Nat]Absence check using 157 positive and 20 generalized place invariants in 24 ms returned sat
[2024-05-28 21:49:10] [INFO ] [Nat]Absence check using state equation in 821 ms returned sat
[2024-05-28 21:49:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:49:10] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 21:49:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1004 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[333]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[333]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 100 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Running 1516 sub problems to find dead transitions.
[2024-05-28 21:49:11] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 21:49:11] [INFO ] Invariant cache hit.
[2024-05-28 21:49:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 21:49:42] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(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 0)
(s23 0)
(s24 1)
(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 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(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 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(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 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(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 1)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(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 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 1)
(s266 0)
(s267 1)
(s268 0)
(s269 0)
(s270 1)
(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 1)
(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 0)
(s297 0)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 1)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 1)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 1)
(s320 0)
(s321 1)
(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 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 1)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 1)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(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 1)
(s395 0)
(s396 0)
(s397 1)
(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 0)
(s414 0)
(s415 0)
(s416 1)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 1)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 1)
(s431 1)
(s432 0)
(s433 0)
(s434 1)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 1)
(s467 1)
(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 9)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 1)
(s501 1)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 1)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 1)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 1)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 4)
(s546 0)
(s547 0)
(s548 0)
(s549 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 1)
(s563 0)
(s564 1)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 1)
(s570 0)
(s571 0)
(s572 1)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(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 1)
(s592 0)
(s593 0)
(s594 0)
(s595 1)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 4)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 1)
(s611 0)
(s612 0)
(s613 0)
(s614 1)
(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)
(s630 1)
(s631 0)
(s632 0)
(s633 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 1)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 1)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 1)
(s689 0)
(s690 1)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 1)
(s697 0)
(s698 1)
(s699 0)
(s700 1)
(s701 0)
(s702 0)
(s703 1)
(s704 0)
(s705 1)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 9)
(s711 0)
(s712 0)
(s713 1)
(s714 0)
(s715 0)
(s716 0)
(s717 1)
(s718 1)
(s719 0)
(s720 1)
(s721 0)
(s722 0)
(s723 1)
(s724 0)
(s725 0)
(s726 0)
(s727 1)
(s728 0)
(s729 1)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 1)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 timeout
0)
(s765 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2529 variables, and 173 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 1/1 constraints]
After SMT, in 45680ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 45699ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45804 ms. Remains : 1011/1011 places, 1522/1522 transitions.
[2024-05-28 21:49:57] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 21:49:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[333]
RANDOM walk for 1000000 steps (46997 resets) in 8732 ms. (114 steps per ms)
BEST_FIRST walk for 1000001 steps (2708 resets) in 1979 ms. (505 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[333]
[2024-05-28 21:50:07] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 21:50:07] [INFO ] Invariant cache hit.
[2024-05-28 21:50:08] [INFO ] [Real]Absence check using 157 positive place invariants in 37 ms returned sat
[2024-05-28 21:50:08] [INFO ] [Real]Absence check using 157 positive and 20 generalized place invariants in 36 ms returned sat
[2024-05-28 21:50:09] [INFO ] [Real]Absence check using state equation in 1078 ms returned sat
[2024-05-28 21:50:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:50:09] [INFO ] [Nat]Absence check using 157 positive place invariants in 48 ms returned sat
[2024-05-28 21:50:09] [INFO ] [Nat]Absence check using 157 positive and 20 generalized place invariants in 36 ms returned sat
[2024-05-28 21:50:10] [INFO ] [Nat]Absence check using state equation in 952 ms returned sat
[2024-05-28 21:50:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:50:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1059 ms returned sat
[2024-05-28 21:50:12] [INFO ] Deduced a trap composed of 443 places in 615 ms of which 8 ms to minimize.
[2024-05-28 21:50:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 786 ms
[2024-05-28 21:50:12] [INFO ] Computed and/alt/rep : 777/2682/777 causal constraints (skipped 735 transitions) in 144 ms.
[2024-05-28 21:50:13] [INFO ] Added : 12 causal constraints over 3 iterations in 874 ms. Result :sat
Minimization took 2841 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[333]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[333]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 68 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1011/1011 places, 1522/1522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 64 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2024-05-28 21:50:16] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 21:50:16] [INFO ] Invariant cache hit.
[2024-05-28 21:50:19] [INFO ] Implicit Places using invariants in 3308 ms returned []
[2024-05-28 21:50:19] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 21:50:19] [INFO ] Invariant cache hit.
[2024-05-28 21:50:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:50:49] [INFO ] Implicit Places using invariants and state equation in 30086 ms returned []
Implicit Place search using SMT with State Equation took 33413 ms to find 0 implicit places.
[2024-05-28 21:50:49] [INFO ] Redundant transitions in 31 ms returned []
Running 1516 sub problems to find dead transitions.
[2024-05-28 21:50:49] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 21:50:49] [INFO ] Invariant cache hit.
[2024-05-28 21:50:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 21:51:31] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1006 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1516 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 Int declared 1006/2529 variables, and 173 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 1/1 constraints]
After SMT, in 66033ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 66048ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99566 ms. Remains : 1011/1011 places, 1522/1522 transitions.
[2024-05-28 21:51:55] [INFO ] Flatten gal took : 124 ms
[2024-05-28 21:51:56] [INFO ] Flatten gal took : 160 ms
RANDOM walk for 40002 steps (1887 resets) in 871 ms. (45 steps per ms) remains 2/2 properties
[2024-05-28 21:51:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality715280317429134862.gal : 16 ms
[2024-05-28 21:51:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15245579765236914817.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/ReachabilityCardinality715280317429134862.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15245579765236914817.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40004 steps (99 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (104 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality15245579765236914817.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 72
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :72 after 80
Interrupted probabilistic random walk after 97036 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 2
Probabilistic random walk after 97036 steps, saw 29625 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
[2024-05-28 21:51:59] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 21:51:59] [INFO ] Invariant cache hit.
[2024-05-28 21:51:59] [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) 296/297 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 472/769 variables, 115/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/769 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 166/935 variables, 34/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/935 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 7 (OVERLAPS) 67/1002 variables, 19/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1002 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/1010 variables, 8/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 0/1188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2529 variables, 1/1189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2529/2529 variables, and 1189 constraints, problems are : Problem set: 1 solved, 1 unsolved in 831 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1011/1011 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) 296/297 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 472/769 variables, 115/116 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/769 variables, 0/116 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 166/935 variables, 34/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/935 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 67/1002 variables, 19/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1002 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/1010 variables, 8/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 21:52:01] [INFO ] Deduced a trap composed of 529 places in 547 ms of which 7 ms to minimize.
[2024-05-28 21:52:02] [INFO ] Deduced a trap composed of 306 places in 566 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 2/1190 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2528 variables, 0/1190 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2529 variables, 1/1191 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2529 variables, 1/1192 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2529 variables, 0/1192 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2529 variables, 0/1192 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2529/2529 variables, and 1192 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2259 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1011/1011 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 3101ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 61 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Running 1516 sub problems to find dead transitions.
[2024-05-28 21:52:02] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 21:52:02] [INFO ] Invariant cache hit.
[2024-05-28 21:52:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 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 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 21:52:34] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2024-05-28 21:52:46] [INFO ] Flatten gal took : 105 ms
[2024-05-28 21:52:46] [INFO ] Applying decomposition
[2024-05-28 21:52:46] [INFO ] Flatten gal took : 81 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/graph12836747340611066438.txt' '-o' '/tmp/graph12836747340611066438.bin' '-w' '/tmp/graph12836747340611066438.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12836747340611066438.bin' '-l' '-1' '-v' '-w' '/tmp/graph12836747340611066438.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:52:46] [INFO ] Decomposing Gal with order
[2024-05-28 21:52:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:52:46] [INFO ] Removed a total of 1681 redundant transitions.
[2024-05-28 21:52:46] [INFO ] Flatten gal took : 230 ms
[2024-05-28 21:52:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 158 labels/synchronizations in 47 ms.
[2024-05-28 21:52:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14624182617901466392.gal : 23 ms
[2024-05-28 21:52:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7467696550002615056.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/ReachabilityCardinality14624182617901466392.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7467696550002615056.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality7467696550002615056.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 66
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 0)
(s23 0)
(s24 1)
(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 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(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 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(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 1)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(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 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 1)
(s266 0)
(s267 1)
(s268 1)
(s269 0)
(s270 1)
(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 1)
(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 0)
(s297 0)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 1)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 1)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 0)
(s319 1)
(s320 0)
(s321 1)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 1)
(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 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 1)
(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 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(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 1)
(s395 0)
(s396 0)
(s397 1)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 1)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 1)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 1)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 1)
(s431 1)
(s432 0)
(s433 0)
(s434 1)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 1)
(s467 1)
(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 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 1)
(s501 1)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 1)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 1)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 1)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 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 1)
(s565 0)
(s566 1)
(s567 0)
(s568 0)
(s569 1)
(s570 0)
(s571 0)
(s572 1)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(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 1)
(s592 0)
(s593 0)
(s594 0)
(s595 1)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 1)
(s611 0)
(s612 0)
(s613 0)
(s614 1)
(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)
(s630 3)
(s631 0)
(s632 0)
(s633 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 1)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 1)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 1)
(s689 0)
(s690 1)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 1)
(s697 0)
(s698 0)
(s699 0)
(s700 1)
(s701 0)
(s702 0)
(s703 1)
(s704 0)
(s705 1)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 7)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 1)
(s718 0)
(s719 0)
(s720 1)
(s721 0)
(s722 0)
(s723 1)
(s724 0)
(s725 0)
(s726 0)
(s727 1)
(s728 0)
(s729 1)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 1)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 1)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 1)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 1)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 1)
(s824 1)
(s825 0)
(s826 0)
(s827 0)
(s828 1)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 1)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 1)
(s848 0)
(s849 0)
(s850 1)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 1)
(s860 0)
(s861 1)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s882 0)
(s883 1)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 1)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 1)
(s932 1)
(s933 0)
(s934 0)
(s935 1)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 1)
(s947 0)
(s948 0)
(s949 1)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 1)
(s970 0)
(s971 0)
(s972 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :66 after 1060
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2529 variables, and 173 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 1/1 constraints]
After SMT, in 45508ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 45530ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45596 ms. Remains : 1011/1011 places, 1522/1522 transitions.
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1060 after 60770
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :60770 after 1.79926e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.79926e+06 after 1.85903e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.85903e+06 after 3.66028e+06
RANDOM walk for 40000 steps (1868 resets) in 1147 ms. (34 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (96 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 97879 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 1
Probabilistic random walk after 97879 steps, saw 29878 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
[2024-05-28 21:52:51] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 21:52:51] [INFO ] Invariant cache hit.
[2024-05-28 21:52:51] [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) 296/297 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 472/769 variables, 115/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/769 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 166/935 variables, 34/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/935 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 67/1002 variables, 19/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1002 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/1010 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2529 variables, 1/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2529/2529 variables, and 1189 constraints, problems are : Problem set: 0 solved, 1 unsolved in 888 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1011/1011 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) 296/297 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 472/769 variables, 115/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/769 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 166/935 variables, 34/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/935 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 67/1002 variables, 19/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1002 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/1010 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:52:54] [INFO ] Deduced a trap composed of 529 places in 589 ms of which 8 ms to minimize.
[2024-05-28 21:52:54] [INFO ] Deduced a trap composed of 306 places in 501 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 2/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2528 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2529 variables, 1/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2529 variables, 1/1192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2529 variables, 0/1192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2529 variables, 0/1192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2529/2529 variables, and 1192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2680 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1011/1011 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 3588ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 76 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 1011/1011 places, 1522/1522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 56 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2024-05-28 21:52:55] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 21:52:55] [INFO ] Invariant cache hit.
[2024-05-28 21:52:57] [INFO ] Implicit Places using invariants in 2506 ms returned []
[2024-05-28 21:52:57] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 21:52:57] [INFO ] Invariant cache hit.
[2024-05-28 21:52:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:53:26] [INFO ] Implicit Places using invariants and state equation in 29012 ms returned []
Implicit Place search using SMT with State Equation took 31522 ms to find 0 implicit places.
[2024-05-28 21:53:26] [INFO ] Redundant transitions in 26 ms returned []
Running 1516 sub problems to find dead transitions.
[2024-05-28 21:53:26] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 21:53:26] [INFO ] Invariant cache hit.
[2024-05-28 21:53:26] [INFO ] State equation strengthened by 1 read => feed constraints.
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 21:54:07] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1006 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1516 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 Int declared 1006/2529 variables, and 173 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 1/1 constraints]
After SMT, in 65139ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 65154ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96772 ms. Remains : 1011/1011 places, 1522/1522 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[333]
Ending property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-05 in 323850 ms.
[2024-05-28 21:54:31] [INFO ] Flatten gal took : 44 ms
[2024-05-28 21:54:31] [INFO ] Applying decomposition
[2024-05-28 21:54:32] [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/graph10271693571031444201.txt' '-o' '/tmp/graph10271693571031444201.bin' '-w' '/tmp/graph10271693571031444201.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10271693571031444201.bin' '-l' '-1' '-v' '-w' '/tmp/graph10271693571031444201.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:54:32] [INFO ] Decomposing Gal with order
[2024-05-28 21:54:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:54:32] [INFO ] Removed a total of 1950 redundant transitions.
[2024-05-28 21:54:32] [INFO ] Flatten gal took : 133 ms
[2024-05-28 21:54:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 493 labels/synchronizations in 29 ms.
[2024-05-28 21:54:32] [INFO ] Time to serialize gal into /tmp/UpperBounds12185221831866796767.gal : 25 ms
[2024-05-28 21:54:32] [INFO ] Time to serialize properties into /tmp/UpperBounds7693013329904928247.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/UpperBounds12185221831866796767.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7693013329904928247.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 ...284
Loading property file /tmp/UpperBounds7693013329904928247.prop.

BK_STOP 1716933540061

--------------------
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-S05J80"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S05J80, 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 r290-tajo-171654447200477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J80.tgz
mv PolyORBNT-PT-S05J80 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;