About the Execution of ITS-Tools for Szymanski-PT-b12
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1150288.00 | 0.00 | 0.00 | 1 1 1 1 ? 1 ? 0 12 1 1 0 1 0 1 1 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r240-tall-174915589300173.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is Szymanski-PT-b12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-tall-174915589300173
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 3.7M May 29 14:33 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 Szymanski-PT-b12-UpperBounds-00
FORMULA_NAME Szymanski-PT-b12-UpperBounds-01
FORMULA_NAME Szymanski-PT-b12-UpperBounds-02
FORMULA_NAME Szymanski-PT-b12-UpperBounds-03
FORMULA_NAME Szymanski-PT-b12-UpperBounds-04
FORMULA_NAME Szymanski-PT-b12-UpperBounds-05
FORMULA_NAME Szymanski-PT-b12-UpperBounds-06
FORMULA_NAME Szymanski-PT-b12-UpperBounds-07
FORMULA_NAME Szymanski-PT-b12-UpperBounds-08
FORMULA_NAME Szymanski-PT-b12-UpperBounds-09
FORMULA_NAME Szymanski-PT-b12-UpperBounds-10
FORMULA_NAME Szymanski-PT-b12-UpperBounds-11
FORMULA_NAME Szymanski-PT-b12-UpperBounds-12
FORMULA_NAME Szymanski-PT-b12-UpperBounds-13
FORMULA_NAME Szymanski-PT-b12-UpperBounds-14
FORMULA_NAME Szymanski-PT-b12-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749188613770
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-06 05:43:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 05:43:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 05:43:35] [INFO ] Load time of PNML (sax parser for PT used): 332 ms
[2025-06-06 05:43:35] [INFO ] Transformed 568 places.
[2025-06-06 05:43:35] [INFO ] Transformed 8320 transitions.
[2025-06-06 05:43:35] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 496 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 260 places in 19 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b12-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-06 05:43:35] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2025-06-06 05:43:35] [INFO ] Computed 3 invariants in 64 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 25, 1, 1, 1, 1, 1]
RANDOM walk for 10002 steps (4 resets) in 74 ms. (133 steps per ms)
FORMULA Szymanski-PT-b12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b12-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b12-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b12-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70005 steps (17 resets) in 163 ms. (426 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 7, 0, 0, 0] Max Struct:[1, 1, 1, 25, 1, 1, 1]
[2025-06-06 05:43:36] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2025-06-06 05:43:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 05:43:36] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2025-06-06 05:43:36] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 05:43:37] [INFO ] [Real]Absence check using state equation in 667 ms returned sat
[2025-06-06 05:43:37] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 05:43:37] [INFO ] [Real]Added 147 Read/Feed constraints in 106 ms returned sat
[2025-06-06 05:43:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 05:43:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-06-06 05:43:38] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 05:43:38] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2025-06-06 05:43:39] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 05:43:39] [INFO ] [Nat]Added 147 Read/Feed constraints in 548 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:40] [INFO ] Deduced a trap composed of 51 places in 669 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:41] [INFO ] Deduced a trap composed of 79 places in 580 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:41] [INFO ] Deduced a trap composed of 138 places in 460 ms of which 10 ms to minimize.
[2025-06-06 05:43:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2029 ms
[2025-06-06 05:43:42] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 999 ms.
[2025-06-06 05:43:42] [INFO ] Added : 0 causal constraints over 0 iterations in 1194 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 05:43:42] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-06-06 05:43:42] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 05:43:43] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2025-06-06 05:43:43] [INFO ] [Real]Added 147 Read/Feed constraints in 420 ms returned sat
[2025-06-06 05:43:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 05:43:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-06-06 05:43:44] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 05:43:44] [INFO ] [Nat]Absence check using state equation in 514 ms returned sat
[2025-06-06 05:43:45] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 05:43:45] [INFO ] [Nat]Added 147 Read/Feed constraints in 1054 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 05:43:45] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-06-06 05:43:45] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 05:43:46] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2025-06-06 05:43:46] [INFO ] [Real]Added 147 Read/Feed constraints in 76 ms returned sat
[2025-06-06 05:43:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 05:43:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-06-06 05:43:46] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 05:43:46] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2025-06-06 05:43:47] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 05:43:47] [INFO ] [Nat]Added 147 Read/Feed constraints in 894 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:48] [INFO ] Deduced a trap composed of 51 places in 719 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:49] [INFO ] Deduced a trap composed of 79 places in 652 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:49] [INFO ] Deduced a trap composed of 85 places in 662 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:50] [INFO ] Deduced a trap composed of 130 places in 722 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:51] [INFO ] Deduced a trap composed of 130 places in 717 ms of which 83 ms to minimize.
[2025-06-06 05:43:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 05:43:52] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-06-06 05:43:52] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 05:43:52] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2025-06-06 05:43:52] [INFO ] [Real]Added 147 Read/Feed constraints in 133 ms returned sat
[2025-06-06 05:43:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 05:43:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-06-06 05:43:53] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 05:43:53] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2025-06-06 05:43:54] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 05:43:54] [INFO ] [Nat]Added 147 Read/Feed constraints in 1041 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 05:43:54] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-06-06 05:43:54] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 05:43:55] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2025-06-06 05:43:55] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 05:43:55] [INFO ] [Real]Added 147 Read/Feed constraints in 849 ms returned sat
[2025-06-06 05:43:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 05:43:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-06-06 05:43:56] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-06 05:43:56] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2025-06-06 05:43:57] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 05:43:57] [INFO ] [Nat]Added 147 Read/Feed constraints in 1097 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:58] [INFO ] Deduced a trap composed of 130 places in 716 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:43:59] [INFO ] Deduced a trap composed of 130 places in 730 ms of which 71 ms to minimize.
[2025-06-06 05:43:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1621 ms
[2025-06-06 05:43:59] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 490 ms.
[2025-06-06 05:43:59] [INFO ] Added : 0 causal constraints over 0 iterations in 675 ms. Result :sat
Minimization took 1111 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 05:44:01] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-06-06 05:44:01] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 05:44:01] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2025-06-06 05:44:01] [INFO ] [Real]Added 147 Read/Feed constraints in 170 ms returned sat
[2025-06-06 05:44:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 05:44:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-06-06 05:44:01] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 05:44:02] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2025-06-06 05:44:02] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 05:44:03] [INFO ] [Nat]Added 147 Read/Feed constraints in 1038 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 05:44:03] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2025-06-06 05:44:03] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 05:44:03] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2025-06-06 05:44:04] [INFO ] [Real]Added 147 Read/Feed constraints in 307 ms returned sat
[2025-06-06 05:44:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 05:44:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-06-06 05:44:04] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 05:44:04] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2025-06-06 05:44:05] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 05:44:05] [INFO ] [Nat]Added 147 Read/Feed constraints in 1045 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 7, 0, 0, 0] Max Struct:[1, 1, 1, 25, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 7, 0, 0, 0] Max Struct:[1, 1, 1, 25, 1, 1, 1]
Support contains 7 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 306 transition count 7936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 305 transition count 7808
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 305 transition count 7808
Applied a total of 131 rules in 428 ms. Remains 305 /308 variables (removed 3) and now considering 7808/8064 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 454 ms. Remains : 305/308 places, 7808/8064 transitions.
[2025-06-06 05:44:06] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2025-06-06 05:44:06] [INFO ] Computed 3 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 7, 0, 0, 0] Max Struct:[1, 1, 1, 12, 1, 1, 1]
FORMULA Szymanski-PT-b12-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 982 ms. (1017 steps per ms)
FORMULA Szymanski-PT-b12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b12-UpperBounds-08 12 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000003 steps (8 resets) in 3925 ms. (1018 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-06 05:44:11] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 05:44:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 05:44:11] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 05:44:11] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2025-06-06 05:44:11] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 05:44:12] [INFO ] [Real]Added 147 Read/Feed constraints in 118 ms returned sat
[2025-06-06 05:44:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 05:44:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 05:44:12] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2025-06-06 05:44:15] [INFO ] [Nat]Added 147 Read/Feed constraints in 2824 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:16] [INFO ] Deduced a trap composed of 37 places in 656 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:16] [INFO ] Deduced a trap composed of 50 places in 625 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:17] [INFO ] Deduced a trap composed of 78 places in 576 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:17] [INFO ] Deduced a trap composed of 137 places in 512 ms of which 39 ms to minimize.
[2025-06-06 05:44:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2665 ms
[2025-06-06 05:44:18] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 423 ms.
[2025-06-06 05:44:18] [INFO ] Added : 0 causal constraints over 0 iterations in 601 ms. Result :sat
Minimization took 4909 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 05:44:23] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 05:44:24] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2025-06-06 05:44:24] [INFO ] [Real]Added 147 Read/Feed constraints in 94 ms returned sat
[2025-06-06 05:44:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 05:44:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 05:44:24] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2025-06-06 05:44:27] [INFO ] [Nat]Added 147 Read/Feed constraints in 2326 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:27] [INFO ] Deduced a trap composed of 37 places in 616 ms of which 43 ms to minimize.
[2025-06-06 05:44:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 734 ms
[2025-06-06 05:44:28] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 435 ms.
[2025-06-06 05:44:28] [INFO ] Added : 0 causal constraints over 0 iterations in 617 ms. Result :sat
Minimization took 4891 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 05:44:33] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 05:44:33] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2025-06-06 05:44:33] [INFO ] [Real]Added 147 Read/Feed constraints in 98 ms returned sat
[2025-06-06 05:44:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 05:44:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-06 05:44:34] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2025-06-06 05:44:35] [INFO ] [Nat]Added 147 Read/Feed constraints in 983 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:36] [INFO ] Deduced a trap composed of 37 places in 665 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:36] [INFO ] Deduced a trap composed of 129 places in 719 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:37] [INFO ] Deduced a trap composed of 129 places in 659 ms of which 84 ms to minimize.
[2025-06-06 05:44:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2299 ms
[2025-06-06 05:44:38] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 413 ms.
[2025-06-06 05:44:38] [INFO ] Added : 0 causal constraints over 0 iterations in 610 ms. Result :sat
Minimization took 4892 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 05:44:43] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 05:44:43] [INFO ] [Real]Absence check using state equation in 440 ms returned sat
[2025-06-06 05:44:43] [INFO ] [Real]Added 147 Read/Feed constraints in 107 ms returned sat
[2025-06-06 05:44:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 05:44:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-06 05:44:44] [INFO ] [Nat]Absence check using state equation in 437 ms returned sat
[2025-06-06 05:44:45] [INFO ] [Nat]Added 147 Read/Feed constraints in 840 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:45] [INFO ] Deduced a trap composed of 37 places in 664 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:46] [INFO ] Deduced a trap composed of 50 places in 733 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:47] [INFO ] Deduced a trap composed of 84 places in 706 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:48] [INFO ] Deduced a trap composed of 129 places in 743 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:44:48] [INFO ] Deduced a trap composed of 129 places in 681 ms of which 83 ms to minimize.
[2025-06-06 05:44:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4168 ms
[2025-06-06 05:44:49] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 437 ms.
[2025-06-06 05:44:50] [INFO ] Added : 2 causal constraints over 1 iterations in 696 ms. Result :sat
Minimization took 4895 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 261 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 261 ms. Remains : 305/305 places, 7808/7808 transitions.
[2025-06-06 05:44:55] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 05:44:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000009 steps (2 resets) in 978 ms. (1021 steps per ms)
BEST_FIRST walk for 4000003 steps (8 resets) in 3344 ms. (1195 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-06 05:44:59] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 05:44:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 05:44:59] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 05:45:00] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2025-06-06 05:45:00] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 05:45:00] [INFO ] [Real]Added 147 Read/Feed constraints in 117 ms returned sat
[2025-06-06 05:45:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 05:45:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 05:45:00] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2025-06-06 05:45:03] [INFO ] [Nat]Added 147 Read/Feed constraints in 2853 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:04] [INFO ] Deduced a trap composed of 37 places in 604 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:04] [INFO ] Deduced a trap composed of 50 places in 582 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:05] [INFO ] Deduced a trap composed of 78 places in 565 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:06] [INFO ] Deduced a trap composed of 137 places in 494 ms of which 39 ms to minimize.
[2025-06-06 05:45:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2533 ms
[2025-06-06 05:45:06] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 410 ms.
[2025-06-06 05:45:06] [INFO ] Added : 0 causal constraints over 0 iterations in 580 ms. Result :sat
Minimization took 4899 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 05:45:11] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 05:45:12] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2025-06-06 05:45:12] [INFO ] [Real]Added 147 Read/Feed constraints in 103 ms returned sat
[2025-06-06 05:45:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 05:45:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 05:45:12] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2025-06-06 05:45:15] [INFO ] [Nat]Added 147 Read/Feed constraints in 2443 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:15] [INFO ] Deduced a trap composed of 37 places in 669 ms of which 44 ms to minimize.
[2025-06-06 05:45:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 796 ms
[2025-06-06 05:45:16] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 429 ms.
[2025-06-06 05:45:16] [INFO ] Added : 0 causal constraints over 0 iterations in 611 ms. Result :sat
Minimization took 4888 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 05:45:21] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 05:45:21] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2025-06-06 05:45:22] [INFO ] [Real]Added 147 Read/Feed constraints in 94 ms returned sat
[2025-06-06 05:45:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 05:45:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 05:45:22] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2025-06-06 05:45:23] [INFO ] [Nat]Added 147 Read/Feed constraints in 970 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:24] [INFO ] Deduced a trap composed of 37 places in 656 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:25] [INFO ] Deduced a trap composed of 129 places in 640 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:25] [INFO ] Deduced a trap composed of 129 places in 696 ms of which 84 ms to minimize.
[2025-06-06 05:45:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2244 ms
[2025-06-06 05:45:26] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 420 ms.
[2025-06-06 05:45:26] [INFO ] Added : 0 causal constraints over 0 iterations in 605 ms. Result :sat
Minimization took 4899 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 05:45:31] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 05:45:31] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2025-06-06 05:45:31] [INFO ] [Real]Added 147 Read/Feed constraints in 113 ms returned sat
[2025-06-06 05:45:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 05:45:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 05:45:32] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2025-06-06 05:45:33] [INFO ] [Nat]Added 147 Read/Feed constraints in 853 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:34] [INFO ] Deduced a trap composed of 37 places in 627 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:34] [INFO ] Deduced a trap composed of 50 places in 668 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:35] [INFO ] Deduced a trap composed of 84 places in 650 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:36] [INFO ] Deduced a trap composed of 129 places in 648 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:45:36] [INFO ] Deduced a trap composed of 129 places in 675 ms of which 83 ms to minimize.
[2025-06-06 05:45:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3909 ms
[2025-06-06 05:45:37] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 423 ms.
[2025-06-06 05:45:37] [INFO ] Added : 2 causal constraints over 1 iterations in 680 ms. Result :sat
Minimization took 4892 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 296 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 296 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 194 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2025-06-06 05:45:43] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 05:45:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:45:45] [INFO ] Implicit Places using invariants in 2307 ms returned []
[2025-06-06 05:45:45] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 05:45:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:45:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 05:46:10] [INFO ] Implicit Places using invariants and state equation in 24750 ms returned []
Implicit Place search using SMT with State Equation took 27061 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 05:46:11] [INFO ] Redundant transitions in 932 ms returned []
Running 7806 sub problems to find dead transitions.
[2025-06-06 05:46:11] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 05:46:11] [INFO ] Invariant cache hit.
[2025-06-06 05:46:11] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30144 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7806 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 73951ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 74005ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102247 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40019 steps (8 resets) in 623 ms. (64 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 4/6 properties
[2025-06-06 05:47:26] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 05:47:26] [INFO ] Invariant cache hit.
[2025-06-06 05:47:26] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 254/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:26] [INFO ] Flatten gal took : 540 ms
[2025-06-06 05:47:26] [INFO ] Deduced a trap composed of 36 places in 517 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:26] [INFO ] Flatten gal took : 294 ms
[2025-06-06 05:47:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4909479455257047735.gal : 96 ms
[2025-06-06 05:47:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8017346701556829664.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4909479455257047735.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8017346701556829664.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
[2025-06-06 05:47:27] [INFO ] Deduced a trap composed of 37 places in 439 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:27] [INFO ] Deduced a trap composed of 42 places in 551 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Loading property file /tmp/ReachabilityCardinality8017346701556829664.prop.
[2025-06-06 05:47:28] [INFO ] Deduced a trap composed of 50 places in 554 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:28] [INFO ] Deduced a trap composed of 42 places in 612 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:29] [INFO ] Deduced a trap composed of 48 places in 592 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:30] [INFO ] Deduced a trap composed of 75 places in 499 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 63
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :63 after 445
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :445 after 38675
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :38675 after 433196
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :433196 after 1.44287e+06
[2025-06-06 05:47:30] [INFO ] Deduced a trap composed of 129 places in 591 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:31] [INFO ] Deduced a trap composed of 129 places in 591 ms of which 62 ms to minimize.
SMT process timed out in 5223ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1.44287e+06 after 1.48496e+07
Applied a total of 0 rules in 214 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40022 steps (8 resets) in 332 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.48496e+07 after 2.57722e+07
Interrupted probabilistic random walk after 175507 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 4
Probabilistic random walk after 175507 steps, saw 137429 distinct states, run finished after 3005 ms. (steps per millisecond=58 ) properties seen :0
[2025-06-06 05:47:34] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 05:47:34] [INFO ] Invariant cache hit.
[2025-06-06 05:47:34] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 254/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:35] [INFO ] Deduced a trap composed of 36 places in 539 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:36] [INFO ] Deduced a trap composed of 37 places in 518 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:36] [INFO ] Deduced a trap composed of 42 places in 509 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:37] [INFO ] Deduced a trap composed of 50 places in 513 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2.57722e+07 after 3.10149e+07
[2025-06-06 05:47:37] [INFO ] Deduced a trap composed of 42 places in 508 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:38] [INFO ] Deduced a trap composed of 48 places in 542 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:38] [INFO ] Deduced a trap composed of 75 places in 527 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:39] [INFO ] Deduced a trap composed of 129 places in 551 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:40] [INFO ] Deduced a trap composed of 129 places in 547 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:40] [INFO ] Deduced a trap composed of 59 places in 484 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:41] [INFO ] Deduced a trap composed of 64 places in 527 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:41] [INFO ] Deduced a trap composed of 78 places in 342 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:47:41] [INFO ] Deduced a trap composed of 137 places in 263 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 468 constraints, problems are : Problem set: 0 solved, 4 unsolved in 8265 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 254/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :3.10149e+07 after 1.20559e+08
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1.20559e+08 after 6.52271e+08
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 4/472 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/2909 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 472 constraints, problems are : Problem set: 0 solved, 4 unsolved in 7049 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15346ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 676 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 176 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2025-06-06 05:47:51] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 05:47:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:47:53] [INFO ] Implicit Places using invariants in 2199 ms returned []
[2025-06-06 05:47:53] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 05:47:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:47:53] [INFO ] State equation strengthened by 147 read => feed constraints.
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :6.52271e+08 after 1.12132e+09
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :1.12132e+09 after 2.4751e+09
[2025-06-06 05:48:16] [INFO ] Implicit Places using invariants and state equation in 22551 ms returned []
Implicit Place search using SMT with State Equation took 24757 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 05:48:16] [INFO ] Redundant transitions in 822 ms returned []
Running 7806 sub problems to find dead transitions.
[2025-06-06 05:48:16] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 05:48:16] [INFO ] Invariant cache hit.
[2025-06-06 05:48:16] [INFO ] State equation strengthened by 147 read => feed constraints.
Detected timeout of ITS tools.
[2025-06-06 05:48:17] [INFO ] Flatten gal took : 225 ms
[2025-06-06 05:48:17] [INFO ] Applying decomposition
[2025-06-06 05:48:17] [INFO ] Flatten gal took : 221 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15884909063637072384.txt' '-o' '/tmp/graph15884909063637072384.bin' '-w' '/tmp/graph15884909063637072384.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15884909063637072384.bin' '-l' '-1' '-v' '-w' '/tmp/graph15884909063637072384.weights' '-q' '0' '-e' '0.001'
[2025-06-06 05:48:18] [INFO ] Decomposing Gal with order
[2025-06-06 05:48:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 05:48:19] [INFO ] Removed a total of 17583 redundant transitions.
[2025-06-06 05:48:19] [INFO ] Flatten gal took : 1028 ms
[2025-06-06 05:48:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 1203 labels/synchronizations in 346 ms.
[2025-06-06 05:48:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14663840593397007806.gal : 45 ms
[2025-06-06 05:48:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3289715229422920153.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14663840593397007806.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3289715229422920153.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality3289715229422920153.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 27
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :27 after 138
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :138 after 576
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :576 after 1682
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1682 after 18053
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :18053 after 107489
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :107489 after 373305
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :373305 after 378325
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :378325 after 378325
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :378325 after 378325
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30155 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7806 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 75081ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 75105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100910 ms. Remains : 305/305 places, 7808/7808 transitions.
FORMULA Szymanski-PT-b12-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA Szymanski-PT-b12-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[0, 0] Max Struct:[1, 1]
Starting property specific reduction for Szymanski-PT-b12-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-06-06 05:49:32] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 05:49:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10009 steps (2 resets) in 22 ms. (435 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-06 05:49:32] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 05:49:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 05:49:32] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 05:49:32] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2025-06-06 05:49:32] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 05:49:32] [INFO ] [Real]Added 147 Read/Feed constraints in 115 ms returned sat
[2025-06-06 05:49:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 05:49:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-06 05:49:33] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2025-06-06 05:49:33] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 05:49:34] [INFO ] [Nat]Added 147 Read/Feed constraints in 1048 ms returned unknown
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 305 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p239) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 305/305 places, 7807/7807 transitions.
[2025-06-06 05:49:34] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
// Phase 1: matrix 2603 rows 305 cols
[2025-06-06 05:49:34] [INFO ] Computed 3 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1029 ms. (970 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1014 ms. (985 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-06 05:49:36] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 05:49:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 05:49:36] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 05:49:37] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2025-06-06 05:49:37] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 05:49:37] [INFO ] [Real]Added 147 Read/Feed constraints in 102 ms returned sat
[2025-06-06 05:49:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 05:49:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-06 05:49:37] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2025-06-06 05:49:38] [INFO ] [Nat]Added 147 Read/Feed constraints in 467 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:38] [INFO ] Deduced a trap composed of 37 places in 662 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:49:39] [INFO ] Deduced a trap composed of 129 places in 661 ms of which 52 ms to minimize.
[2025-06-06 05:49:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1498 ms
[2025-06-06 05:49:40] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2592 transitions) in 412 ms.
[2025-06-06 05:49:40] [INFO ] Added : 0 causal constraints over 0 iterations in 594 ms. Result :sat
Minimization took 4910 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 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 193 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 305/305 places, 7807/7807 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 180 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
[2025-06-06 05:49:45] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 05:49:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:49:47] [INFO ] Implicit Places using invariants in 2278 ms returned []
[2025-06-06 05:49:47] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 05:49:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:49:48] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 05:50:03] [INFO ] Implicit Places using invariants and state equation in 15745 ms returned []
Implicit Place search using SMT with State Equation took 18025 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 05:50:04] [INFO ] Redundant transitions in 625 ms returned []
Running 7805 sub problems to find dead transitions.
[2025-06-06 05:50:04] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 05:50:04] [INFO ] Invariant cache hit.
[2025-06-06 05:50:04] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/2908 variables, and 2 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30098 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7805/7805 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7805 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/2908 variables, and 2 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30097 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7805 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 74077ms problems are : Problem set: 0 solved, 7805 unsolved
Search for dead transitions found 0 dead transitions in 74091ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92942 ms. Remains : 305/305 places, 7807/7807 transitions.
RANDOM walk for 40020 steps (8 resets) in 306 ms. (130 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
[2025-06-06 05:51:18] [INFO ] Flatten gal took : 276 ms
[2025-06-06 05:51:18] [INFO ] Flatten gal took : 196 ms
[2025-06-06 05:51:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6061488956901830481.gal : 34 ms
[2025-06-06 05:51:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16923076875367825668.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6061488956901830481.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16923076875367825668.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16923076875367825668.prop.
Interrupted probabilistic random walk after 168594 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 2
Probabilistic random walk after 168594 steps, saw 132125 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
[2025-06-06 05:51:21] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 05:51:21] [INFO ] Invariant cache hit.
[2025-06-06 05:51:21] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 63
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :63 after 445
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :445 after 38675
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :38675 after 433196
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :433196 after 1.44287e+06
[2025-06-06 05:51:22] [INFO ] Deduced a trap composed of 48 places in 553 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:23] [INFO ] Deduced a trap composed of 72 places in 597 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.44287e+06 after 1.48496e+07
[2025-06-06 05:51:23] [INFO ] Deduced a trap composed of 129 places in 573 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.48496e+07 after 2.57722e+07
[2025-06-06 05:51:24] [INFO ] Deduced a trap composed of 78 places in 610 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:24] [INFO ] Deduced a trap composed of 129 places in 594 ms of which 49 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2603/2908 variables, 305/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2908 variables, 147/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2908 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2908 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2908/2908 variables, and 460 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4637 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:26] [INFO ] Deduced a trap composed of 45 places in 497 ms of which 40 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2603/2908 variables, 305/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.57722e+07 after 3.10149e+07
After SMT solving in domain Int declared 2908/2908 variables, and 461 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3337 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8000ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 219 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 305/305 places, 7807/7807 transitions.
RANDOM walk for 40016 steps (8 resets) in 223 ms. (178 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 200694 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 2
Probabilistic random walk after 200694 steps, saw 157234 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-06-06 05:51:33] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 05:51:33] [INFO ] Invariant cache hit.
[2025-06-06 05:51:33] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:33] [INFO ] Deduced a trap composed of 48 places in 490 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:34] [INFO ] Deduced a trap composed of 72 places in 509 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3.10149e+07 after 1.20559e+08
[2025-06-06 05:51:34] [INFO ] Deduced a trap composed of 129 places in 540 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:35] [INFO ] Deduced a trap composed of 78 places in 536 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:35] [INFO ] Deduced a trap composed of 129 places in 539 ms of which 49 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2603/2908 variables, 305/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2908 variables, 147/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2908 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2908 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2908/2908 variables, and 460 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4422 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:51:38] [INFO ] Deduced a trap composed of 45 places in 541 ms of which 42 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2603/2908 variables, 305/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.20559e+08 after 6.52271e+08
At refinement iteration 10 (INCLUDED_ONLY) 0/2908 variables, 147/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2908 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2908 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2908 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2908/2908 variables, and 463 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4631 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9088ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 69 ms.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 179 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 305/305 places, 7807/7807 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 259 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
[2025-06-06 05:51:42] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 05:51:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:51:44] [INFO ] Implicit Places using invariants in 2203 ms returned []
[2025-06-06 05:51:44] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 05:51:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:51:45] [INFO ] State equation strengthened by 147 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :6.52271e+08 after 1.12132e+09
[2025-06-06 05:52:00] [INFO ] Implicit Places using invariants and state equation in 15490 ms returned []
Implicit Place search using SMT with State Equation took 17718 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 05:52:01] [INFO ] Redundant transitions in 856 ms returned []
Running 7805 sub problems to find dead transitions.
[2025-06-06 05:52:01] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 05:52:01] [INFO ] Invariant cache hit.
[2025-06-06 05:52:01] [INFO ] State equation strengthened by 147 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.12132e+09 after 2.4751e+09
Detected timeout of ITS tools.
[2025-06-06 05:52:09] [INFO ] Flatten gal took : 189 ms
[2025-06-06 05:52:09] [INFO ] Applying decomposition
[2025-06-06 05:52:09] [INFO ] Flatten gal took : 229 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3497005602129000373.txt' '-o' '/tmp/graph3497005602129000373.bin' '-w' '/tmp/graph3497005602129000373.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3497005602129000373.bin' '-l' '-1' '-v' '-w' '/tmp/graph3497005602129000373.weights' '-q' '0' '-e' '0.001'
[2025-06-06 05:52:10] [INFO ] Decomposing Gal with order
[2025-06-06 05:52:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 05:52:10] [INFO ] Removed a total of 17884 redundant transitions.
[2025-06-06 05:52:10] [INFO ] Flatten gal took : 627 ms
[2025-06-06 05:52:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 1192 labels/synchronizations in 287 ms.
[2025-06-06 05:52:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2463974251167661199.gal : 28 ms
[2025-06-06 05:52:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3878031461095570311.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2463974251167661199.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3878031461095570311.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality3878031461095570311.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :6 after 6
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :6 after 37
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :37 after 632
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :632 after 127598
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :127598 after 786411
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :786411 after 961315
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :961315 after 1.33156e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.33156e+06 after 1.3471e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.3471e+06 after 1.4164e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/2908 variables, and 2 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7805/7805 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7805 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Detected timeout of ITS tools.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/2908 variables, and 2 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30084 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7805 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 74456ms problems are : Problem set: 0 solved, 7805 unsolved
Search for dead transitions found 0 dead transitions in 74472ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93330 ms. Remains : 305/305 places, 7807/7807 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for Szymanski-PT-b12-UpperBounds-04 in 223738 ms.
Starting property specific reduction for Szymanski-PT-b12-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-06-06 05:53:15] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2025-06-06 05:53:15] [INFO ] Computed 3 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2 resets) in 36 ms. (270 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-06 05:53:15] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 05:53:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 05:53:15] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 05:53:16] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2025-06-06 05:53:16] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 05:53:16] [INFO ] [Real]Added 147 Read/Feed constraints in 99 ms returned sat
[2025-06-06 05:53:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 05:53:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 05:53:17] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2025-06-06 05:53:17] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 05:53:18] [INFO ] [Nat]Added 147 Read/Feed constraints in 1042 ms returned unknown
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 305 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p187) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 186 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 305/305 places, 7807/7807 transitions.
[2025-06-06 05:53:18] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
// Phase 1: matrix 2603 rows 305 cols
[2025-06-06 05:53:18] [INFO ] Computed 3 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000005 steps (2 resets) in 849 ms. (1176 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 877 ms. (1138 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-06 05:53:20] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 05:53:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 05:53:20] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 05:53:20] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2025-06-06 05:53:20] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 05:53:21] [INFO ] [Real]Added 147 Read/Feed constraints in 1221 ms returned sat
[2025-06-06 05:53:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 05:53:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 05:53:22] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2025-06-06 05:53:22] [INFO ] [Nat]Added 147 Read/Feed constraints in 464 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:23] [INFO ] Deduced a trap composed of 37 places in 707 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:53:24] [INFO ] Deduced a trap composed of 129 places in 732 ms of which 62 ms to minimize.
[2025-06-06 05:53:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1619 ms
[2025-06-06 05:53:24] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2592 transitions) in 496 ms.
[2025-06-06 05:53:25] [INFO ] Added : 0 causal constraints over 0 iterations in 666 ms. Result :sat
Minimization took 4902 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 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 179 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 305/305 places, 7807/7807 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 180 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
[2025-06-06 05:53:30] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 05:53:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:53:32] [INFO ] Implicit Places using invariants in 2188 ms returned []
[2025-06-06 05:53:32] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 05:53:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:53:33] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 05:53:42] [INFO ] Implicit Places using invariants and state equation in 10129 ms returned []
Implicit Place search using SMT with State Equation took 12319 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 05:53:43] [INFO ] Redundant transitions in 640 ms returned []
Running 7805 sub problems to find dead transitions.
[2025-06-06 05:53:43] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 05:53:43] [INFO ] Invariant cache hit.
[2025-06-06 05:53:43] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/2908 variables, and 2 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7805/7805 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7805 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/2908 variables, and 2 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30101 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7805 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 73860ms problems are : Problem set: 0 solved, 7805 unsolved
Search for dead transitions found 0 dead transitions in 73873ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87037 ms. Remains : 305/305 places, 7807/7807 transitions.
RANDOM walk for 40024 steps (8 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
[2025-06-06 05:54:57] [INFO ] Flatten gal took : 214 ms
[2025-06-06 05:54:57] [INFO ] Flatten gal took : 174 ms
[2025-06-06 05:54:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9560813106188348612.gal : 28 ms
[2025-06-06 05:54:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7871381626039916442.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9560813106188348612.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7871381626039916442.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7871381626039916442.prop.
Interrupted probabilistic random walk after 171756 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 2
Probabilistic random walk after 171756 steps, saw 134590 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
[2025-06-06 05:55:00] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 05:55:00] [INFO ] Invariant cache hit.
[2025-06-06 05:55:00] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 63
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :63 after 445
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :445 after 38675
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :38675 after 433196
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :433196 after 1.44287e+06
[2025-06-06 05:55:01] [INFO ] Deduced a trap composed of 31 places in 613 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:01] [INFO ] Deduced a trap composed of 37 places in 566 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.44287e+06 after 1.48496e+07
[2025-06-06 05:55:02] [INFO ] Deduced a trap composed of 45 places in 586 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.48496e+07 after 2.57722e+07
[2025-06-06 05:55:02] [INFO ] Deduced a trap composed of 37 places in 610 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:03] [INFO ] Deduced a trap composed of 129 places in 622 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:04] [INFO ] Deduced a trap composed of 129 places in 578 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:04] [INFO ] Deduced a trap composed of 59 places in 471 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:05] [INFO ] Deduced a trap composed of 59 places in 465 ms of which 23 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2908 variables, and 11 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:05] [INFO ] Deduced a trap composed of 64 places in 446 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:06] [INFO ] Deduced a trap composed of 72 places in 424 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:06] [INFO ] Deduced a trap composed of 50 places in 434 ms of which 23 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2603/2908 variables, 305/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.57722e+07 after 3.10149e+07
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2908/2908 variables, and 466 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3265 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8289ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 322 ms.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 178 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 305/305 places, 7807/7807 transitions.
RANDOM walk for 40013 steps (8 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 168712 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 2
Probabilistic random walk after 168712 steps, saw 132220 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
[2025-06-06 05:55:12] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 05:55:12] [INFO ] Invariant cache hit.
[2025-06-06 05:55:12] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:12] [INFO ] Deduced a trap composed of 31 places in 540 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3.10149e+07 after 1.20559e+08
[2025-06-06 05:55:13] [INFO ] Deduced a trap composed of 37 places in 498 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:14] [INFO ] Deduced a trap composed of 45 places in 496 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:14] [INFO ] Deduced a trap composed of 37 places in 509 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:15] [INFO ] Deduced a trap composed of 129 places in 588 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:15] [INFO ] Deduced a trap composed of 129 places in 523 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:16] [INFO ] Deduced a trap composed of 59 places in 425 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:16] [INFO ] Deduced a trap composed of 59 places in 435 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2603/2908 variables, 305/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2908 variables, 147/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2908 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2908 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2908/2908 variables, and 463 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5430 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :1.20559e+08 after 6.52271e+08
[2025-06-06 05:55:18] [INFO ] Deduced a trap composed of 64 places in 451 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:18] [INFO ] Deduced a trap composed of 72 places in 436 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:55:19] [INFO ] Deduced a trap composed of 50 places in 433 ms of which 22 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2603/2908 variables, 305/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2908 variables, 147/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2908 variables, 2/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2908 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2908 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2908/2908 variables, and 468 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3849 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9296ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 323 ms.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 179 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 305/305 places, 7807/7807 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 178 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
[2025-06-06 05:55:22] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 05:55:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:55:24] [INFO ] Implicit Places using invariants in 2258 ms returned []
[2025-06-06 05:55:24] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 05:55:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:55:25] [INFO ] State equation strengthened by 147 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :6.52271e+08 after 1.12132e+09
[2025-06-06 05:55:35] [INFO ] Implicit Places using invariants and state equation in 10943 ms returned []
Implicit Place search using SMT with State Equation took 13204 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 05:55:36] [INFO ] Redundant transitions in 624 ms returned []
Running 7805 sub problems to find dead transitions.
[2025-06-06 05:55:36] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 05:55:36] [INFO ] Invariant cache hit.
[2025-06-06 05:55:36] [INFO ] State equation strengthened by 147 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.12132e+09 after 2.4751e+09
Detected timeout of ITS tools.
[2025-06-06 05:55:48] [INFO ] Flatten gal took : 461 ms
[2025-06-06 05:55:48] [INFO ] Applying decomposition
[2025-06-06 05:55:49] [INFO ] Flatten gal took : 193 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11191607135642748326.txt' '-o' '/tmp/graph11191607135642748326.bin' '-w' '/tmp/graph11191607135642748326.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11191607135642748326.bin' '-l' '-1' '-v' '-w' '/tmp/graph11191607135642748326.weights' '-q' '0' '-e' '0.001'
[2025-06-06 05:55:49] [INFO ] Decomposing Gal with order
[2025-06-06 05:55:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 05:55:50] [INFO ] Removed a total of 17804 redundant transitions.
[2025-06-06 05:55:50] [INFO ] Flatten gal took : 308 ms
[2025-06-06 05:55:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 930 labels/synchronizations in 171 ms.
[2025-06-06 05:55:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16295520345999504742.gal : 17 ms
[2025-06-06 05:55:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14285616751959429759.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16295520345999504742.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14285616751959429759.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Loading property file /tmp/ReachabilityCardinality14285616751959429759.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 45
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :45 after 90382
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :90382 after 135316
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :135316 after 505053
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :505053 after 588464
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :588464 after 1.01115e+06
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.01115e+06 after 1.04618e+06
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.04618e+06 after 1.15401e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.15401e+06 after 1.16676e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.16676e+06 after 1.17086e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.17086e+06 after 1.17549e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.17549e+06 after 1.43333e+06
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.43333e+06 after 1.44721e+06
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.44721e+06 after 1.44734e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/2908 variables, and 2 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30146 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7805/7805 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7805 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Detected timeout of ITS tools.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/2908 variables, and 2 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7805 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 74606ms problems are : Problem set: 0 solved, 7805 unsolved
Search for dead transitions found 0 dead transitions in 74623ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88657 ms. Remains : 305/305 places, 7807/7807 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for Szymanski-PT-b12-UpperBounds-06 in 215003 ms.
[2025-06-06 05:56:51] [INFO ] Flatten gal took : 195 ms
[2025-06-06 05:56:51] [INFO ] Applying decomposition
[2025-06-06 05:56:51] [INFO ] Flatten gal took : 206 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4851916044607327012.txt' '-o' '/tmp/graph4851916044607327012.bin' '-w' '/tmp/graph4851916044607327012.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4851916044607327012.bin' '-l' '-1' '-v' '-w' '/tmp/graph4851916044607327012.weights' '-q' '0' '-e' '0.001'
[2025-06-06 05:56:51] [INFO ] Decomposing Gal with order
[2025-06-06 05:56:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 05:56:52] [INFO ] Removed a total of 17886 redundant transitions.
[2025-06-06 05:56:52] [INFO ] Flatten gal took : 364 ms
[2025-06-06 05:56:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 1238 labels/synchronizations in 213 ms.
[2025-06-06 05:56:52] [INFO ] Time to serialize gal into /tmp/UpperBounds2885646570557696848.gal : 25 ms
[2025-06-06 05:56:52] [INFO ] Time to serialize properties into /tmp/UpperBounds1301805037397550101.prop : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2885646570557696848.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1301805037397550101.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds1301805037397550101.prop.
BK_STOP 1749189764058
--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="Szymanski-PT-b12"
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-5832"
echo " Executing tool itstools"
echo " Input is Szymanski-PT-b12, 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 r240-tall-174915589300173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b12.tgz
mv Szymanski-PT-b12 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;