Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366100309.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-02b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366100309
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 8.1K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 5 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 417K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779471286894

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-22 17:34:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 17:34:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 17:34:48] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2026-05-22 17:34:48] [INFO ] Transformed 1242 places.
[2026-05-22 17:34:48] [INFO ] Transformed 1621 transitions.
[2026-05-22 17:34:48] [INFO ] Found NUPN structural information;
[2026-05-22 17:34:48] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6333063146352309470.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4690823848916040365.kers'
[2026-05-22 17:34:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6333063146352309470.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4690823848916040365.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1621 rows 1242 cols 5041 entries
Finished phase 1 with 820 SingleSign rule and 301 generalized
[2026-05-22 17:34:48] [INFO ] Computed 121 invariants in 9 ms
Computed 121 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-4690823848916040365.kers
Total runtime 11 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (36 resets) in 75 ms. (131 steps per ms)
FORMULA ASLink-PT-02b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (35 resets) in 68 ms. (579 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-22 17:34:49] [INFO ] Invariant cache hit.
[2026-05-22 17:34:49] [INFO ] [Real]Absence check using 23 positive place invariants in 28 ms returned sat
[2026-05-22 17:34:49] [INFO ] [Real]Absence check using 23 positive and 98 generalized place invariants in 46 ms returned sat
[2026-05-22 17:34:50] [INFO ] [Real]Absence check using state equation in 1004 ms returned sat
[2026-05-22 17:34:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 17:34:51] [INFO ] [Nat]Absence check using 23 positive place invariants in 26 ms returned sat
[2026-05-22 17:34:51] [INFO ] [Nat]Absence check using 23 positive and 98 generalized place invariants in 46 ms returned sat
[2026-05-22 17:34:52] [INFO ] [Nat]Absence check using state equation in 1007 ms returned sat
[2026-05-22 17:34:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 618 ms
[2026-05-22 17:34:53] [INFO ] Computed and/alt/rep : 1337/2984/1337 causal constraints (skipped 283 transitions) in 113 ms.
Maximisation of solution failed !
Minimization took 12 ms.
[2026-05-22 17:34:56] [INFO ] [Real]Absence check using 23 positive place invariants in 25 ms returned sat
[2026-05-22 17:34:56] [INFO ] [Real]Absence check using 23 positive and 98 generalized place invariants in 104 ms returned sat
[2026-05-22 17:34:57] [INFO ] [Real]Absence check using state equation in 846 ms returned sat
[2026-05-22 17:34:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 17:34:58] [INFO ] [Nat]Absence check using 23 positive place invariants in 26 ms returned sat
[2026-05-22 17:34:58] [INFO ] [Nat]Absence check using 23 positive and 98 generalized place invariants in 64 ms returned sat
[2026-05-22 17:34:59] [INFO ] [Nat]Absence check using state equation in 821 ms returned sat
[2026-05-22 17:34:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 519 ms
[2026-05-22 17:34:59] [INFO ] Computed and/alt/rep : 1337/2984/1337 causal constraints (skipped 283 transitions) in 104 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2026-05-22 17:35:03] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2026-05-22 17:35:03] [INFO ] [Real]Absence check using 23 positive and 98 generalized place invariants in 49 ms returned sat
[2026-05-22 17:35:03] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2026-05-22 17:35:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 17:35:04] [INFO ] [Nat]Absence check using 23 positive place invariants in 23 ms returned sat
[2026-05-22 17:35:04] [INFO ] [Nat]Absence check using 23 positive and 98 generalized place invariants in 61 ms returned sat
[2026-05-22 17:35:05] [INFO ] [Nat]Absence check using state equation in 855 ms returned sat
[2026-05-22 17:35:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3373 ms
[2026-05-22 17:35:08] [INFO ] Computed and/alt/rep : 1337/2984/1337 causal constraints (skipped 283 transitions) in 108 ms.
[2026-05-22 17:35:09] [INFO ] Added : 15 causal constraints over 3 iterations in 458 ms. Result :unknown
[2026-05-22 17:35:09] [INFO ] [Real]Absence check using 23 positive place invariants in 22 ms returned sat
[2026-05-22 17:35:09] [INFO ] [Real]Absence check using 23 positive and 98 generalized place invariants in 47 ms returned sat
[2026-05-22 17:35:10] [INFO ] [Real]Absence check using state equation in 783 ms returned sat
[2026-05-22 17:35:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 17:35:10] [INFO ] [Nat]Absence check using 23 positive place invariants in 96 ms returned sat
[2026-05-22 17:35:10] [INFO ] [Nat]Absence check using 23 positive and 98 generalized place invariants in 56 ms returned sat
[2026-05-22 17:35:11] [INFO ] [Nat]Absence check using state equation in 881 ms returned sat
[2026-05-22 17:35:11] [INFO ] Computed and/alt/rep : 1337/2984/1337 causal constraints (skipped 283 transitions) in 88 ms.
[2026-05-22 17:35:15] [INFO ] Added : 135 causal constraints over 27 iterations in 3699 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA ASLink-PT-02b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-02b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1242 transition count 1341
Reduce places removed 280 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 294 rules applied. Total rules applied 574 place count 962 transition count 1327
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 579 place count 958 transition count 1326
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 580 place count 957 transition count 1326
Performed 282 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 282 Pre rules applied. Total rules applied 580 place count 957 transition count 1044
Deduced a syphon composed of 282 places in 3 ms
Ensure Unique test removed 23 places
Reduce places removed 305 places and 0 transitions.
Iterating global reduction 4 with 587 rules applied. Total rules applied 1167 place count 652 transition count 1044
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 4 with 18 rules applied. Total rules applied 1185 place count 650 transition count 1028
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1201 place count 634 transition count 1028
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 1201 place count 634 transition count 1020
Deduced a syphon composed of 8 places in 3 ms
Ensure Unique test removed 7 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 23 rules applied. Total rules applied 1224 place count 619 transition count 1020
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 7 Pre rules applied. Total rules applied 1224 place count 619 transition count 1013
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1238 place count 612 transition count 1013
Discarding 38 places :
Symmetric choice reduction at 6 with 38 rule applications. Total rules 1276 place count 574 transition count 975
Iterating global reduction 6 with 38 rules applied. Total rules applied 1314 place count 574 transition count 975
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1315 place count 574 transition count 974
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 14 Pre rules applied. Total rules applied 1315 place count 574 transition count 960
Deduced a syphon composed of 14 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 29 rules applied. Total rules applied 1344 place count 559 transition count 960
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1344 place count 559 transition count 959
Deduced a syphon composed of 1 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 1347 place count 557 transition count 959
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1350 place count 554 transition count 938
Iterating global reduction 7 with 3 rules applied. Total rules applied 1353 place count 554 transition count 938
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 1353 place count 554 transition count 936
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1357 place count 552 transition count 936
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1358 place count 551 transition count 928
Iterating global reduction 7 with 1 rules applied. Total rules applied 1359 place count 551 transition count 928
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1360 place count 550 transition count 920
Iterating global reduction 7 with 1 rules applied. Total rules applied 1361 place count 550 transition count 920
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1362 place count 549 transition count 912
Iterating global reduction 7 with 1 rules applied. Total rules applied 1363 place count 549 transition count 912
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1364 place count 548 transition count 904
Iterating global reduction 7 with 1 rules applied. Total rules applied 1365 place count 548 transition count 904
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1366 place count 547 transition count 896
Iterating global reduction 7 with 1 rules applied. Total rules applied 1367 place count 547 transition count 896
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1368 place count 546 transition count 888
Iterating global reduction 7 with 1 rules applied. Total rules applied 1369 place count 546 transition count 888
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1370 place count 545 transition count 880
Iterating global reduction 7 with 1 rules applied. Total rules applied 1371 place count 545 transition count 880
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1372 place count 544 transition count 872
Iterating global reduction 7 with 1 rules applied. Total rules applied 1373 place count 544 transition count 872
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1374 place count 543 transition count 864
Iterating global reduction 7 with 1 rules applied. Total rules applied 1375 place count 543 transition count 864
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1376 place count 542 transition count 856
Iterating global reduction 7 with 1 rules applied. Total rules applied 1377 place count 542 transition count 856
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1378 place count 541 transition count 848
Iterating global reduction 7 with 1 rules applied. Total rules applied 1379 place count 541 transition count 848
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1380 place count 540 transition count 840
Iterating global reduction 7 with 1 rules applied. Total rules applied 1381 place count 540 transition count 840
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1382 place count 539 transition count 832
Iterating global reduction 7 with 1 rules applied. Total rules applied 1383 place count 539 transition count 832
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1384 place count 538 transition count 824
Iterating global reduction 7 with 1 rules applied. Total rules applied 1385 place count 538 transition count 824
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1386 place count 537 transition count 816
Iterating global reduction 7 with 1 rules applied. Total rules applied 1387 place count 537 transition count 816
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1388 place count 536 transition count 808
Iterating global reduction 7 with 1 rules applied. Total rules applied 1389 place count 536 transition count 808
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 7 with 134 rules applied. Total rules applied 1523 place count 469 transition count 741
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1524 place count 468 transition count 740
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 1526 place count 467 transition count 740
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1527 place count 466 transition count 739
Iterating global reduction 7 with 1 rules applied. Total rules applied 1528 place count 466 transition count 739
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 1530 place count 466 transition count 737
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1531 place count 465 transition count 737
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1533 place count 464 transition count 746
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 1536 place count 464 transition count 743
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1539 place count 461 transition count 743
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1540 place count 461 transition count 742
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1541 place count 460 transition count 742
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1542 place count 459 transition count 741
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 11 with 6 rules applied. Total rules applied 1548 place count 455 transition count 739
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1550 place count 453 transition count 739
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 6 Pre rules applied. Total rules applied 1550 place count 453 transition count 733
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 13 with 13 rules applied. Total rules applied 1563 place count 446 transition count 733
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 13 with 3 rules applied. Total rules applied 1566 place count 443 transition count 733
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 1566 place count 443 transition count 732
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1568 place count 442 transition count 732
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 14 with 10 rules applied. Total rules applied 1578 place count 437 transition count 727
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1580 place count 435 transition count 725
Iterating global reduction 14 with 2 rules applied. Total rules applied 1582 place count 435 transition count 725
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1584 place count 435 transition count 723
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1586 place count 433 transition count 723
Applied a total of 1586 rules in 691 ms. Remains 433 /1242 variables (removed 809) and now considering 723/1621 (removed 898) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 698 ms. Remains : 433/1242 places, 723/1621 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14489096069329876057.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7912781598972940521.kers'
[2026-05-22 17:35:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14489096069329876057.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7912781598972940521.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 1 ms.
// Phase 1: matrix 723 rows 426 cols 2826 entries
Finished phase 1 with 139 SingleSign rule and 216 generalized
[2026-05-22 17:35:17] [INFO ] Computed 78 invariants in 12 ms
Computed 78 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-7912781598972940521.kers
Total runtime 14 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (16165 resets) in 1795 ms. (556 steps per ms)
BEST_FIRST walk for 2000000 steps (11192 resets) in 1794 ms. (1114 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-22 17:35:20] [INFO ] Invariant cache hit.
[2026-05-22 17:35:20] [INFO ] [Real]Absence check using 23 positive place invariants in 25 ms returned sat
[2026-05-22 17:35:21] [INFO ] [Real]Absence check using 23 positive and 55 generalized place invariants in 22 ms returned sat
[2026-05-22 17:35:21] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2026-05-22 17:35:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 17:35:21] [INFO ] [Nat]Absence check using 23 positive place invariants in 61 ms returned sat
[2026-05-22 17:35:21] [INFO ] [Nat]Absence check using 23 positive and 55 generalized place invariants in 33 ms returned sat
[2026-05-22 17:35:21] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2026-05-22 17:35:21] [INFO ] Computed and/alt/rep : 275/1073/275 causal constraints (skipped 431 transitions) in 45 ms.
[2026-05-22 17:35:24] [INFO ] Added : 203 causal constraints over 41 iterations in 3004 ms. Result :sat
Minimization took 439 ms.
[2026-05-22 17:35:25] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2026-05-22 17:35:25] [INFO ] [Real]Absence check using 23 positive and 55 generalized place invariants in 25 ms returned sat
[2026-05-22 17:35:25] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2026-05-22 17:35:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 17:35:25] [INFO ] [Nat]Absence check using 23 positive place invariants in 10 ms returned sat
[2026-05-22 17:35:25] [INFO ] [Nat]Absence check using 23 positive and 55 generalized place invariants in 20 ms returned sat
[2026-05-22 17:35:26] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2026-05-22 17:35:26] [INFO ] Computed and/alt/rep : 275/1073/275 causal constraints (skipped 431 transitions) in 58 ms.
[2026-05-22 17:35:27] [INFO ] Added : 64 causal constraints over 13 iterations in 1173 ms. Result :sat
Minimization took 384 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 723/723 transitions.
Applied a total of 0 rules in 16 ms. Remains 433 /433 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 433/433 places, 723/723 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 723/723 transitions.
Applied a total of 0 rules in 12 ms. Remains 433 /433 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2026-05-22 17:35:28] [INFO ] Invariant cache hit.
[2026-05-22 17:35:29] [INFO ] Implicit Places using invariants in 429 ms returned [1, 18, 19, 32, 49, 67, 102, 139, 143, 152, 153, 155, 172, 190, 259, 263, 264, 267, 278, 279, 280, 298, 300, 304, 322, 323, 324, 325, 337, 343, 349, 355, 361, 367, 373, 379, 385, 391, 397]
[2026-05-22 17:35:29] [INFO ] Actually due to overlaps returned [298, 280, 49, 172, 304, 32, 155, 152, 278, 322, 153, 279, 300, 323, 1, 18, 263, 264, 67, 190, 324, 367, 385, 397, 19, 267, 325, 337, 343, 349, 355, 361, 373, 379, 391]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 438 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 398/433 places, 723/723 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 395 transition count 661
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 333 transition count 658
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 131 place count 332 transition count 658
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 131 place count 332 transition count 643
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 162 place count 316 transition count 643
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 174 place count 312 transition count 635
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 182 place count 304 transition count 635
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 197 place count 289 transition count 620
Iterating global reduction 5 with 15 rules applied. Total rules applied 212 place count 289 transition count 620
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 215 place count 289 transition count 617
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 215 place count 289 transition count 616
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 217 place count 288 transition count 616
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 220 place count 285 transition count 610
Iterating global reduction 6 with 3 rules applied. Total rules applied 223 place count 285 transition count 610
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 224 place count 284 transition count 609
Iterating global reduction 6 with 1 rules applied. Total rules applied 225 place count 284 transition count 609
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 226 place count 283 transition count 607
Iterating global reduction 6 with 1 rules applied. Total rules applied 227 place count 283 transition count 607
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 269 place count 262 transition count 586
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 271 place count 260 transition count 584
Iterating global reduction 6 with 2 rules applied. Total rules applied 273 place count 260 transition count 584
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 275 place count 260 transition count 582
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 279 place count 258 transition count 583
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 284 place count 258 transition count 578
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 290 place count 252 transition count 578
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 296 place count 252 transition count 578
Applied a total of 296 rules in 87 ms. Remains 252 /398 variables (removed 146) and now considering 578/723 (removed 145) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8626297464366509307.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7368881075891083668.kers'
[2026-05-22 17:35:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8626297464366509307.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7368881075891083668.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 578 rows 251 cols 2345 entries
Finished phase 1 with 105 SingleSign rule and 113 generalized
[2026-05-22 17:35:29] [INFO ] Computed 34 invariants in 9 ms
Computed 34 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-7368881075891083668.kers
Total runtime 10 ms.
[2026-05-22 17:35:29] [INFO ] Implicit Places using invariants in 312 ms returned [73, 92, 98, 101, 103, 104, 107, 108, 160, 177, 183, 186, 188]
[2026-05-22 17:35:29] [INFO ] Actually due to overlaps returned [107, 108, 92, 98, 103, 177, 183, 188, 73, 104, 160]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 315 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 241/433 places, 578/723 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 233 transition count 570
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 233 transition count 570
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 231 transition count 568
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 231 transition count 568
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 28 place count 227 transition count 564
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 227 transition count 558
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 221 transition count 558
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 221 transition count 556
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 219 transition count 556
Applied a total of 44 rules in 70 ms. Remains 219 /241 variables (removed 22) and now considering 556/578 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12072803224280515966.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1182669131348566580.kers'
[2026-05-22 17:35:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12072803224280515966.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1182669131348566580.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 556 rows 219 cols 2272 entries
Finished phase 1 with 63 SingleSign rule and 133 generalized
[2026-05-22 17:35:29] [INFO ] Computed 23 invariants in 3 ms
Computed 23 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1182669131348566580.kers
Total runtime 4 ms.
[2026-05-22 17:35:29] [INFO ] Implicit Places using invariants in 219 ms returned []
[2026-05-22 17:35:29] [INFO ] Invariant cache hit.
[2026-05-22 17:35:30] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 219/433 places, 556/723 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1659 ms. Remains : 219/433 places, 556/723 transitions.
[2026-05-22 17:35:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (25291 resets) in 1514 ms. (660 steps per ms)
BEST_FIRST walk for 2000000 steps (19312 resets) in 1571 ms. (1272 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-22 17:35:33] [INFO ] Invariant cache hit.
[2026-05-22 17:35:33] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2026-05-22 17:35:33] [INFO ] [Real]Absence check using 6 positive and 17 generalized place invariants in 11 ms returned sat
[2026-05-22 17:35:33] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2026-05-22 17:35:33] [INFO ] Computed and/alt/rep : 98/568/98 causal constraints (skipped 441 transitions) in 33 ms.
[2026-05-22 17:35:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 17:35:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-22 17:35:33] [INFO ] [Nat]Absence check using 6 positive and 17 generalized place invariants in 5 ms returned sat
[2026-05-22 17:35:34] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2026-05-22 17:35:34] [INFO ] Computed and/alt/rep : 98/568/98 causal constraints (skipped 441 transitions) in 33 ms.
[2026-05-22 17:35:34] [INFO ] Added : 12 causal constraints over 3 iterations in 200 ms. Result :sat
Minimization took 170 ms.
[2026-05-22 17:35:34] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2026-05-22 17:35:34] [INFO ] [Real]Absence check using 6 positive and 17 generalized place invariants in 56 ms returned sat
[2026-05-22 17:35:34] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2026-05-22 17:35:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 17:35:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-22 17:35:34] [INFO ] [Nat]Absence check using 6 positive and 17 generalized place invariants in 10 ms returned sat
[2026-05-22 17:35:35] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2026-05-22 17:35:35] [INFO ] Computed and/alt/rep : 98/568/98 causal constraints (skipped 441 transitions) in 45 ms.
[2026-05-22 17:35:35] [INFO ] Added : 38 causal constraints over 9 iterations in 448 ms. Result :sat
Minimization took 218 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 556/556 transitions.
Applied a total of 0 rules in 9 ms. Remains 219 /219 variables (removed 0) and now considering 556/556 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 219/219 places, 556/556 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 556/556 transitions.
Applied a total of 0 rules in 8 ms. Remains 219 /219 variables (removed 0) and now considering 556/556 (removed 0) transitions.
[2026-05-22 17:35:35] [INFO ] Invariant cache hit.
[2026-05-22 17:35:36] [INFO ] Implicit Places using invariants in 602 ms returned []
[2026-05-22 17:35:36] [INFO ] Invariant cache hit.
[2026-05-22 17:35:37] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
[2026-05-22 17:35:37] [INFO ] Redundant transitions in 40 ms returned []
Running 539 sub problems to find dead transitions.
[2026-05-22 17:35:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 3 (OVERLAPS) 1/219 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 219/775 variables, and 27 constraints, problems are : Problem set: 0 solved, 539 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/219 constraints, PredecessorRefiner: 539/539 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 539 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 3 (OVERLAPS) 1/219 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
At refinement iteration 6 (OVERLAPS) 556/775 variables, 219/246 constraints. Problems are: Problem set: 155 solved, 384 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 775/775 variables, and 630 constraints, problems are : Problem set: 155 solved, 384 unsolved in 30117 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 384/539 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60393ms problems are : Problem set: 155 solved, 384 unsolved
Search for dead transitions found 155 dead transitions in 60407ms
Found 155 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 155 transitions
Dead transitions reduction (with SMT) removed 155 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 219/219 places, 401/556 transitions.
Applied a total of 0 rules in 5 ms. Remains 219 /219 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2026-05-22 17:36:37] [INFO ] Redundant transitions in 7 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61662 ms. Remains : 219/219 places, 401/556 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11033047049508716412.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11221842375330926357.kers'
[2026-05-22 17:36:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11033047049508716412.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11221842375330926357.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 401 rows 219 cols 1652 entries
Finished phase 1 with 44 SingleSign rule and 152 generalized
[2026-05-22 17:36:37] [INFO ] Computed 23 invariants in 2 ms
Computed 23 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11221842375330926357.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (25131 resets) in 1371 ms. (728 steps per ms)
BEST_FIRST walk for 2000002 steps (19290 resets) in 1399 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-22 17:36:40] [INFO ] Invariant cache hit.
[2026-05-22 17:36:40] [INFO ] [Real]Absence check using 7 positive place invariants in 21 ms returned sat
[2026-05-22 17:36:40] [INFO ] [Real]Absence check using 7 positive and 16 generalized place invariants in 14 ms returned sat
[2026-05-22 17:36:40] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2026-05-22 17:36:40] [INFO ] Computed and/alt/rep : 238/1045/238 causal constraints (skipped 146 transitions) in 16 ms.
[2026-05-22 17:36:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 17:36:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-22 17:36:40] [INFO ] [Nat]Absence check using 7 positive and 16 generalized place invariants in 15 ms returned sat
[2026-05-22 17:36:40] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2026-05-22 17:36:40] [INFO ] Computed and/alt/rep : 238/1045/238 causal constraints (skipped 146 transitions) in 37 ms.
[2026-05-22 17:36:41] [INFO ] Added : 115 causal constraints over 23 iterations in 955 ms. Result :sat
Minimization took 265 ms.
[2026-05-22 17:36:42] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-22 17:36:42] [INFO ] [Real]Absence check using 7 positive and 16 generalized place invariants in 8 ms returned sat
[2026-05-22 17:36:42] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2026-05-22 17:36:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 17:36:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-22 17:36:42] [INFO ] [Nat]Absence check using 7 positive and 16 generalized place invariants in 7 ms returned sat
[2026-05-22 17:36:42] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2026-05-22 17:36:42] [INFO ] Computed and/alt/rep : 238/1045/238 causal constraints (skipped 146 transitions) in 33 ms.
[2026-05-22 17:36:44] [INFO ] Added : 141 causal constraints over 29 iterations in 1471 ms. Result :sat
Minimization took 445 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 401/401 transitions.
Applied a total of 0 rules in 16 ms. Remains 219 /219 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 219/219 places, 401/401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 401/401 transitions.
Applied a total of 0 rules in 8 ms. Remains 219 /219 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2026-05-22 17:36:44] [INFO ] Invariant cache hit.
[2026-05-22 17:36:44] [INFO ] Implicit Places using invariants in 300 ms returned []
[2026-05-22 17:36:44] [INFO ] Invariant cache hit.
[2026-05-22 17:36:45] [INFO ] Implicit Places using invariants and state equation in 450 ms returned [58, 60, 62, 94, 96, 98, 100, 102, 104, 106]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 762 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 209/219 places, 401/401 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 203 transition count 353
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 203 transition count 353
Applied a total of 12 rules in 6 ms. Remains 203 /209 variables (removed 6) and now considering 353/401 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9628681001932301874.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5585956619885755522.kers'
[2026-05-22 17:36:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9628681001932301874.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5585956619885755522.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 353 rows 203 cols 1436 entries
Finished phase 1 with 99 SingleSign rule and 83 generalized
[2026-05-22 17:36:45] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5585956619885755522.kers
Total runtime 2 ms.
[2026-05-22 17:36:45] [INFO ] Implicit Places using invariants in 177 ms returned []
[2026-05-22 17:36:45] [INFO ] Invariant cache hit.
[2026-05-22 17:36:46] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 203/219 places, 353/401 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1330 ms. Remains : 203/219 places, 353/401 transitions.
[2026-05-22 17:36:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (25306 resets) in 1259 ms. (793 steps per ms)
BEST_FIRST walk for 2000001 steps (19247 resets) in 1345 ms. (1485 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-22 17:36:48] [INFO ] Invariant cache hit.
[2026-05-22 17:36:48] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2026-05-22 17:36:48] [INFO ] [Real]Absence check using 9 positive and 12 generalized place invariants in 5 ms returned sat
[2026-05-22 17:36:48] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2026-05-22 17:36:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 17:36:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-22 17:36:48] [INFO ] [Nat]Absence check using 9 positive and 12 generalized place invariants in 16 ms returned sat
[2026-05-22 17:36:48] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2026-05-22 17:36:49] [INFO ] Computed and/alt/rep : 197/832/197 causal constraints (skipped 139 transitions) in 31 ms.
[2026-05-22 17:36:49] [INFO ] Added : 75 causal constraints over 15 iterations in 374 ms. Result :sat
Minimization took 116 ms.
[2026-05-22 17:36:49] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-22 17:36:49] [INFO ] [Real]Absence check using 9 positive and 12 generalized place invariants in 3 ms returned sat
[2026-05-22 17:36:49] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2026-05-22 17:36:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 17:36:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-22 17:36:49] [INFO ] [Nat]Absence check using 9 positive and 12 generalized place invariants in 40 ms returned sat
[2026-05-22 17:36:49] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2026-05-22 17:36:49] [INFO ] Computed and/alt/rep : 197/832/197 causal constraints (skipped 139 transitions) in 30 ms.
[2026-05-22 17:36:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 565 ms
[2026-05-22 17:36:50] [INFO ] Added : 98 causal constraints over 20 iterations in 1108 ms. Result :sat
Minimization took 131 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 353/353 transitions.
Applied a total of 0 rules in 4 ms. Remains 203 /203 variables (removed 0) and now considering 353/353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 203/203 places, 353/353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 353/353 transitions.
Applied a total of 0 rules in 4 ms. Remains 203 /203 variables (removed 0) and now considering 353/353 (removed 0) transitions.
[2026-05-22 17:36:51] [INFO ] Invariant cache hit.
[2026-05-22 17:36:51] [INFO ] Implicit Places using invariants in 192 ms returned []
[2026-05-22 17:36:51] [INFO ] Invariant cache hit.
[2026-05-22 17:36:51] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
[2026-05-22 17:36:51] [INFO ] Redundant transitions in 7 ms returned []
Running 336 sub problems to find dead transitions.
[2026-05-22 17:36:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 17/35 constraints. Problems are: Problem set: 57 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/35 constraints. Problems are: Problem set: 57 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 1/203 variables, 3/38 constraints. Problems are: Problem set: 57 solved, 279 unsolved
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 2/40 constraints. Problems are: Problem set: 64 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/40 constraints. Problems are: Problem set: 64 solved, 272 unsolved
Problem TDEAD64 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
At refinement iteration 7 (OVERLAPS) 353/556 variables, 203/243 constraints. Problems are: Problem set: 102 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 0/243 constraints. Problems are: Problem set: 102 solved, 234 unsolved
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD77 is UNSAT
At refinement iteration 9 (OVERLAPS) 0/556 variables, 3/246 constraints. Problems are: Problem set: 107 solved, 229 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/556 variables, 0/246 constraints. Problems are: Problem set: 107 solved, 229 unsolved
At refinement iteration 11 (OVERLAPS) 0/556 variables, 0/246 constraints. Problems are: Problem set: 107 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 246 constraints, problems are : Problem set: 107 solved, 229 unsolved in 28509 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 107 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 6/6 constraints. Problems are: Problem set: 107 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 12/18 constraints. Problems are: Problem set: 107 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/38 constraints. Problems are: Problem set: 107 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/38 constraints. Problems are: Problem set: 107 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 1/203 variables, 3/41 constraints. Problems are: Problem set: 107 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 2/43 constraints. Problems are: Problem set: 107 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/43 constraints. Problems are: Problem set: 107 solved, 229 unsolved
Problem TDEAD97 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD345 is UNSAT
At refinement iteration 7 (OVERLAPS) 353/556 variables, 203/246 constraints. Problems are: Problem set: 123 solved, 213 unsolved
Problem TDEAD151 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 213/459 constraints. Problems are: Problem set: 124 solved, 212 unsolved
Problem TDEAD185 is UNSAT
Problem TDEAD188 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 4/463 constraints. Problems are: Problem set: 126 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 556/556 variables, and 463 constraints, problems are : Problem set: 126 solved, 210 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 213/336 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58598ms problems are : Problem set: 126 solved, 210 unsolved
Search for dead transitions found 126 dead transitions in 58599ms
Found 126 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 126 transitions
Dead transitions reduction (with SMT) removed 126 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 203/203 places, 227/353 transitions.
Ensure Unique test removed 18 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 182 transition count 199
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 77 place count 154 transition count 199
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 77 place count 154 transition count 197
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 81 place count 152 transition count 197
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 152 transition count 196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 151 transition count 196
Applied a total of 83 rules in 23 ms. Remains 151 /203 variables (removed 52) and now considering 196/227 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16548158948918166439.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-600820159609944065.kers'
[2026-05-22 17:37:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16548158948918166439.kers, --Pflows, --basisKERS=/tmp/petrispot-output-600820159609944065.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 196 rows 151 cols 793 entries
Finished phase 1 with 57 SingleSign rule and 73 generalized
[2026-05-22 17:37:50] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-600820159609944065.kers
Total runtime 1 ms.
[2026-05-22 17:37:50] [INFO ] Implicit Places using invariants in 133 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 136 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 150/203 places, 196/353 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 150 transition count 189
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 143 transition count 189
Applied a total of 14 rules in 4 ms. Remains 143 /150 variables (removed 7) and now considering 189/196 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-740580266570873007.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8184669083729239622.kers'
[2026-05-22 17:37:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-740580266570873007.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8184669083729239622.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 189 rows 142 cols 770 entries
Finished phase 1 with 54 SingleSign rule and 69 generalized
[2026-05-22 17:37:50] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8184669083729239622.kers
Total runtime 1 ms.
[2026-05-22 17:37:50] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-22 17:37:50] [INFO ] Invariant cache hit.
[2026-05-22 17:37:50] [INFO ] Implicit Places using invariants and state equation in 154 ms returned [6, 7, 33]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 268 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 140/203 places, 189/353 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 59671 ms. Remains : 140/203 places, 189/353 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-42551319780659510.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1725090536353877675.kers'
[2026-05-22 17:37:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-42551319780659510.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1725090536353877675.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 189 rows 139 cols 762 entries
Finished phase 1 with 75 SingleSign rule and 47 generalized
[2026-05-22 17:37:50] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-1725090536353877675.kers
Total runtime 14 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (33064 resets) in 1296 ms. (771 steps per ms)
FORMULA ASLink-PT-02b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (10494 resets) in 597 ms. (1672 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-22 17:37:52] [INFO ] Invariant cache hit.
[2026-05-22 17:37:52] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 17:37:52] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2026-05-22 17:37:52] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2026-05-22 17:37:53] [INFO ] Computed and/alt/rep : 92/305/92 causal constraints (skipped 80 transitions) in 13 ms.
[2026-05-22 17:37:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 17:37:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 17:37:53] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 3 ms returned sat
[2026-05-22 17:37:53] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2026-05-22 17:37:53] [INFO ] Computed and/alt/rep : 92/305/92 causal constraints (skipped 80 transitions) in 10 ms.
[2026-05-22 17:37:53] [INFO ] Added : 26 causal constraints over 6 iterations in 69 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 140 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p64) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 188/188 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 140 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 139 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 139 transition count 186
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 138 transition count 186
Applied a total of 4 rules in 4 ms. Remains 138 /140 variables (removed 2) and now considering 186/188 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 138/140 places, 186/188 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14893554193528622074.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2412072800436556839.kers'
[2026-05-22 17:37:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14893554193528622074.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2412072800436556839.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 186 rows 137 cols 755 entries
Finished phase 1 with 73 SingleSign rule and 47 generalized
[2026-05-22 17:37:53] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2412072800436556839.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (33102 resets) in 1174 ms. (851 steps per ms)
BEST_FIRST walk for 1000000 steps (10558 resets) in 514 ms. (1941 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-22 17:37:55] [INFO ] Invariant cache hit.
[2026-05-22 17:37:55] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 17:37:55] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 3 ms returned sat
[2026-05-22 17:37:55] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2026-05-22 17:37:55] [INFO ] Computed and/alt/rep : 89/301/89 causal constraints (skipped 80 transitions) in 11 ms.
[2026-05-22 17:37:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 17:37:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-22 17:37:55] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 3 ms returned sat
[2026-05-22 17:37:55] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2026-05-22 17:37:55] [INFO ] Computed and/alt/rep : 89/301/89 causal constraints (skipped 80 transitions) in 12 ms.
[2026-05-22 17:37:55] [INFO ] Added : 35 causal constraints over 7 iterations in 133 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
FORMULA ASLink-PT-02b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
All properties solved without resorting to model-checking.
Total runtime 187188 ms.

BK_STOP 1779471475677

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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 UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-02b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is ASLink-PT-02b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-oct2-177944366100309"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02b.tgz
mv ASLink-PT-02b execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;