Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074000134.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is FunctionPointer-PT-c008, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074000134
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.7K Mar 7 07:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 7 07:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Mar 7 07:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 7 07:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 07:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 7 07:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 7 07:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 7 07:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 4.2M Mar 3 18:30 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 FunctionPointer-PT-c008-ReachabilityCardinality-2024-00
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-01
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-02
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-03
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-04
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-05
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-06
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-07
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-08
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-09
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-10
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-11
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-12
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-13
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-14
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779692995770

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c008
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-25 07:09:56] [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]
[2026-05-25 07:09:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 07:09:57] [INFO ] Load time of PNML (sax parser for PT used): 382 ms
[2026-05-25 07:09:57] [INFO ] Transformed 2826 places.
[2026-05-25 07:09:57] [INFO ] Transformed 8960 transitions.
[2026-05-25 07:09:57] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 527 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 48 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 4857 ms. (8 steps per ms) remains 8/9 properties
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 241 ms. (165 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 335 ms. (119 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 7/8 properties
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-05-25 07:09:59] [INFO ] Flatten gal took : 631 ms
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 7/7 properties
[2026-05-25 07:09:59] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18209997415279427006.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-680278344057451725.kers'
[2026-05-25 07:09:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18209997415279427006.kers, --Pflows, --basisKERS=/tmp/petrispot-output-680278344057451725.kers]
[2026-05-25 07:09:59] [INFO ] Flatten gal took : 207 ms
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 10 ms.
// Phase 1: matrix 3540 rows 1627 cols 8708 entries
Finished phase 1 with 1624 SingleSign rule and 0 generalized
[2026-05-25 07:09:59] [INFO ] Computed 4 invariants in 27 ms
Computed 4 P flows in 33 ms.
Exported basis to /tmp/petrispot-output-680278344057451725.kers
Total runtime 36 ms.
[2026-05-25 07:09:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6437179241417869347.gal : 93 ms
[2026-05-25 07:10:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11775753981587200426.prop : 14 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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6437179241417869347.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11775753981587200426.prop' '--nowitness' '--gen-order' 'FOLLOW'
[2026-05-25 07:10:00] [INFO ] State equation strengthened by 479 read => feed constraints.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 378/404 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/405 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 164/569 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Loading property file /tmp/ReachabilityCardinality11775753981587200426.prop.
At refinement iteration 7 (OVERLAPS) 1472/2041 variables, 569/573 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2041 variables, 401/974 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2041 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1387/3428 variables, 430/1404 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3428 variables, 78/1482 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3428 variables, 0/1482 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 666/4094 variables, 385/1867 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4094 variables, 0/1867 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 744/4838 variables, 154/2021 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4838 variables, 0/2021 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 330/5168 variables, 90/2111 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5168/5168 variables, and 2111 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4240 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1628/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 378/404 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/405 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 164/569 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1472/2041 variables, 569/573 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2041 variables, 401/974 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2041 variables, 1/975 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2041 variables, 2/977 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 31
At refinement iteration 11 (INCLUDED_ONLY) 0/2041 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 1387/3428 variables, 430/1407 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3428 variables, 78/1485 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3428 variables, 6/1491 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3428 variables, 2/1493 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3428/5168 variables, and 1493 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 999/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 10027ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1612 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.19 ms
Discarding 16 places :
Also discarding 0 output transitions
Discarding 292 places :
Symmetric choice reduction at 0 with 292 rule applications. Total rules 293 place count 1320 transition count 3690
Iterating global reduction 0 with 292 rules applied. Total rules applied 585 place count 1320 transition count 3690
Ensure Unique test removed 340 transitions
Reduce isomorphic transitions removed 340 transitions.
Iterating post reduction 0 with 340 rules applied. Total rules applied 925 place count 1320 transition count 3350
Discarding 156 places :
Symmetric choice reduction at 1 with 156 rule applications. Total rules 1081 place count 1164 transition count 3038
Iterating global reduction 1 with 156 rules applied. Total rules applied 1237 place count 1164 transition count 3038
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 1297 place count 1164 transition count 2978
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1311 place count 1150 transition count 2950
Iterating global reduction 2 with 14 rules applied. Total rules applied 1325 place count 1150 transition count 2950
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :31 after 2058
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1339 place count 1136 transition count 2922
Iterating global reduction 2 with 14 rules applied. Total rules applied 1353 place count 1136 transition count 2922
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1366 place count 1123 transition count 2896
Iterating global reduction 2 with 13 rules applied. Total rules applied 1379 place count 1123 transition count 2896
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1392 place count 1110 transition count 2870
Iterating global reduction 2 with 13 rules applied. Total rules applied 1405 place count 1110 transition count 2870
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1418 place count 1097 transition count 2844
Iterating global reduction 2 with 13 rules applied. Total rules applied 1431 place count 1097 transition count 2844
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1443 place count 1085 transition count 2820
Iterating global reduction 2 with 12 rules applied. Total rules applied 1455 place count 1085 transition count 2820
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1464 place count 1076 transition count 2802
Iterating global reduction 2 with 9 rules applied. Total rules applied 1473 place count 1076 transition count 2802
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 1521 place count 1028 transition count 2616
Iterating global reduction 2 with 48 rules applied. Total rules applied 1569 place count 1028 transition count 2616
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 1617 place count 980 transition count 2424
Iterating global reduction 2 with 48 rules applied. Total rules applied 1665 place count 980 transition count 2424
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 1713 place count 932 transition count 2316
Iterating global reduction 2 with 48 rules applied. Total rules applied 1761 place count 932 transition count 2316
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 1809 place count 884 transition count 2220
Iterating global reduction 2 with 48 rules applied. Total rules applied 1857 place count 884 transition count 2220
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 1904 place count 837 transition count 2126
Iterating global reduction 2 with 47 rules applied. Total rules applied 1951 place count 837 transition count 2126
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 1998 place count 790 transition count 2032
Iterating global reduction 2 with 47 rules applied. Total rules applied 2045 place count 790 transition count 2032
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 2090 place count 745 transition count 1942
Iterating global reduction 2 with 45 rules applied. Total rules applied 2135 place count 745 transition count 1942
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 2141 place count 739 transition count 1930
Iterating global reduction 2 with 6 rules applied. Total rules applied 2147 place count 739 transition count 1930
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 2 with 32 rules applied. Total rules applied 2179 place count 739 transition count 1898
Applied a total of 2179 rules in 1824 ms. Remains 739 /1628 variables (removed 889) and now considering 1898/5962 (removed 4064) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1836 ms. Remains : 739/1628 places, 1898/5962 transitions.
RANDOM walk for 40007 steps (8 resets) in 341 ms. (116 steps per ms) remains 6/7 properties
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
[2026-05-25 07:10:11] [INFO ] Flow matrix only has 1282 transitions (discarded 616 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7248813305585125806.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16353973198181713790.kers'
[2026-05-25 07:10:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7248813305585125806.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16353973198181713790.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1282 rows 739 cols 3582 entries
Finished phase 1 with 736 SingleSign rule and 0 generalized
[2026-05-25 07:10:11] [INFO ] Computed 3 invariants in 5 ms
Computed 3 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-16353973198181713790.kers
Total runtime 9 ms.
[2026-05-25 07:10:11] [INFO ] State equation strengthened by 314 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 418/443 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 997/1440 variables, 443/446 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1440 variables, 249/695 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1440 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 465/1905 variables, 195/890 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1905 variables, 65/955 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1905 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 114/2019 variables, 99/1054 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2019 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2/2021 variables, 2/1056 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2021 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/2021 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2021/2021 variables, and 1056 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1290 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 739/739 constraints, ReadFeed: 314/314 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 418/443 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 997/1440 variables, 443/446 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1440 variables, 249/695 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1440 variables, 1/696 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1440 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1440 variables, 2/700 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1440 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 465/1905 variables, 195/895 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1905 variables, 65/960 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1905 variables, 5/965 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1905 variables, 6/971 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1905 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 114/2019 variables, 99/1070 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem FunctionPointer-PT-c008-ReachabilityCardinality-2024-14 is UNSAT
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 15 (INCLUDED_ONLY) 0/2019 variables, 14/1084 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2019 variables, 2/1086 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2019 variables, 0/1086 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 2/2021 variables, 2/1088 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2021 variables, 0/1088 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/2021 variables, 0/1088 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2021/2021 variables, and 1088 constraints, problems are : Problem set: 1 solved, 5 unsolved in 7303 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 739/739 constraints, ReadFeed: 314/314 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 24/24 constraints]
After SMT, in 8637ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-09 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1135 ms.
Support contains 13 out of 739 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 739/739 places, 1898/1898 transitions.
Graph (complete) has 3199 edges and 739 vertex of which 549 are kept as prefixes of interest. Removing 190 places using SCC suffix rule.2 ms
Discarding 190 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 549 transition count 1519
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 389 place count 540 transition count 1495
Iterating global reduction 1 with 9 rules applied. Total rules applied 398 place count 540 transition count 1495
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 406 place count 540 transition count 1487
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 415 place count 531 transition count 1469
Iterating global reduction 2 with 9 rules applied. Total rules applied 424 place count 531 transition count 1469
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 428 place count 531 transition count 1465
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 434 place count 525 transition count 1453
Iterating global reduction 3 with 6 rules applied. Total rules applied 440 place count 525 transition count 1453
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 450 place count 515 transition count 1423
Iterating global reduction 3 with 10 rules applied. Total rules applied 460 place count 515 transition count 1423
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 470 place count 505 transition count 1403
Iterating global reduction 3 with 10 rules applied. Total rules applied 480 place count 505 transition count 1403
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 490 place count 495 transition count 1383
Iterating global reduction 3 with 10 rules applied. Total rules applied 500 place count 495 transition count 1383
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 509 place count 486 transition count 1363
Iterating global reduction 3 with 9 rules applied. Total rules applied 518 place count 486 transition count 1363
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 524 place count 480 transition count 1351
Iterating global reduction 3 with 6 rules applied. Total rules applied 530 place count 480 transition count 1351
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 536 place count 474 transition count 1339
Iterating global reduction 3 with 6 rules applied. Total rules applied 542 place count 474 transition count 1339
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 548 place count 468 transition count 1327
Iterating global reduction 3 with 6 rules applied. Total rules applied 554 place count 468 transition count 1327
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 555 place count 467 transition count 1325
Iterating global reduction 3 with 1 rules applied. Total rules applied 556 place count 467 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 557 place count 466 transition count 1323
Iterating global reduction 3 with 1 rules applied. Total rules applied 558 place count 466 transition count 1323
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 559 place count 465 transition count 1321
Iterating global reduction 3 with 1 rules applied. Total rules applied 560 place count 465 transition count 1321
Applied a total of 560 rules in 208 ms. Remains 465 /739 variables (removed 274) and now considering 1321/1898 (removed 577) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 465/739 places, 1321/1898 transitions.
RANDOM walk for 40001 steps (8 resets) in 285 ms. (139 steps per ms) remains 3/4 properties
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
[2026-05-25 07:10:22] [INFO ] Flow matrix only has 763 transitions (discarded 558 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11681752669826691461.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13207761446221630860.kers'
[2026-05-25 07:10:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11681752669826691461.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13207761446221630860.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 763 rows 465 cols 2250 entries
Finished phase 1 with 462 SingleSign rule and 0 generalized
[2026-05-25 07:10:22] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13207761446221630860.kers
Total runtime 5 ms.
[2026-05-25 07:10:22] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 381/393 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 661/1054 variables, 393/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1054 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 83/1137 variables, 18/412 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1137 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1137 variables, 87/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1137 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 12/1149 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1149 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1149 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 60/1209 variables, 38/541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1209 variables, 7/548 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1209 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 15/1224 variables, 11/559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1224 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 4/1228 variables, 3/562 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1228 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1228 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1228/1228 variables, and 562 constraints, problems are : Problem set: 0 solved, 3 unsolved in 543 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 465/465 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 381/393 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 661/1054 variables, 393/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1054 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 83/1137 variables, 18/412 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1137 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1137 variables, 87/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1137 variables, 3/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1137 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1137 variables, 2/506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1137 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 12/1149 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1149 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1149 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 60/1209 variables, 38/547 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1209 variables, 7/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1209 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 15/1224 variables, 11/565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1224 variables, 20/585 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1224 variables, 6/591 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1224 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 4/1228 variables, 3/594 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1228 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1228 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1228/1228 variables, and 594 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3779 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 465/465 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 28/28 constraints]
After SMT, in 4347ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA FunctionPointer-PT-c008-ReachabilityCardinality-2024-08 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 264 ms.
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1321/1321 transitions.
Graph (complete) has 2259 edges and 465 vertex of which 462 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 462 transition count 1316
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 14 place count 454 transition count 1300
Iterating global reduction 1 with 8 rules applied. Total rules applied 22 place count 454 transition count 1300
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 34 place count 454 transition count 1288
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 40 place count 448 transition count 1276
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 448 transition count 1276
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 51 place count 443 transition count 1266
Iterating global reduction 2 with 5 rules applied. Total rules applied 56 place count 443 transition count 1266
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 439 transition count 1252
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 439 transition count 1252
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 435 transition count 1244
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 435 transition count 1244
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 76 place count 431 transition count 1236
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 431 transition count 1236
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 428 transition count 1230
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 428 transition count 1230
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 425 transition count 1224
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 425 transition count 1224
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 95 place count 422 transition count 1218
Iterating global reduction 2 with 3 rules applied. Total rules applied 98 place count 422 transition count 1218
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 101 place count 419 transition count 1212
Iterating global reduction 2 with 3 rules applied. Total rules applied 104 place count 419 transition count 1212
Applied a total of 104 rules in 135 ms. Remains 419 /465 variables (removed 46) and now considering 1212/1321 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 419/465 places, 1212/1321 transitions.
RANDOM walk for 40001 steps (8 resets) in 234 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 547219 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :0 out of 1
Probabilistic random walk after 547219 steps, saw 335548 distinct states, run finished after 3007 ms. (steps per millisecond=181 ) properties seen :0
[2026-05-25 07:10:29] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14517768033320320337.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12885770621490663824.kers'
[2026-05-25 07:10:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14517768033320320337.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12885770621490663824.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 685 rows 419 cols 2044 entries
Finished phase 1 with 416 SingleSign rule and 0 generalized
[2026-05-25 07:10:29] [INFO ] Computed 3 invariants in 5 ms
Computed 3 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-12885770621490663824.kers
Total runtime 6 ms.
[2026-05-25 07:10:29] [INFO ] State equation strengthened by 75 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/354 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 7/361 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 605/966 variables, 337/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/966 variables, 74/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1028 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1028 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 70/1098 variables, 68/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1098 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1104 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1104/1104 variables, and 497 constraints, problems are : Problem set: 0 solved, 1 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/354 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/361 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 605/966 variables, 337/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 74/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/966 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1028 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1028 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 70/1098 variables, 68/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1098 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1098 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1104 variables, 4/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1104 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1104 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1104/1104 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 516 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 877ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 50 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 419/419 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 47 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2026-05-25 07:10:30] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2026-05-25 07:10:30] [INFO ] Invariant cache hit.
[2026-05-25 07:10:31] [INFO ] Implicit Places using invariants in 324 ms returned []
[2026-05-25 07:10:31] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2026-05-25 07:10:31] [INFO ] Invariant cache hit.
[2026-05-25 07:10:31] [INFO ] State equation strengthened by 75 read => feed constraints.
[2026-05-25 07:10:36] [INFO ] Implicit Places using invariants and state equation in 5012 ms returned []
Implicit Place search using SMT with State Equation took 5346 ms to find 0 implicit places.
[2026-05-25 07:10:36] [INFO ] Redundant transitions in 78 ms returned []
Running 1210 sub problems to find dead transitions.
[2026-05-25 07:10:36] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2026-05-25 07:10:36] [INFO ] Invariant cache hit.
[2026-05-25 07:10:36] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/1104 variables, and 4 constraints, problems are : Problem set: 0 solved, 1210 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/419 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1210/1210 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 3 (OVERLAPS) 685/1104 variables, 419/423 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1104 variables, 75/498 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1104/1104 variables, and 1708 constraints, problems are : Problem set: 0 solved, 1210 unsolved in 30832 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1210/1210 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62540ms problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 62546ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68053 ms. Remains : 419/419 places, 1212/1212 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 527 transitions
Reduce isomorphic transitions removed 527 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 539 rules applied. Total rules applied 539 place count 419 transition count 673
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 551 place count 407 transition count 673
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 551 place count 407 transition count 604
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 689 place count 338 transition count 604
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 1 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 945 place count 210 transition count 476
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1009 place count 146 transition count 348
Iterating global reduction 2 with 64 rules applied. Total rules applied 1073 place count 146 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1074 place count 146 transition count 347
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1074 place count 146 transition count 346
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1076 place count 145 transition count 346
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1139 place count 82 transition count 220
Iterating global reduction 3 with 63 rules applied. Total rules applied 1202 place count 82 transition count 220
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1265 place count 19 transition count 94
Iterating global reduction 3 with 63 rules applied. Total rules applied 1328 place count 19 transition count 94
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1391 place count 19 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1391 place count 19 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1393 place count 18 transition count 30
Applied a total of 1393 rules in 54 ms. Remains 18 /419 variables (removed 401) and now considering 30/1212 (removed 1182) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2713688920597142173.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8045390734747501829.kers'
[2026-05-25 07:11:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2713688920597142173.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8045390734747501829.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 30 rows 18 cols 98 entries
Finished phase 1 with 15 SingleSign rule and 0 generalized
[2026-05-25 07:11:38] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8045390734747501829.kers
Total runtime 2 ms.
[2026-05-25 07:11:39] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 07:11:39] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 07:11:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 07:11:39] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 07:11:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 07:11:39] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 07:11:39] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 07:11:39] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-25 07:11:39] [INFO ] Flatten gal took : 2 ms
[2026-05-25 07:11:39] [INFO ] Flatten gal took : 1 ms
[2026-05-25 07:11:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9883847655250635577.gal : 1 ms
[2026-05-25 07:11:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6576683225113546.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9883847655250635577.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6576683225113546.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.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...325
Loading property file /tmp/ReachabilityCardinality6576683225113546.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 207
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :207 after 2655
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2655 after 6615
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6615 after 14415
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :14415 after 29895
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :29895 after 60735
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :60735 after 122295
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :122295 after 245295
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :245295 after 491175
Detected timeout of ITS tools.
[2026-05-25 07:11:54] [INFO ] Flatten gal took : 1 ms
[2026-05-25 07:11:54] [INFO ] Applying decomposition
[2026-05-25 07:11:54] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14417414273914585372.txt' '-o' '/tmp/graph14417414273914585372.bin' '-w' '/tmp/graph14417414273914585372.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14417414273914585372.bin' '-l' '-1' '-v' '-w' '/tmp/graph14417414273914585372.weights' '-q' '0' '-e' '0.001'
[2026-05-25 07:11:54] [INFO ] Decomposing Gal with order
[2026-05-25 07:11:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 07:11:54] [INFO ] Removed a total of 29 redundant transitions.
[2026-05-25 07:11:54] [INFO ] Flatten gal took : 51 ms
[2026-05-25 07:11:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2026-05-25 07:11:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14481111130582878203.gal : 1 ms
[2026-05-25 07:11:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12940312734695988384.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14481111130582878203.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12940312734695988384.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality12940312734695988384.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30386 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 07:12:09] [INFO ] Flatten gal took : 148 ms
[2026-05-25 07:12:09] [INFO ] Applying decomposition
[2026-05-25 07:12:09] [INFO ] Flatten gal took : 137 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9022351452388681160.txt' '-o' '/tmp/graph9022351452388681160.bin' '-w' '/tmp/graph9022351452388681160.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9022351452388681160.bin' '-l' '-1' '-v' '-w' '/tmp/graph9022351452388681160.weights' '-q' '0' '-e' '0.001'
[2026-05-25 07:12:10] [INFO ] Decomposing Gal with order
[2026-05-25 07:12:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 07:12:11] [INFO ] Removed a total of 7953 redundant transitions.
[2026-05-25 07:12:11] [INFO ] Flatten gal took : 966 ms
[2026-05-25 07:12:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 4329 labels/synchronizations in 418 ms.
[2026-05-25 07:12:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6343894033643849871.gal : 34 ms
[2026-05-25 07:12:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1028214140216063080.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6343894033643849871.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1028214140216063080.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality1028214140216063080.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 25
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :25 after 57
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :57 after 138
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :138 after 325
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :325 after 772
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :772 after 148843
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :148843 after 305096
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :305096 after 616520
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :616520 after 1.24462e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.24462e+06 after 1.01869e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.01869e+07 after 2.05674e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.05674e+07 after 7.383e+08
Detected timeout of ITS tools.
[2026-05-25 07:42:17] [INFO ] Flatten gal took : 427 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1944093212427150726
[2026-05-25 07:42:18] [INFO ] Applying decomposition
[2026-05-25 07:42:18] [INFO ] Flatten gal took : 290 ms
[2026-05-25 07:42:18] [INFO ] Computing symmetric may disable matrix : 1212 transitions.
[2026-05-25 07:42:18] [INFO ] Computation of Complete disable matrix. took 127 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 07:42:19] [INFO ] Computing symmetric may enable matrix : 1212 transitions.
[2026-05-25 07:42:19] [INFO ] Computation of Complete enable matrix. took 214 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10273214028697053618.txt' '-o' '/tmp/graph10273214028697053618.bin' '-w' '/tmp/graph10273214028697053618.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10273214028697053618.bin' '-l' '-1' '-v' '-w' '/tmp/graph10273214028697053618.weights' '-q' '0' '-e' '0.001'
[2026-05-25 07:42:21] [INFO ] Decomposing Gal with order
[2026-05-25 07:42:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 07:42:21] [INFO ] Removed a total of 2071 redundant transitions.
[2026-05-25 07:42:21] [INFO ] Flatten gal took : 377 ms
[2026-05-25 07:42:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 870 labels/synchronizations in 162 ms.
[2026-05-25 07:42:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17192693194312793684.gal : 19 ms
[2026-05-25 07:42:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9242821305926328151.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17192693194312793684.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9242821305926328151.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
[2026-05-25 07:42:22] [INFO ] Computing Do-Not-Accords matrix : 1212 transitions.
Loading property file /tmp/ReachabilityCardinality9242821305926328151.prop.
[2026-05-25 07:42:22] [INFO ] Computation of Completed DNA matrix. took 146 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 07:42:22] [INFO ] Built C files in 4293ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1944093212427150726
Running compilation step : cd /tmp/ltsmin1944093212427150726;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 4765 ms.
Running link step : cd /tmp/ltsmin1944093212427150726;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin1944093212427150726;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'FunctionPointerPTc008ReachabilityCardinality202410==true'

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="FunctionPointer-PT-c008"
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-5973"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-c008, 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 r146-tall-177961074000134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c008.tgz
mv FunctionPointer-PT-c008 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;