About the Execution of ITS-Tools for NoC3x3-PT-5B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | T?TFFFTTFTTTF?FF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812200230.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is NoC3x3-PT-5B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812200230
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 996K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 525K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-2025-00
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-2025-01
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-2025-02
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-2025-03
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-2025-04
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-2025-05
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-2025-06
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-2025-07
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-2025-08
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-2025-09
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-2025-10
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-2025-11
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-2025-12
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-2025-13
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-2025-14
FORMULA_NAME NoC3x3-PT-5B-ReachabilityCardinality-2025-15
=== Now, execution of the tool begins
BK_START 1748831089814
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-5B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-02 02:24:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 02:24:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 02:24:51] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2025-06-02 02:24:51] [INFO ] Transformed 1571 places.
[2025-06-02 02:24:51] [INFO ] Transformed 2173 transitions.
[2025-06-02 02:24:51] [INFO ] Found NUPN structural information;
[2025-06-02 02:24:51] [INFO ] Parsed PT model containing 1571 places and 2173 transitions and 6109 arcs in 269 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (62 resets) in 1902 ms. (21 steps per ms) remains 5/15 properties
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-02 02:24:52] [INFO ] Flatten gal took : 332 ms
BEST_FIRST walk for 40003 steps (8 resets) in 667 ms. (59 steps per ms) remains 4/5 properties
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 615 ms. (64 steps per ms) remains 2/4 properties
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-06-02 02:24:52] [INFO ] Flatten gal took : 252 ms
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
[2025-06-02 02:24:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2601404708909282797.gal : 53 ms
[2025-06-02 02:24:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2554327550067731367.prop : 2 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2601404708909282797.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2554327550067731367.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
// Phase 1: matrix 2173 rows 1571 cols
[2025-06-02 02:24:52] [INFO ] Computed 66 invariants in 61 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Loading property file /tmp/ReachabilityCardinality2554327550067731367.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1464/1549 variables, 64/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1549 variables, 1464/1613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1549 variables, 0/1613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/1571 variables, 2/1615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1571 variables, 22/1637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1571 variables, 0/1637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2173/3744 variables, 1571/3208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :6 after 19
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :19 after 20
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :20 after 24
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :24 after 62
At refinement iteration 9 (INCLUDED_ONLY) 0/3744 variables, 0/3208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :62 after 351
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :351 after 373
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :373 after 1527
At refinement iteration 10 (OVERLAPS) 0/3744 variables, 0/3208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3744/3744 variables, and 3208 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1865 ms.
Refiners :[Domain max(s): 1571/1571 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1571/1571 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1527 after 24287
At refinement iteration 2 (OVERLAPS) 1464/1549 variables, 64/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1549 variables, 1464/1613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :24287 after 3.27407e+07
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3.27407e+07 after 4.944e+08
[2025-06-02 02:24:56] [INFO ] Deduced a trap composed of 62 places in 1380 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:24:57] [INFO ] Deduced a trap composed of 83 places in 585 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:24:57] [INFO ] Deduced a trap composed of 139 places in 614 ms of which 212 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :4.944e+08 after 2.41283e+09
[2025-06-02 02:24:58] [INFO ] Deduced a trap composed of 111 places in 567 ms of which 171 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:24:59] [INFO ] Deduced a trap composed of 140 places in 366 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:24:59] [INFO ] Deduced a trap composed of 78 places in 426 ms of which 86 ms to minimize.
SMT process timed out in 7239ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 85 out of 1571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1571/1571 places, 2173/2173 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 275 place count 1571 transition count 1898
Reduce places removed 275 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 293 rules applied. Total rules applied 568 place count 1296 transition count 1880
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 586 place count 1278 transition count 1880
Discarding 264 places :
Symmetric choice reduction at 3 with 264 rule applications. Total rules 850 place count 1014 transition count 1616
Iterating global reduction 3 with 264 rules applied. Total rules applied 1114 place count 1014 transition count 1616
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 1114 place count 1014 transition count 1587
Deduced a syphon composed of 29 places in 4 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1172 place count 985 transition count 1587
Discarding 89 places :
Symmetric choice reduction at 3 with 89 rule applications. Total rules 1261 place count 896 transition count 1428
Iterating global reduction 3 with 89 rules applied. Total rules applied 1350 place count 896 transition count 1428
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1392 place count 854 transition count 1342
Iterating global reduction 3 with 42 rules applied. Total rules applied 1434 place count 854 transition count 1342
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1446 place count 842 transition count 1318
Iterating global reduction 3 with 12 rules applied. Total rules applied 1458 place count 842 transition count 1318
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1462 place count 838 transition count 1310
Iterating global reduction 3 with 4 rules applied. Total rules applied 1466 place count 838 transition count 1310
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1467 place count 837 transition count 1308
Iterating global reduction 3 with 1 rules applied. Total rules applied 1468 place count 837 transition count 1308
Performed 158 Post agglomeration using F-continuation condition.Transition count delta: 158
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 316 rules applied. Total rules applied 1784 place count 679 transition count 1150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1785 place count 678 transition count 1147
Iterating global reduction 3 with 1 rules applied. Total rules applied 1786 place count 678 transition count 1147
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 1988 place count 577 transition count 1177
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1996 place count 577 transition count 1169
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 2040 place count 555 transition count 1170
Drop transitions (Redundant composition of simpler transitions.) removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 4 with 57 rules applied. Total rules applied 2097 place count 555 transition count 1113
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 2105 place count 547 transition count 1113
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 2105 place count 547 transition count 1109
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 2113 place count 543 transition count 1109
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 2135 place count 532 transition count 1098
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 2147 place count 526 transition count 1108
Free-agglomeration rule applied 14 times.
Iterating global reduction 5 with 14 rules applied. Total rules applied 2161 place count 526 transition count 1094
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 2176 place count 512 transition count 1093
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 2178 place count 512 transition count 1091
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 2184 place count 512 transition count 1091
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2185 place count 511 transition count 1090
Applied a total of 2185 rules in 720 ms. Remains 511 /1571 variables (removed 1060) and now considering 1090/2173 (removed 1083) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 725 ms. Remains : 511/1571 places, 1090/2173 transitions.
RANDOM walk for 40000 steps (94 resets) in 709 ms. (56 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (11 resets) in 227 ms. (175 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (13 resets) in 198 ms. (201 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.41283e+09 after 1.56925e+10
Interrupted probabilistic random walk after 244920 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 2
Probabilistic random walk after 244920 steps, saw 83607 distinct states, run finished after 3006 ms. (steps per millisecond=81 ) properties seen :0
[2025-06-02 02:25:03] [INFO ] Flow matrix only has 1085 transitions (discarded 5 similar events)
// Phase 1: matrix 1085 rows 511 cols
[2025-06-02 02:25:03] [INFO ] Computed 58 invariants in 14 ms
[2025-06-02 02:25:03] [INFO ] State equation strengthened by 36 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 419/504 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1085/1589 variables, 504/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1589 variables, 36/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1589 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/1596 variables, 7/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1596 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1596 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1596 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1596/1596 variables, and 605 constraints, problems are : Problem set: 0 solved, 2 unsolved in 508 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 511/511 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 419/504 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:04] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:04] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:04] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:05] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:05] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:05] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:05] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1085/1589 variables, 504/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1589 variables, 36/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1589 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/1596 variables, 7/611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1596 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1596 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1596 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1596/1596 variables, and 612 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2604 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 511/511 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3153ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 386 ms.
Support contains 85 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 1090/1090 transitions.
Applied a total of 0 rules in 15 ms. Remains 511 /511 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 511/511 places, 1090/1090 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 1090/1090 transitions.
Applied a total of 0 rules in 29 ms. Remains 511 /511 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
[2025-06-02 02:25:07] [INFO ] Flow matrix only has 1085 transitions (discarded 5 similar events)
[2025-06-02 02:25:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:25:07] [INFO ] Implicit Places using invariants in 392 ms returned [150]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 417 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 510/511 places, 1090/1090 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 510 transition count 1089
Applied a total of 1 rules in 30 ms. Remains 510 /510 variables (removed 0) and now considering 1089/1090 (removed 1) transitions.
[2025-06-02 02:25:07] [INFO ] Flow matrix only has 1084 transitions (discarded 5 similar events)
// Phase 1: matrix 1084 rows 510 cols
[2025-06-02 02:25:07] [INFO ] Computed 57 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:25:08] [INFO ] Implicit Places using invariants in 205 ms returned []
[2025-06-02 02:25:08] [INFO ] Flow matrix only has 1084 transitions (discarded 5 similar events)
[2025-06-02 02:25:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:25:08] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-02 02:25:08] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 510/511 places, 1089/1090 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1268 ms. Remains : 510/511 places, 1089/1090 transitions.
RANDOM walk for 40000 steps (158 resets) in 287 ms. (138 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (14 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 255576 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 2
Probabilistic random walk after 255576 steps, saw 104001 distinct states, run finished after 3003 ms. (steps per millisecond=85 ) properties seen :0
[2025-06-02 02:25:11] [INFO ] Flow matrix only has 1084 transitions (discarded 5 similar events)
[2025-06-02 02:25:11] [INFO ] Invariant cache hit.
[2025-06-02 02:25:11] [INFO ] State equation strengthened by 35 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 418/503 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/503 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1084/1587 variables, 503/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1587 variables, 35/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1587 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/1594 variables, 7/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1594 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1594 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1594 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1594/1594 variables, and 602 constraints, problems are : Problem set: 0 solved, 2 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 510/510 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 418/503 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:12] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:12] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/503 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1084/1587 variables, 503/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1587 variables, 35/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:13] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1587 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1587 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/1594 variables, 7/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1594 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1594 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1594 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1594/1594 variables, and 605 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1719 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 510/510 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2203ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 539 ms.
Support contains 85 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 1089/1089 transitions.
Applied a total of 0 rules in 14 ms. Remains 510 /510 variables (removed 0) and now considering 1089/1089 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 510/510 places, 1089/1089 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 1089/1089 transitions.
Applied a total of 0 rules in 12 ms. Remains 510 /510 variables (removed 0) and now considering 1089/1089 (removed 0) transitions.
[2025-06-02 02:25:14] [INFO ] Flow matrix only has 1084 transitions (discarded 5 similar events)
[2025-06-02 02:25:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:25:14] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-06-02 02:25:14] [INFO ] Flow matrix only has 1084 transitions (discarded 5 similar events)
[2025-06-02 02:25:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:25:15] [INFO ] State equation strengthened by 35 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :1.56925e+10 after 1.82885e+13
[2025-06-02 02:25:15] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:25:15] [INFO ] Redundant transitions in 58 ms returned []
Running 1088 sub problems to find dead transitions.
[2025-06-02 02:25:15] [INFO ] Flow matrix only has 1084 transitions (discarded 5 similar events)
[2025-06-02 02:25:15] [INFO ] Invariant cache hit.
[2025-06-02 02:25:15] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/509 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :1.82885e+13 after 3.04716e+15
At refinement iteration 1 (INCLUDED_ONLY) 0/509 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 2 (OVERLAPS) 1/510 variables, 54/57 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:39] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:39] [INFO ] Deduced a trap composed of 6 places in 245 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:39] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:40] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:40] [INFO ] Deduced a trap composed of 30 places in 245 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:40] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:41] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:41] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:41] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:41] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:41] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:41] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:42] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:42] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:42] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:42] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:43] [INFO ] Deduced a trap composed of 15 places in 312 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:43] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:43] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:44] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 13 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/1594 variables, and 77 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/510 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 1088/1088 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1088 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/509 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/509 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/509 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 3 (OVERLAPS) 1/510 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/510 variables, 18/77 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:54] [INFO ] Deduced a trap composed of 15 places in 246 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:56] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:56] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:57] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:57] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:57] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:57] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:57] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:25:58] [INFO ] Deduced a trap composed of 46 places in 145 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:26:00] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:26:00] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:26:00] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:26:00] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:26:00] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:26:00] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:26:00] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:26:01] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:26:01] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:26:03] [INFO ] Deduced a trap composed of 70 places in 154 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:26:03] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 21 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:26:08] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:26:08] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:26:10] [INFO ] Deduced a trap composed of 82 places in 151 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:26:11] [INFO ] Deduced a trap composed of 84 places in 142 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:26:11] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:26:13] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:26:13] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:26:13] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 8/105 constraints. Problems are: Problem set: 0 solved, 1088 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 510/1594 variables, and 105 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/510 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 0/1088 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60580ms problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 60586ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61531 ms. Remains : 510/510 places, 1089/1089 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 510 transition count 1084
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 1 with 19 rules applied. Total rules applied 24 place count 510 transition count 1065
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 510 transition count 1065
Applied a total of 28 rules in 47 ms. Remains 510 /510 variables (removed 0) and now considering 1065/1089 (removed 24) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1065 rows 510 cols
[2025-06-02 02:26:16] [INFO ] Computed 57 invariants in 9 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 02:26:16] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 02:26:16] [INFO ] [Nat]Absence check using 57 positive place invariants in 10 ms returned sat
[2025-06-02 02:26:16] [INFO ] After 347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-02 02:26:16] [INFO ] After 484ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-02 02:26:16] [INFO ] After 663ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-02 02:26:17] [INFO ] Flatten gal took : 62 ms
[2025-06-02 02:26:17] [INFO ] Flatten gal took : 47 ms
[2025-06-02 02:26:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15850406340075205784.gal : 17 ms
[2025-06-02 02:26:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6322938554285676051.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15850406340075205784.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6322938554285676051.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6322938554285676051.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 16
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :16 after 39
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :39 after 106
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :106 after 411
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :411 after 6713
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :6713 after 157249
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :157249 after 1.1445e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.1445e+06 after 8.34986e+07
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :8.34986e+07 after 8.97673e+09
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :3.04716e+15 after 1.18615e+16
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :8.97673e+09 after 2.33702e+10
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.33702e+10 after 5.81803e+11
Detected timeout of ITS tools.
[2025-06-02 02:26:32] [INFO ] Flatten gal took : 48 ms
[2025-06-02 02:26:32] [INFO ] Applying decomposition
[2025-06-02 02:26:32] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4989155540991972907.txt' '-o' '/tmp/graph4989155540991972907.bin' '-w' '/tmp/graph4989155540991972907.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4989155540991972907.bin' '-l' '-1' '-v' '-w' '/tmp/graph4989155540991972907.weights' '-q' '0' '-e' '0.001'
[2025-06-02 02:26:32] [INFO ] Decomposing Gal with order
[2025-06-02 02:26:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 02:26:32] [INFO ] Removed a total of 771 redundant transitions.
[2025-06-02 02:26:32] [INFO ] Flatten gal took : 134 ms
[2025-06-02 02:26:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 615 labels/synchronizations in 32 ms.
[2025-06-02 02:26:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1294382862047365085.gal : 11 ms
[2025-06-02 02:26:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12362889924219497973.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1294382862047365085.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12362889924219497973.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality12362889924219497973.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1 after 29
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :29 after 261767
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :261767 after 2.64975e+10
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2.64975e+10 after 3.11934e+15
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3.11934e+15 after 4.74638e+19
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4.74638e+19 after 4.10829e+20
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31736 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 02:26:48] [INFO ] Flatten gal took : 51 ms
[2025-06-02 02:26:48] [INFO ] Applying decomposition
[2025-06-02 02:26:48] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10085641338501673177.txt' '-o' '/tmp/graph10085641338501673177.bin' '-w' '/tmp/graph10085641338501673177.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10085641338501673177.bin' '-l' '-1' '-v' '-w' '/tmp/graph10085641338501673177.weights' '-q' '0' '-e' '0.001'
[2025-06-02 02:26:48] [INFO ] Decomposing Gal with order
[2025-06-02 02:26:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 02:26:48] [INFO ] Removed a total of 1768 redundant transitions.
[2025-06-02 02:26:48] [INFO ] Flatten gal took : 134 ms
[2025-06-02 02:26:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 19 ms.
[2025-06-02 02:26:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13553304203553435526.gal : 19 ms
[2025-06-02 02:26:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12906855117039539903.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13553304203553435526.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12906855117039539903.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality12906855117039539903.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1 after 43
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :43 after 26283
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :26283 after 179883
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :179883 after 2.44036e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.44036e+06 after 2.71167e+17
Detected timeout of ITS tools.
[2025-06-02 02:56:52] [INFO ] Flatten gal took : 448 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18279894425839661025
[2025-06-02 02:56:52] [INFO ] Applying decomposition
[2025-06-02 02:56:53] [INFO ] Computing symmetric may disable matrix : 1089 transitions.
[2025-06-02 02:56:54] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 02:56:54] [INFO ] Computing symmetric may enable matrix : 1089 transitions.
[2025-06-02 02:56:54] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 02:56:54] [INFO ] Flatten gal took : 1499 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15226029589046974753.txt' '-o' '/tmp/graph15226029589046974753.bin' '-w' '/tmp/graph15226029589046974753.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15226029589046974753.bin' '-l' '-1' '-v' '-w' '/tmp/graph15226029589046974753.weights' '-q' '0' '-e' '0.001'
[2025-06-02 02:56:54] [INFO ] Decomposing Gal with order
[2025-06-02 02:56:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 02:56:55] [INFO ] Computing Do-Not-Accords matrix : 1089 transitions.
[2025-06-02 02:56:55] [INFO ] Computation of Completed DNA matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 02:56:55] [INFO ] Removed a total of 777 redundant transitions.
[2025-06-02 02:56:55] [INFO ] Flatten gal took : 284 ms
[2025-06-02 02:56:55] [INFO ] Built C files in 2965ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18279894425839661025
[2025-06-02 02:56:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 566 labels/synchronizations in 28 ms.
[2025-06-02 02:56:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15763072001042904287.gal : 9 ms
[2025-06-02 02:56:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16029101828553852925.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15763072001042904287.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16029101828553852925.prop' '--nowitness'
Running compilation step : cd /tmp/ltsmin18279894425839661025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality16029101828553852925.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 245
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :245 after 6320
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :6320 after 23870
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :23870 after 36695
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :36695 after 36920
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :36920 after 74720
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :74720 after 2.57068e+13
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.57068e+13 after 2.81441e+20
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.81441e+20 after 3.10254e+20
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3.10254e+20 after 6.41485e+20
[error occurred during error reporting ((null)), id 0x7, SIGBUS (0x7) at pc=0x00007f3cbbc31bc6]
#
# A fatal error has been detected by the Java Runtime Environment:
#
# SIGBUS (0x7) at pc=0x00007f3cbc7dae70, pid=656, tid=1106
#
# JRE version: OpenJDK Runtime Environment (21.0.7+6) (build 21.0.7+6-Debian-1)
# Java VM: OpenJDK 64-Bit Server VM (21.0.7+6-Debian-1, mixed mode, sharing, tiered, compressed oops, compressed class ptrs, g1 gc, linux-amd64)
# Problematic frame:
# V [libjvm.so+0x6275e7]
[error occurred during error reporting (printing problematic frame), id 0x7, SIGBUS (0x7) at pc=0x00007f3cbb8cfa7c]
# No core dump will be written.
#
# An error report file with more information is saved as:
# /tmp/hs_err_pid656.log
[thread 1115 also had an error]
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="NoC3x3-PT-5B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-5B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-tall-174876812200230"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-5B.tgz
mv NoC3x3-PT-5B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;