Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r139-smll-174876533200039.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 gold2024
Input is MultiCrashLeafsetExtension-PT-S16C05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-174876533200039
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.1M
-rw-r--r-- 1 mcc users 16K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 4.6M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748896669130

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 20:37:51] [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-02 20:37:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:37:52] [INFO ] Load time of PNML (sax parser for PT used): 992 ms
[2025-06-02 20:37:52] [INFO ] Transformed 4914 places.
[2025-06-02 20:37:52] [INFO ] Transformed 6913 transitions.
[2025-06-02 20:37:52] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 1310 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 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, +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, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 20:37:53] [INFO ] Flow matrix only has 6641 transitions (discarded 272 similar events)
// Phase 1: matrix 6641 rows 4914 cols
[2025-06-02 20:37:53] [INFO ] Computed 535 invariants in 572 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[17, 17, 17, 51, 1, 17, 1, 51, 51, 17, 17, 17, 17, 51, 51, 17]
RANDOM walk for 10000 steps (192 resets) in 186 ms. (53 steps per ms)
BEST_FIRST walk for 160013 steps (800 resets) in 698 ms. (228 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1] Max Struct:[17, 17, 17, 51, 1, 17, 1, 51, 51, 17, 17, 17, 17, 51, 51, 17]
[2025-06-02 20:37:54] [INFO ] Flow matrix only has 6641 transitions (discarded 272 similar events)
[2025-06-02 20:37:54] [INFO ] Invariant cache hit.
[2025-06-02 20:37:56] [INFO ] [Real]Absence check using 48 positive place invariants in 154 ms returned sat
[2025-06-02 20:37:57] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 128 ms returned unsat
[2025-06-02 20:37:58] [INFO ] [Real]Absence check using 48 positive place invariants in 94 ms returned sat
[2025-06-02 20:37:58] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 64 ms returned unsat
[2025-06-02 20:37:59] [INFO ] [Real]Absence check using 48 positive place invariants in 100 ms returned sat
[2025-06-02 20:37:59] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 69 ms returned unsat
[2025-06-02 20:38:00] [INFO ] [Real]Absence check using 48 positive place invariants in 98 ms returned sat
[2025-06-02 20:38:00] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 260 ms returned unsat
[2025-06-02 20:38:01] [INFO ] [Real]Absence check using 48 positive place invariants in 106 ms returned sat
[2025-06-02 20:38:02] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 297 ms returned sat
[2025-06-02 20:38:05] [INFO ] [Real]Absence check using state equation in 3553 ms returned sat
[2025-06-02 20:38:05] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2025-06-02 20:38:05] [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 4
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-02 20:38:06] [INFO ] [Real]Absence check using 48 positive place invariants in 97 ms returned sat
[2025-06-02 20:38:07] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 84 ms returned unsat
[2025-06-02 20:38:08] [INFO ] [Real]Absence check using 48 positive place invariants in 110 ms returned sat
[2025-06-02 20:38:08] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 293 ms returned sat
[2025-06-02 20:38:12] [INFO ] [Real]Absence check using state equation in 3606 ms returned unknown
[2025-06-02 20:38:13] [INFO ] [Real]Absence check using 48 positive place invariants in 94 ms returned sat
[2025-06-02 20:38:13] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 219 ms returned unsat
[2025-06-02 20:38:14] [INFO ] [Real]Absence check using 48 positive place invariants in 99 ms returned sat
[2025-06-02 20:38:14] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 281 ms returned sat
[2025-06-02 20:38:18] [INFO ] [Real]Absence check using state equation in 3813 ms returned unknown
[2025-06-02 20:38:19] [INFO ] [Real]Absence check using 48 positive place invariants in 93 ms returned sat
[2025-06-02 20:38:19] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 68 ms returned unsat
[2025-06-02 20:38:20] [INFO ] [Real]Absence check using 48 positive place invariants in 88 ms returned sat
[2025-06-02 20:38:20] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 86 ms returned unsat
[2025-06-02 20:38:21] [INFO ] [Real]Absence check using 48 positive place invariants in 90 ms returned sat
[2025-06-02 20:38:21] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 69 ms returned unsat
[2025-06-02 20:38:22] [INFO ] [Real]Absence check using 48 positive place invariants in 102 ms returned sat
[2025-06-02 20:38:22] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 285 ms returned sat
[2025-06-02 20:38:26] [INFO ] [Real]Absence check using state equation in 3683 ms returned unknown
[2025-06-02 20:38:27] [INFO ] [Real]Absence check using 48 positive place invariants in 90 ms returned sat
[2025-06-02 20:38:27] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 258 ms returned sat
[2025-06-02 20:38:31] [INFO ] [Real]Absence check using state equation in 3909 ms returned unknown
[2025-06-02 20:38:32] [INFO ] [Real]Absence check using 48 positive place invariants in 89 ms returned sat
[2025-06-02 20:38:32] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 119 ms returned unsat
[2025-06-02 20:38:33] [INFO ] [Real]Absence check using 48 positive place invariants in 93 ms returned sat
[2025-06-02 20:38:33] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 63 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 51, 1, 1, 1, 17, 51, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 51, 17, 51]
Support contains 5 out of 4914 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Graph (complete) has 15675 edges and 4914 vertex of which 4884 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.28 ms
Discarding 30 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1357 transitions
Trivial Post-agglo rules discarded 1357 transitions
Performed 1357 trivial Post agglomeration. Transition count delta: 1357
Iterating post reduction 0 with 1357 rules applied. Total rules applied 1358 place count 4884 transition count 5556
Reduce places removed 1357 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1359 rules applied. Total rules applied 2717 place count 3527 transition count 5554
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2719 place count 3525 transition count 5554
Performed 170 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 170 Pre rules applied. Total rules applied 2719 place count 3525 transition count 5384
Deduced a syphon composed of 170 places in 8 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 3 with 340 rules applied. Total rules applied 3059 place count 3355 transition count 5384
Discarding 1187 places :
Symmetric choice reduction at 3 with 1187 rule applications. Total rules 4246 place count 2168 transition count 4197
Iterating global reduction 3 with 1187 rules applied. Total rules applied 5433 place count 2168 transition count 4197
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 5433 place count 2168 transition count 4189
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 5449 place count 2160 transition count 4189
Discarding 235 places :
Symmetric choice reduction at 3 with 235 rule applications. Total rules 5684 place count 1925 transition count 3014
Iterating global reduction 3 with 235 rules applied. Total rules applied 5919 place count 1925 transition count 3014
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 5953 place count 1908 transition count 2997
Free-agglomeration rule (complex) applied 163 times.
Iterating global reduction 3 with 163 rules applied. Total rules applied 6116 place count 1908 transition count 3774
Reduce places removed 163 places and 0 transitions.
Iterating post reduction 3 with 163 rules applied. Total rules applied 6279 place count 1745 transition count 3774
Partial Free-agglomeration rule applied 34 times.
Drop transitions (Partial Free agglomeration) removed 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 6313 place count 1745 transition count 3774
Applied a total of 6313 rules in 2115 ms. Remains 1745 /4914 variables (removed 3169) and now considering 3774/6913 (removed 3139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2134 ms. Remains : 1745/4914 places, 3774/6913 transitions.
[2025-06-02 20:38:35] [INFO ] Flow matrix only has 3376 transitions (discarded 398 similar events)
// Phase 1: matrix 3376 rows 1745 cols
[2025-06-02 20:38:35] [INFO ] Computed 505 invariants in 96 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 2, 1, 2]
RANDOM walk for 1000000 steps (31859 resets) in 18684 ms. (53 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000003 steps (22676 resets) in 16699 ms. (239 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 1] Max Struct:[1, 1, 2, 2]
[2025-06-02 20:39:11] [INFO ] Flow matrix only has 3376 transitions (discarded 398 similar events)
[2025-06-02 20:39:11] [INFO ] Invariant cache hit.
[2025-06-02 20:39:11] [INFO ] [Real]Absence check using 31 positive place invariants in 44 ms returned sat
[2025-06-02 20:39:11] [INFO ] [Real]Absence check using 31 positive and 474 generalized place invariants in 129 ms returned sat
[2025-06-02 20:39:13] [INFO ] [Real]Absence check using state equation in 1615 ms returned sat
[2025-06-02 20:39:13] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2025-06-02 20:39:14] [INFO ] [Real]Added 1906 Read/Feed constraints in 716 ms returned sat
[2025-06-02 20:39:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:39:14] [INFO ] [Nat]Absence check using 31 positive place invariants in 68 ms returned sat
[2025-06-02 20:39:15] [INFO ] [Nat]Absence check using 31 positive and 474 generalized place invariants in 209 ms returned sat
[2025-06-02 20:39:17] [INFO ] [Nat]Absence check using state equation in 1925 ms returned sat
[2025-06-02 20:39:19] [INFO ] [Nat]Added 1906 Read/Feed constraints in 2148 ms returned sat
[2025-06-02 20:39:22] [INFO ] Deduced a trap composed of 348 places in 3288 ms of which 244 ms to minimize.
[2025-06-02 20:39:26] [INFO ] Deduced a trap composed of 150 places in 3489 ms of which 18 ms to minimize.
[2025-06-02 20:39:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 7332 ms
[2025-06-02 20:39:27] [INFO ] Computed and/alt/rep : 1578/3619/1578 causal constraints (skipped 1781 transitions) in 584 ms.
[2025-06-02 20:39:29] [INFO ] Added : 19 causal constraints over 6 iterations in 2876 ms. Result :sat
Minimization took 5235 ms.
[2025-06-02 20:39:35] [INFO ] [Real]Absence check using 31 positive place invariants in 39 ms returned sat
[2025-06-02 20:39:35] [INFO ] [Real]Absence check using 31 positive and 474 generalized place invariants in 148 ms returned sat
[2025-06-02 20:39:37] [INFO ] [Real]Absence check using state equation in 1849 ms returned sat
[2025-06-02 20:39:38] [INFO ] [Real]Added 1906 Read/Feed constraints in 920 ms returned sat
[2025-06-02 20:39:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:39:38] [INFO ] [Nat]Absence check using 31 positive place invariants in 68 ms returned sat
[2025-06-02 20:39:38] [INFO ] [Nat]Absence check using 31 positive and 474 generalized place invariants in 253 ms returned sat
[2025-06-02 20:39:40] [INFO ] [Nat]Absence check using state equation in 1585 ms returned sat
[2025-06-02 20:39:43] [INFO ] [Nat]Added 1906 Read/Feed constraints in 2874 ms returned sat
[2025-06-02 20:39:45] [INFO ] Deduced a trap composed of 344 places in 2082 ms of which 33 ms to minimize.
[2025-06-02 20:39:49] [INFO ] Deduced a trap composed of 239 places in 3448 ms of which 24 ms to minimize.
[2025-06-02 20:39:52] [INFO ] Deduced a trap composed of 200 places in 3044 ms of which 15 ms to minimize.
[2025-06-02 20:39:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 9185 ms
[2025-06-02 20:39:52] [INFO ] Computed and/alt/rep : 1578/3619/1578 causal constraints (skipped 1781 transitions) in 410 ms.
[2025-06-02 20:39:54] [INFO ] Added : 15 causal constraints over 3 iterations in 1605 ms. Result :sat
Minimization took 5090 ms.
[2025-06-02 20:39:59] [INFO ] [Real]Absence check using 31 positive place invariants in 38 ms returned sat
[2025-06-02 20:39:59] [INFO ] [Real]Absence check using 31 positive and 474 generalized place invariants in 47 ms returned unsat
[2025-06-02 20:39:59] [INFO ] [Real]Absence check using 31 positive place invariants in 43 ms returned sat
[2025-06-02 20:40:00] [INFO ] [Real]Absence check using 31 positive and 474 generalized place invariants in 69 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 1] Max Struct:[1, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 1745 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1745/1745 places, 3774/3774 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1745 transition count 3773
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1744 transition count 3773
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1744 transition count 3771
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 1742 transition count 3771
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 9 place count 1739 transition count 3768
Iterating global reduction 3 with 3 rules applied. Total rules applied 12 place count 1739 transition count 3768
Applied a total of 12 rules in 744 ms. Remains 1739 /1745 variables (removed 6) and now considering 3768/3774 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 753 ms. Remains : 1739/1745 places, 3768/3774 transitions.
[2025-06-02 20:40:00] [INFO ] Flow matrix only has 3370 transitions (discarded 398 similar events)
// Phase 1: matrix 3370 rows 1739 cols
[2025-06-02 20:40:00] [INFO ] Computed 505 invariants in 138 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (31864 resets) in 17601 ms. (56 steps per ms)
BEST_FIRST walk for 2000002 steps (11338 resets) in 7977 ms. (250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-02 20:40:26] [INFO ] Flow matrix only has 3370 transitions (discarded 398 similar events)
[2025-06-02 20:40:26] [INFO ] Invariant cache hit.
[2025-06-02 20:40:26] [INFO ] [Real]Absence check using 33 positive place invariants in 39 ms returned sat
[2025-06-02 20:40:26] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 127 ms returned sat
[2025-06-02 20:40:28] [INFO ] [Real]Absence check using state equation in 1302 ms returned sat
[2025-06-02 20:40:28] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2025-06-02 20:40:29] [INFO ] [Real]Added 1906 Read/Feed constraints in 629 ms returned sat
[2025-06-02 20:40:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:40:29] [INFO ] [Nat]Absence check using 33 positive place invariants in 40 ms returned sat
[2025-06-02 20:40:29] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 144 ms returned sat
[2025-06-02 20:40:31] [INFO ] [Nat]Absence check using state equation in 1456 ms returned sat
[2025-06-02 20:40:33] [INFO ] [Nat]Added 1906 Read/Feed constraints in 2068 ms returned sat
[2025-06-02 20:40:35] [INFO ] Deduced a trap composed of 367 places in 2395 ms of which 27 ms to minimize.
[2025-06-02 20:40:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2653 ms
[2025-06-02 20:40:36] [INFO ] Computed and/alt/rep : 1574/3612/1574 causal constraints (skipped 1779 transitions) in 283 ms.
[2025-06-02 20:40:41] [INFO ] Deduced a trap composed of 182 places in 2919 ms of which 23 ms to minimize.
[2025-06-02 20:40:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3404 ms
[2025-06-02 20:40:42] [INFO ] Added : 17 causal constraints over 5 iterations in 6632 ms. Result :sat
Minimization took 5159 ms.
[2025-06-02 20:40:47] [INFO ] [Real]Absence check using 33 positive place invariants in 39 ms returned sat
[2025-06-02 20:40:48] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 134 ms returned sat
[2025-06-02 20:40:49] [INFO ] [Real]Absence check using state equation in 1834 ms returned sat
[2025-06-02 20:40:50] [INFO ] [Real]Added 1906 Read/Feed constraints in 443 ms returned sat
[2025-06-02 20:40:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:40:51] [INFO ] [Nat]Absence check using 33 positive place invariants in 69 ms returned sat
[2025-06-02 20:40:51] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 206 ms returned sat
[2025-06-02 20:40:52] [INFO ] [Nat]Absence check using state equation in 1561 ms returned sat
[2025-06-02 20:40:55] [INFO ] [Nat]Added 1906 Read/Feed constraints in 2476 ms returned sat
[2025-06-02 20:40:55] [INFO ] Computed and/alt/rep : 1574/3612/1574 causal constraints (skipped 1779 transitions) in 372 ms.
[2025-06-02 20:41:02] [INFO ] Deduced a trap composed of 217 places in 2954 ms of which 17 ms to minimize.
[2025-06-02 20:41:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3463 ms
[2025-06-02 20:41:03] [INFO ] Added : 24 causal constraints over 6 iterations in 7621 ms. Result :sat
Minimization took 5099 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 1739 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1739/1739 places, 3768/3768 transitions.
Applied a total of 0 rules in 126 ms. Remains 1739 /1739 variables (removed 0) and now considering 3768/3768 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 1739/1739 places, 3768/3768 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1739/1739 places, 3768/3768 transitions.
Applied a total of 0 rules in 125 ms. Remains 1739 /1739 variables (removed 0) and now considering 3768/3768 (removed 0) transitions.
[2025-06-02 20:41:08] [INFO ] Flow matrix only has 3370 transitions (discarded 398 similar events)
[2025-06-02 20:41:08] [INFO ] Invariant cache hit.
[2025-06-02 20:41:14] [INFO ] Implicit Places using invariants in 6148 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 18, 24, 32, 42, 54, 68, 83, 97, 98, 99, 100, 101, 102, 114, 124, 132, 138, 142, 144, 157, 163, 165, 166, 167, 168, 169, 170, 172, 176, 182, 190, 200, 212, 225, 237, 238, 239, 240, 241, 242, 252, 260, 266, 270, 272, 274, 287, 293, 295, 296, 297, 298, 299, 300, 302, 304, 308, 314, 322, 332, 343, 353, 354, 355, 356, 357, 358, 366, 372, 376, 378, 380, 382, 395, 401, 403, 404, 405, 406, 407, 408, 410, 412, 414, 418, 424, 432, 441, 449, 450, 451, 452, 453, 454, 460, 464, 466, 468, 470, 472, 485, 491, 493, 494, 495, 496, 497, 498, 500, 502, 504, 506, 510, 516, 523, 529, 530, 531, 532, 533, 534, 538, 540, 542, 544, 546, 548, 561, 567, 569, 570, 571, 572, 573, 574, 576, 578, 580, 582, 584, 588, 593, 597, 598, 599, 600, 601, 602, 604, 606, 608, 610, 612, 614, 627, 633, 635, 636, 637, 638, 639, 640, 642, 644, 646, 648, 650, 652, 655, 657, 658, 659, 660, 661, 662, 664, 666, 668, 670, 672, 674, 687, 693, 695, 696, 697, 698, 699, 700, 702, 704, 706, 708, 710, 712, 714, 716, 717, 718, 719, 720, 721, 723, 725, 727, 729, 731, 733, 746, 748, 751, 753, 754, 755, 756, 757, 758, 760, 762, 764, 766, 768, 770, 772, 774, 775, 776, 777, 778, 779, 781, 783, 785, 787, 789, 791, 804, 810, 812, 813, 814, 815, 816, 817, 819, 821, 823, 825, 827, 829, 831, 833, 834, 835, 836, 837, 838, 840, 842, 844, 846, 848, 850, 863, 869, 871, 872, 873, 874, 875, 876, 878, 880, 882, 884, 886, 888, 890, 893, 894, 895, 896, 897, 898, 900, 902, 904, 906, 908, 910, 923, 929, 931, 932, 933, 934, 935, 936, 938, 940, 942, 944, 946, 948, 952, 957, 958, 959, 960, 961, 962, 966, 968, 970, 972, 974, 976, 989, 995, 997, 998, 999, 1000, 1001, 1002, 1004, 1006, 1008, 1010, 1012, 1016, 1022, 1029, 1030, 1031, 1032, 1033, 1034, 1040, 1044, 1046, 1048, 1050, 1052, 1065, 1071, 1073, 1074, 1075, 1076, 1077, 1078, 1080, 1082, 1084, 1086, 1090, 1096, 1104, 1113, 1114, 1115, 1116, 1117, 1118, 1126, 1132, 1136, 1138, 1140, 1142, 1155, 1161, 1163, 1164, 1165, 1166, 1167, 1168, 1170, 1172, 1174, 1178, 1184, 1192, 1202, 1213, 1214, 1215, 1216, 1217, 1218, 1228, 1236, 1242, 1246, 1248, 1250, 1263, 1269, 1271, 1272, 1273, 1274, 1275, 1276, 1278, 1280, 1284, 1290, 1298, 1308, 1320, 1333, 1334, 1335, 1336, 1337, 1338, 1350, 1360, 1368, 1374, 1378, 1380, 1393, 1395, 1398, 1400, 1401, 1402, 1403, 1404, 1405, 1407, 1411, 1417, 1425, 1435, 1447, 1461, 1476, 1477, 1478, 1479, 1480, 1481, 1495, 1507, 1517, 1525, 1531, 1535, 1548]
[2025-06-02 20:41:14] [INFO ] Actually due to overlaps returned [157, 287, 395, 485, 561, 627, 687, 746, 804, 863, 923, 989, 1065, 1155, 1263, 1393, 1548, 4, 9, 10, 11, 12, 13, 97, 98, 99, 100, 101, 165, 166, 167, 168, 169, 237, 238, 239, 240, 241, 295, 296, 297, 298, 299, 353, 354, 355, 356, 357, 403, 404, 405, 406, 407, 449, 450, 451, 452, 453, 493, 494, 495, 496, 497, 529, 530, 531, 532, 533, 569, 570, 571, 572, 573, 597, 598, 599, 600, 601, 635, 636, 637, 638, 639, 657, 658, 659, 660, 661, 695, 696, 697, 698, 699, 716, 717, 718, 719, 720, 748, 753, 754, 755, 756, 757, 774, 775, 776, 777, 778, 812, 813, 814, 815, 816, 833, 834, 835, 836, 837, 871, 872, 873, 874, 875, 893, 894, 895, 896, 897, 931, 932, 933, 934, 935, 957, 958, 959, 960, 961, 997, 998, 999, 1000, 1001, 1029, 1030, 1031, 1032, 1033, 1073, 1074, 1075, 1076, 1077, 1113, 1114, 1115, 1116, 1117, 1163, 1164, 1165, 1166, 1167, 1213, 1214, 1215, 1216, 1217, 1271, 1272, 1273, 1274, 1275, 1333, 1334, 1335, 1336, 1337, 1395, 1400, 1401, 1402, 1403, 1404, 1476, 1477, 1478, 1479, 1480]
Discarding 190 places :
Implicit Place search using SMT only with invariants took 6165 ms to find 190 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1549/1739 places, 3768/3768 transitions.
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 160 place count 1389 transition count 3608
Iterating global reduction 0 with 160 rules applied. Total rules applied 320 place count 1389 transition count 3608
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 480 place count 1229 transition count 3448
Iterating global reduction 0 with 160 rules applied. Total rules applied 640 place count 1229 transition count 3448
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 643 place count 1229 transition count 3445
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 646 place count 1226 transition count 3445
Applied a total of 646 rules in 296 ms. Remains 1226 /1549 variables (removed 323) and now considering 3445/3768 (removed 323) transitions.
[2025-06-02 20:41:14] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
// Phase 1: matrix 3047 rows 1226 cols
[2025-06-02 20:41:14] [INFO ] Computed 315 invariants in 32 ms
[2025-06-02 20:41:19] [INFO ] Implicit Places using invariants in 4691 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 77, 91, 103, 113, 121, 127, 131, 133, 150, 152, 154, 158, 164, 172, 182, 194, 207, 219, 229, 237, 243, 247, 249, 251, 259, 261, 263, 265, 269, 275, 283, 293, 304, 314, 322, 328, 332, 334, 336, 338, 346, 348, 350, 352, 354, 358, 364, 372, 381, 389, 395, 399, 401, 403, 405, 407, 415, 417, 419, 421, 423, 425, 429, 435, 442, 448, 452, 454, 456, 458, 460, 462, 470, 472, 474, 476, 478, 480, 482, 486, 491, 495, 497, 499, 501, 503, 505, 507, 515, 517, 519, 521, 523, 525, 527, 529, 532, 534, 536, 538, 540, 542, 544, 546, 554, 556, 558, 560, 562, 564, 566, 568, 570, 572, 574, 576, 578, 580, 582, 584, 590, 592, 594, 596, 598, 600, 602, 604, 606, 608, 610, 612, 614, 616, 618, 620, 627, 629, 631, 633, 635, 637, 639, 641, 643, 645, 647, 649, 651, 653, 655, 657, 665, 667, 669, 671, 673, 675, 677, 679, 681, 684, 686, 688, 690, 692, 694, 696, 704, 706, 708, 710, 712, 714, 716, 718, 722, 727, 731, 733, 735, 737, 739, 741, 749, 751, 753, 755, 757, 759, 761, 765, 771, 778, 784, 788, 790, 792, 794, 796, 804, 806, 808, 810, 812, 814, 818, 824, 832, 841, 849, 855, 859, 861, 863, 865, 873, 875, 877, 879, 881, 885, 891, 899, 909, 920, 930, 938, 944, 948, 950, 952, 960, 962, 964, 966, 970, 976, 984, 994, 1006, 1019, 1031, 1041, 1049, 1055, 1059, 1061, 1067, 1069, 1071, 1075, 1081, 1089, 1099, 1111, 1125, 1140, 1154, 1166, 1176, 1184, 1190, 1194]
Discarding 272 places :
Implicit Place search using SMT only with invariants took 4702 ms to find 272 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 954/1739 places, 3445/3768 transitions.
Applied a total of 0 rules in 99 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 11404 ms. Remains : 954/1739 places, 3445/3768 transitions.
[2025-06-02 20:41:19] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
// Phase 1: matrix 3047 rows 954 cols
[2025-06-02 20:41:19] [INFO ] Computed 43 invariants in 33 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (34074 resets) in 17431 ms. (57 steps per ms)
BEST_FIRST walk for 2000002 steps (8069 resets) in 6044 ms. (330 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-02 20:41:43] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2025-06-02 20:41:43] [INFO ] Invariant cache hit.
[2025-06-02 20:41:43] [INFO ] [Real]Absence check using 31 positive place invariants in 38 ms returned sat
[2025-06-02 20:41:43] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 6 ms returned sat
[2025-06-02 20:41:44] [INFO ] [Real]Absence check using state equation in 1149 ms returned sat
[2025-06-02 20:41:44] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2025-06-02 20:41:45] [INFO ] [Real]Added 1906 Read/Feed constraints in 948 ms returned sat
[2025-06-02 20:41:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:41:46] [INFO ] [Nat]Absence check using 31 positive place invariants in 23 ms returned sat
[2025-06-02 20:41:46] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2025-06-02 20:41:47] [INFO ] [Nat]Absence check using state equation in 1126 ms returned sat
[2025-06-02 20:41:49] [INFO ] [Nat]Added 1906 Read/Feed constraints in 1916 ms returned sat
[2025-06-02 20:41:50] [INFO ] Deduced a trap composed of 207 places in 840 ms of which 9 ms to minimize.
[2025-06-02 20:41:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1060 ms
[2025-06-02 20:41:50] [INFO ] Computed and/alt/rep : 1332/1916/1332 causal constraints (skipped 1653 transitions) in 408 ms.
[2025-06-02 20:41:51] [INFO ] Added : 14 causal constraints over 3 iterations in 1648 ms. Result :sat
Minimization took 4963 ms.
[2025-06-02 20:41:56] [INFO ] [Real]Absence check using 31 positive place invariants in 24 ms returned sat
[2025-06-02 20:41:56] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2025-06-02 20:41:58] [INFO ] [Real]Absence check using state equation in 1168 ms returned sat
[2025-06-02 20:41:58] [INFO ] [Real]Added 1906 Read/Feed constraints in 476 ms returned sat
[2025-06-02 20:41:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:41:59] [INFO ] [Nat]Absence check using 31 positive place invariants in 35 ms returned sat
[2025-06-02 20:41:59] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 6 ms returned sat
[2025-06-02 20:42:00] [INFO ] [Nat]Absence check using state equation in 1135 ms returned sat
[2025-06-02 20:42:02] [INFO ] [Nat]Added 1906 Read/Feed constraints in 2077 ms returned sat
[2025-06-02 20:42:03] [INFO ] Deduced a trap composed of 73 places in 1363 ms of which 13 ms to minimize.
[2025-06-02 20:42:05] [INFO ] Deduced a trap composed of 167 places in 1258 ms of which 13 ms to minimize.
[2025-06-02 20:42:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3012 ms
[2025-06-02 20:42:05] [INFO ] Computed and/alt/rep : 1332/1916/1332 causal constraints (skipped 1653 transitions) in 389 ms.
[2025-06-02 20:42:07] [INFO ] Added : 18 causal constraints over 5 iterations in 2275 ms. Result :sat
Minimization took 5369 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 135 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 954/954 places, 3445/3445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 102 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
[2025-06-02 20:42:13] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2025-06-02 20:42:13] [INFO ] Invariant cache hit.
[2025-06-02 20:42:15] [INFO ] Implicit Places using invariants in 2630 ms returned []
[2025-06-02 20:42:15] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2025-06-02 20:42:15] [INFO ] Invariant cache hit.
[2025-06-02 20:42:17] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2025-06-02 20:42:48] [INFO ] Performed 583/954 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 20:43:10] [INFO ] Implicit Places using invariants and state equation in 54614 ms returned []
Implicit Place search using SMT with State Equation took 57257 ms to find 0 implicit places.
[2025-06-02 20:43:10] [INFO ] Redundant transitions in 306 ms returned []
Running 3383 sub problems to find dead transitions.
[2025-06-02 20:43:10] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2025-06-02 20:43:10] [INFO ] Invariant cache hit.
[2025-06-02 20:43:11] [INFO ] State equation strengthened by 1906 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/952 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3383 unsolved
SMT process timed out in 54013ms, After SMT, problems are : Problem set: 0 solved, 3383 unsolved
Search for dead transitions found 0 dead transitions in 54086ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111816 ms. Remains : 954/954 places, 3445/3445 transitions.
RANDOM walk for 40000 steps (1362 resets) in 2658 ms. (15 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (161 resets) in 333 ms. (119 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (161 resets) in 404 ms. (98 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (162 resets) in 663 ms. (60 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (160 resets) in 673 ms. (59 steps per ms) remains 4/4 properties
[2025-06-02 20:44:06] [INFO ] Flatten gal took : 854 ms
[2025-06-02 20:44:06] [INFO ] Flatten gal took : 322 ms
[2025-06-02 20:44:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1790072305921359626.gal : 151 ms
[2025-06-02 20:44:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13172193674081563976.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1790072305921359626.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13172193674081563976.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13172193674081563976.prop.
Interrupted probabilistic random walk after 46833 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :0 out of 4
Probabilistic random walk after 46833 steps, saw 19636 distinct states, run finished after 3005 ms. (steps per millisecond=15 ) properties seen :0
[2025-06-02 20:44:09] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2025-06-02 20:44:09] [INFO ] Invariant cache hit.
[2025-06-02 20:44:09] [INFO ] State equation strengthened by 1906 read => feed constraints.
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) 868/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 20:44:10] [INFO ] Deduced a trap composed of 75 places in 877 ms of which 9 ms to minimize.
[2025-06-02 20:44:11] [INFO ] Deduced a trap composed of 165 places in 911 ms of which 8 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :27 after 29
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :29 after 37
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :37 after 72
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :72 after 74
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :74 after 148
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :148 after 151
[2025-06-02 20:44:12] [INFO ] Deduced a trap composed of 239 places in 888 ms of which 10 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :151 after 282
[2025-06-02 20:44:13] [INFO ] Deduced a trap composed of 209 places in 823 ms of which 8 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :282 after 430
[2025-06-02 20:44:14] [INFO ] Deduced a trap composed of 179 places in 824 ms of which 9 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :430 after 696
[2025-06-02 20:44:15] [INFO ] Deduced a trap composed of 167 places in 847 ms of which 8 ms to minimize.
SMT process timed out in 5878ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 101 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 954/954 places, 3445/3445 transitions.
RANDOM walk for 40000 steps (1361 resets) in 2569 ms. (15 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (160 resets) in 456 ms. (87 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (163 resets) in 413 ms. (96 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (161 resets) in 435 ms. (91 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (159 resets) in 694 ms. (57 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :696 after 1208
Interrupted probabilistic random walk after 48846 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :0 out of 4
Probabilistic random walk after 48846 steps, saw 20460 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
[2025-06-02 20:44:19] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2025-06-02 20:44:19] [INFO ] Invariant cache hit.
[2025-06-02 20:44:19] [INFO ] State equation strengthened by 1906 read => feed constraints.
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) 868/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 20:44:21] [INFO ] Deduced a trap composed of 75 places in 897 ms of which 8 ms to minimize.
[2025-06-02 20:44:22] [INFO ] Deduced a trap composed of 165 places in 793 ms of which 8 ms to minimize.
[2025-06-02 20:44:23] [INFO ] Deduced a trap composed of 239 places in 927 ms of which 8 ms to minimize.
[2025-06-02 20:44:24] [INFO ] Deduced a trap composed of 209 places in 941 ms of which 8 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1208 after 2256
[2025-06-02 20:44:25] [INFO ] Deduced a trap composed of 179 places in 1046 ms of which 12 ms to minimize.
[2025-06-02 20:44:26] [INFO ] Deduced a trap composed of 167 places in 1098 ms of which 8 ms to minimize.
[2025-06-02 20:44:27] [INFO ] Deduced a trap composed of 107 places in 952 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/916 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/916 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 28/944 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/944 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 10/954 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/954 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 3047/4001 variables, 954/1004 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4001 variables, 1906/2910 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4001 variables, 0/2910 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/4001 variables, 0/2910 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4001/4001 variables, and 2910 constraints, problems are : Problem set: 0 solved, 4 unsolved in 11284 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 954/954 constraints, ReadFeed: 1906/1906 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
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) 868/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 20:44:32] [INFO ] Deduced a trap composed of 139 places in 1154 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/888 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 28/916 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 20:44:34] [INFO ] Deduced a trap composed of 5 places in 1090 ms of which 9 ms to minimize.
[2025-06-02 20:44:35] [INFO ] Deduced a trap composed of 27 places in 1059 ms of which 9 ms to minimize.
[2025-06-02 20:44:36] [INFO ] Deduced a trap composed of 46 places in 1382 ms of which 13 ms to minimize.
[2025-06-02 20:44:38] [INFO ] Deduced a trap composed of 140 places in 1374 ms of which 14 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :2256 after 5133
[2025-06-02 20:44:39] [INFO ] Deduced a trap composed of 62 places in 1372 ms of which 14 ms to minimize.
[2025-06-02 20:44:40] [INFO ] Deduced a trap composed of 137 places in 1379 ms of which 14 ms to minimize.
[2025-06-02 20:44:42] [INFO ] Deduced a trap composed of 145 places in 1420 ms of which 14 ms to minimize.
[2025-06-02 20:44:43] [INFO ] Deduced a trap composed of 75 places in 1273 ms of which 8 ms to minimize.
[2025-06-02 20:44:44] [INFO ] Deduced a trap composed of 85 places in 1229 ms of which 15 ms to minimize.
[2025-06-02 20:44:46] [INFO ] Deduced a trap composed of 158 places in 1411 ms of which 19 ms to minimize.
[2025-06-02 20:44:47] [INFO ] Deduced a trap composed of 113 places in 1410 ms of which 13 ms to minimize.
[2025-06-02 20:44:48] [INFO ] Deduced a trap composed of 181 places in 934 ms of which 10 ms to minimize.
[2025-06-02 20:44:50] [INFO ] Deduced a trap composed of 108 places in 1310 ms of which 13 ms to minimize.
[2025-06-02 20:44:51] [INFO ] Deduced a trap composed of 95 places in 1177 ms of which 12 ms to minimize.
[2025-06-02 20:44:52] [INFO ] Deduced a trap composed of 101 places in 1114 ms of which 11 ms to minimize.
[2025-06-02 20:44:53] [INFO ] Deduced a trap composed of 62 places in 1102 ms of which 11 ms to minimize.
[2025-06-02 20:44:54] [INFO ] Deduced a trap composed of 172 places in 1054 ms of which 10 ms to minimize.
[2025-06-02 20:44:55] [INFO ] Deduced a trap composed of 172 places in 876 ms of which 9 ms to minimize.
[2025-06-02 20:44:56] [INFO ] Deduced a trap composed of 151 places in 1010 ms of which 8 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 20:44:57] [INFO ] Flatten gal took : 253 ms
[2025-06-02 20:44:57] [INFO ] Applying decomposition
[2025-06-02 20:44:57] [INFO ] Deduced a trap composed of 82 places in 971 ms of which 9 ms to minimize.
[2025-06-02 20:44:57] [INFO ] Flatten gal took : 237 ms
At refinement iteration 8 (INCLUDED_ONLY) 0/916 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2516278438766427480.txt' '-o' '/tmp/graph2516278438766427480.bin' '-w' '/tmp/graph2516278438766427480.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2516278438766427480.bin' '-l' '-1' '-v' '-w' '/tmp/graph2516278438766427480.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:44:58] [INFO ] Decomposing Gal with order
[2025-06-02 20:44:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:44:59] [INFO ] Deduced a trap composed of 46 places in 1320 ms of which 10 ms to minimize.
[2025-06-02 20:44:59] [INFO ] Deduced a trap composed of 71 places in 749 ms of which 8 ms to minimize.
[2025-06-02 20:45:00] [INFO ] Removed a total of 5791 redundant transitions.
[2025-06-02 20:45:00] [INFO ] Deduced a trap composed of 75 places in 730 ms of which 9 ms to minimize.
[2025-06-02 20:45:00] [INFO ] Flatten gal took : 1586 ms
[2025-06-02 20:45:01] [INFO ] Deduced a trap composed of 97 places in 717 ms of which 9 ms to minimize.
[2025-06-02 20:45:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 3108 labels/synchronizations in 372 ms.
[2025-06-02 20:45:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10884348465017810073.gal : 50 ms
[2025-06-02 20:45:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17259010311957646573.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10884348465017810073.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17259010311957646573.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality17259010311957646573.prop.
[2025-06-02 20:45:02] [INFO ] Deduced a trap composed of 75 places in 819 ms of which 8 ms to minimize.
[2025-06-02 20:45:03] [INFO ] Deduced a trap composed of 27 places in 823 ms of which 9 ms to minimize.
[2025-06-02 20:45:03] [INFO ] Deduced a trap composed of 57 places in 853 ms of which 8 ms to minimize.
[2025-06-02 20:45:04] [INFO ] Deduced a trap composed of 133 places in 856 ms of which 9 ms to minimize.
[2025-06-02 20:45:05] [INFO ] Deduced a trap composed of 175 places in 896 ms of which 9 ms to minimize.
[2025-06-02 20:45:06] [INFO ] Deduced a trap composed of 186 places in 925 ms of which 8 ms to minimize.
[2025-06-02 20:45:07] [INFO ] Deduced a trap composed of 125 places in 883 ms of which 20 ms to minimize.
[2025-06-02 20:45:08] [INFO ] Deduced a trap composed of 104 places in 895 ms of which 9 ms to minimize.
[2025-06-02 20:45:09] [INFO ] Deduced a trap composed of 46 places in 869 ms of which 9 ms to minimize.
[2025-06-02 20:45:10] [INFO ] Deduced a trap composed of 88 places in 904 ms of which 9 ms to minimize.
[2025-06-02 20:45:11] [INFO ] Deduced a trap composed of 90 places in 885 ms of which 8 ms to minimize.
[2025-06-02 20:45:12] [INFO ] Deduced a trap composed of 117 places in 900 ms of which 8 ms to minimize.
[2025-06-02 20:45:13] [INFO ] Deduced a trap composed of 75 places in 919 ms of which 9 ms to minimize.
[2025-06-02 20:45:14] [INFO ] Deduced a trap composed of 125 places in 914 ms of which 9 ms to minimize.
[2025-06-02 20:45:15] [INFO ] Deduced a trap composed of 124 places in 918 ms of which 9 ms to minimize.
[2025-06-02 20:45:16] [INFO ] Deduced a trap composed of 138 places in 909 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/916 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 20:45:17] [INFO ] Deduced a trap composed of 62 places in 1027 ms of which 31 ms to minimize.
SMT process timed out in 57203ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 141 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 954/954 places, 3445/3445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 99 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
[2025-06-02 20:45:17] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2025-06-02 20:45:17] [INFO ] Invariant cache hit.
[2025-06-02 20:45:19] [INFO ] Implicit Places using invariants in 2428 ms returned []
[2025-06-02 20:45:19] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2025-06-02 20:45:19] [INFO ] Invariant cache hit.
[2025-06-02 20:45:20] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2025-06-02 20:45:51] [INFO ] Performed 559/954 implicitness test of which 0 returned IMPLICIT in 30 seconds.
Detected timeout of ITS tools.
[2025-06-02 20:46:13] [INFO ] Implicit Places using invariants and state equation in 53308 ms returned []
Implicit Place search using SMT with State Equation took 55737 ms to find 0 implicit places.
[2025-06-02 20:46:13] [INFO ] Redundant transitions in 242 ms returned []
Running 3383 sub problems to find dead transitions.
[2025-06-02 20:46:13] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2025-06-02 20:46:13] [INFO ] Invariant cache hit.
[2025-06-02 20:46:13] [INFO ] State equation strengthened by 1906 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 0.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 0.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 0.0)
(s501 0.0)
(s502 1.0)
(s503 0.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 0.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 0.0)
(s524 0.0)
(s525 1.0)
(s526 0.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 0.0)
(s537 0.0)
(s538 1.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 0.0)
(s553 0.0)
(s554 1.0)
(s555 0.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 0.0)
(s565 0.0)
(s566 1.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 1.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 1.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 1.0)
(s583 0.0)
(s584 0.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 0.0)
(s592 0.0)
(s593 1.0)
(s594 0.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 0.0)
(s603 0.0)
(s604 1.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 1.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 1.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 1.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 1.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 1.0)
(s637 0.0)
(s638 0.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 0.0)
(s645 0.0)
(s646 1.0)
(s647 0.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 0.0)
(s655 0.0)
(s656 1.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 1.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 1.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 1.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 1.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 1.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 1.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 1.0)
(s709 0.0)
(s710 0.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 0.0)
(s716 0.0)
(s717 1.0)
(s718 0.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 0.0)
(s725 0.0)
(s726 1.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 1.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 1.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 1.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 1.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 1.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 1.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 1.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 1.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 1.0)
(s803 0.0)
(s804 0.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 0.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 0.0)
(s815 0.0)
(s816 1.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 1.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 1.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 1.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 1.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 1.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 1.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 1.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 1.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 1.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 1.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 1.0)
(s921 0.0)
(s922 0.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/952 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3383 unsolved
SMT process timed out in 53058ms, After SMT, problems are : Problem set: 0 solved, 3383 unsolved
Search for dead transitions found 0 dead transitions in 53143ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109274 ms. Remains : 954/954 places, 3445/3445 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[1, 1]
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C05-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-02 20:47:06] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2025-06-02 20:47:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (340 resets) in 283 ms. (35 steps per ms)
BEST_FIRST walk for 10001 steps (40 resets) in 51 ms. (192 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 20:47:06] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2025-06-02 20:47:06] [INFO ] Invariant cache hit.
[2025-06-02 20:47:07] [INFO ] [Real]Absence check using 31 positive place invariants in 38 ms returned sat
[2025-06-02 20:47:07] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 10 ms returned sat
[2025-06-02 20:47:08] [INFO ] [Real]Absence check using state equation in 1335 ms returned sat
[2025-06-02 20:47:08] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2025-06-02 20:47:09] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 20:47:09] [INFO ] [Real]Added 1906 Read/Feed constraints in 755 ms returned sat
[2025-06-02 20:47:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:47:09] [INFO ] [Nat]Absence check using 31 positive place invariants in 39 ms returned sat
[2025-06-02 20:47:09] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 7 ms returned sat
[2025-06-02 20:47:10] [INFO ] [Nat]Absence check using state equation in 1038 ms returned sat
[2025-06-02 20:47:11] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 20:47:11] [INFO ] [Nat]Added 1906 Read/Feed constraints in 1202 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 954 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node3ThinksNode11ShouldBeNodeMasterToReplaceNode9) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3443/3443 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 3441
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 952 transition count 3439
Applied a total of 2 rules in 191 ms. Remains 952 /954 variables (removed 2) and now considering 3439/3443 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 952/954 places, 3439/3443 transitions.
[2025-06-02 20:47:12] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
// Phase 1: matrix 3041 rows 952 cols
[2025-06-02 20:47:12] [INFO ] Computed 43 invariants in 47 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (34069 resets) in 17292 ms. (57 steps per ms)
BEST_FIRST walk for 1000001 steps (4044 resets) in 2872 ms. (348 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 20:47:32] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-02 20:47:32] [INFO ] Invariant cache hit.
[2025-06-02 20:47:32] [INFO ] [Real]Absence check using 31 positive place invariants in 37 ms returned sat
[2025-06-02 20:47:32] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 8 ms returned sat
[2025-06-02 20:47:34] [INFO ] [Real]Absence check using state equation in 1375 ms returned sat
[2025-06-02 20:47:34] [INFO ] State equation strengthened by 1903 read => feed constraints.
[2025-06-02 20:47:35] [INFO ] [Real]Added 1903 Read/Feed constraints in 907 ms returned sat
[2025-06-02 20:47:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:47:35] [INFO ] [Nat]Absence check using 31 positive place invariants in 25 ms returned sat
[2025-06-02 20:47:35] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2025-06-02 20:47:36] [INFO ] [Nat]Absence check using state equation in 1096 ms returned sat
[2025-06-02 20:47:38] [INFO ] [Nat]Added 1903 Read/Feed constraints in 2404 ms returned sat
[2025-06-02 20:47:39] [INFO ] Computed and/alt/rep : 1326/1907/1326 causal constraints (skipped 1653 transitions) in 252 ms.
[2025-06-02 20:47:42] [INFO ] Deduced a trap composed of 201 places in 1223 ms of which 13 ms to minimize.
[2025-06-02 20:47:43] [INFO ] Deduced a trap composed of 71 places in 1168 ms of which 8 ms to minimize.
[2025-06-02 20:47:44] [INFO ] Deduced a trap composed of 70 places in 1384 ms of which 13 ms to minimize.
[2025-06-02 20:47:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4317 ms
[2025-06-02 20:47:45] [INFO ] Added : 22 causal constraints over 7 iterations in 6334 ms. Result :sat
Minimization took 5506 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 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 100 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 952/952 places, 3439/3439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 96 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
[2025-06-02 20:47:51] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-02 20:47:51] [INFO ] Invariant cache hit.
[2025-06-02 20:47:53] [INFO ] Implicit Places using invariants in 2351 ms returned []
[2025-06-02 20:47:53] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-02 20:47:53] [INFO ] Invariant cache hit.
[2025-06-02 20:47:54] [INFO ] State equation strengthened by 1903 read => feed constraints.
[2025-06-02 20:48:25] [INFO ] Performed 622/952 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 20:48:38] [INFO ] Implicit Places using invariants and state equation in 45212 ms returned []
Implicit Place search using SMT with State Equation took 47565 ms to find 0 implicit places.
[2025-06-02 20:48:38] [INFO ] Redundant transitions in 331 ms returned []
Running 3377 sub problems to find dead transitions.
[2025-06-02 20:48:38] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-02 20:48:38] [INFO ] Invariant cache hit.
[2025-06-02 20:48:39] [INFO ] State equation strengthened by 1903 read => feed constraints.
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/949 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3377 unsolved
SMT process timed out in 53624ms, After SMT, problems are : Problem set: 0 solved, 3377 unsolved
Search for dead transitions found 0 dead transitions in 53666ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101679 ms. Remains : 952/952 places, 3439/3439 transitions.
[2025-06-02 20:49:32] [INFO ] Flatten gal took : 221 ms
RANDOM walk for 40000 steps (1362 resets) in 1460 ms. (27 steps per ms) remains 2/2 properties
[2025-06-02 20:49:33] [INFO ] Flatten gal took : 299 ms
BEST_FIRST walk for 40004 steps (160 resets) in 354 ms. (112 steps per ms) remains 2/2 properties
[2025-06-02 20:49:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6251966957979837669.gal : 64 ms
[2025-06-02 20:49:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11669655162793230638.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6251966957979837669.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11669655162793230638.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (161 resets) in 370 ms. (107 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality11669655162793230638.prop.
Interrupted probabilistic random walk after 56106 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 2
Probabilistic random walk after 56106 steps, saw 23468 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
[2025-06-02 20:49:36] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-02 20:49:36] [INFO ] Invariant cache hit.
[2025-06-02 20:49:36] [INFO ] State equation strengthened by 1903 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 20:49:37] [INFO ] Deduced a trap composed of 181 places in 843 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/914 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/914 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/942 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/942 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/952 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 29
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :29 after 37
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :37 after 71
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :71 after 72
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :72 after 74
At refinement iteration 12 (OVERLAPS) 3041/3993 variables, 952/996 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :74 after 148
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :148 after 151
At refinement iteration 13 (INCLUDED_ONLY) 0/3993 variables, 1903/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3993 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3993 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3993/3993 variables, and 2899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3052 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 952/952 constraints, ReadFeed: 1903/1903 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :151 after 282
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :282 after 430
[2025-06-02 20:49:40] [INFO ] Deduced a trap composed of 80 places in 908 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/914 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 20:49:41] [INFO ] Deduced a trap composed of 5 places in 833 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :430 after 712
[2025-06-02 20:49:42] [INFO ] Deduced a trap composed of 27 places in 850 ms of which 8 ms to minimize.
[2025-06-02 20:49:43] [INFO ] Deduced a trap composed of 27 places in 846 ms of which 9 ms to minimize.
[2025-06-02 20:49:44] [INFO ] Deduced a trap composed of 57 places in 839 ms of which 8 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :712 after 1212
[2025-06-02 20:49:44] [INFO ] Deduced a trap composed of 46 places in 837 ms of which 8 ms to minimize.
SMT process timed out in 8690ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 96 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 952/952 places, 3439/3439 transitions.
RANDOM walk for 40000 steps (1362 resets) in 2172 ms. (18 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (161 resets) in 366 ms. (109 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (160 resets) in 332 ms. (120 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 55058 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 2
Probabilistic random walk after 55058 steps, saw 23038 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
[2025-06-02 20:49:48] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-02 20:49:48] [INFO ] Invariant cache hit.
[2025-06-02 20:49:48] [INFO ] State equation strengthened by 1903 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 20:49:50] [INFO ] Deduced a trap composed of 181 places in 832 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/914 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/914 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/942 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/942 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/952 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1212 after 2206
At refinement iteration 12 (OVERLAPS) 3041/3993 variables, 952/996 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3993 variables, 1903/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3993 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3993 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3993/3993 variables, and 2899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2949 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 952/952 constraints, ReadFeed: 1903/1903 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 20:49:53] [INFO ] Deduced a trap composed of 80 places in 877 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/914 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 20:49:53] [INFO ] Deduced a trap composed of 5 places in 812 ms of which 9 ms to minimize.
[2025-06-02 20:49:54] [INFO ] Deduced a trap composed of 27 places in 841 ms of which 8 ms to minimize.
[2025-06-02 20:49:55] [INFO ] Deduced a trap composed of 27 places in 886 ms of which 8 ms to minimize.
[2025-06-02 20:49:56] [INFO ] Deduced a trap composed of 57 places in 871 ms of which 8 ms to minimize.
[2025-06-02 20:49:57] [INFO ] Deduced a trap composed of 46 places in 859 ms of which 8 ms to minimize.
[2025-06-02 20:49:58] [INFO ] Deduced a trap composed of 62 places in 862 ms of which 8 ms to minimize.
[2025-06-02 20:49:59] [INFO ] Deduced a trap composed of 143 places in 1015 ms of which 9 ms to minimize.
[2025-06-02 20:50:00] [INFO ] Deduced a trap composed of 75 places in 1106 ms of which 13 ms to minimize.
[2025-06-02 20:50:01] [INFO ] Deduced a trap composed of 163 places in 998 ms of which 9 ms to minimize.
[2025-06-02 20:50:02] [INFO ] Deduced a trap composed of 152 places in 1014 ms of which 8 ms to minimize.
[2025-06-02 20:50:03] [INFO ] Deduced a trap composed of 161 places in 1003 ms of which 8 ms to minimize.
[2025-06-02 20:50:04] [INFO ] Deduced a trap composed of 85 places in 888 ms of which 8 ms to minimize.
[2025-06-02 20:50:05] [INFO ] Deduced a trap composed of 92 places in 866 ms of which 8 ms to minimize.
[2025-06-02 20:50:06] [INFO ] Deduced a trap composed of 173 places in 805 ms of which 8 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2206 after 5102
[2025-06-02 20:50:07] [INFO ] Deduced a trap composed of 176 places in 789 ms of which 8 ms to minimize.
[2025-06-02 20:50:07] [INFO ] Deduced a trap composed of 113 places in 789 ms of which 8 ms to minimize.
[2025-06-02 20:50:08] [INFO ] Deduced a trap composed of 101 places in 793 ms of which 8 ms to minimize.
[2025-06-02 20:50:09] [INFO ] Deduced a trap composed of 201 places in 810 ms of which 9 ms to minimize.
[2025-06-02 20:50:10] [INFO ] Deduced a trap composed of 90 places in 819 ms of which 8 ms to minimize.
[2025-06-02 20:50:11] [INFO ] Deduced a trap composed of 92 places in 798 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/914 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 20:50:11] [INFO ] Deduced a trap composed of 115 places in 806 ms of which 8 ms to minimize.
[2025-06-02 20:50:12] [INFO ] Deduced a trap composed of 183 places in 786 ms of which 8 ms to minimize.
[2025-06-02 20:50:13] [INFO ] Deduced a trap composed of 118 places in 774 ms of which 8 ms to minimize.
[2025-06-02 20:50:14] [INFO ] Deduced a trap composed of 94 places in 826 ms of which 8 ms to minimize.
[2025-06-02 20:50:15] [INFO ] Deduced a trap composed of 115 places in 824 ms of which 18 ms to minimize.
[2025-06-02 20:50:16] [INFO ] Deduced a trap composed of 101 places in 796 ms of which 9 ms to minimize.
[2025-06-02 20:50:16] [INFO ] Deduced a trap composed of 122 places in 773 ms of which 9 ms to minimize.
[2025-06-02 20:50:17] [INFO ] Deduced a trap composed of 159 places in 811 ms of which 9 ms to minimize.
[2025-06-02 20:50:18] [INFO ] Deduced a trap composed of 160 places in 796 ms of which 8 ms to minimize.
[2025-06-02 20:50:19] [INFO ] Deduced a trap composed of 85 places in 834 ms of which 8 ms to minimize.
[2025-06-02 20:50:20] [INFO ] Deduced a trap composed of 95 places in 806 ms of which 8 ms to minimize.
[2025-06-02 20:50:21] [INFO ] Deduced a trap composed of 134 places in 836 ms of which 8 ms to minimize.
[2025-06-02 20:50:21] [INFO ] Deduced a trap composed of 82 places in 841 ms of which 9 ms to minimize.
[2025-06-02 20:50:22] [INFO ] Deduced a trap composed of 46 places in 839 ms of which 8 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 20:50:23] [INFO ] Flatten gal took : 121 ms
[2025-06-02 20:50:23] [INFO ] Applying decomposition
[2025-06-02 20:50:23] [INFO ] Flatten gal took : 130 ms
[2025-06-02 20:50:23] [INFO ] Deduced a trap composed of 62 places in 849 ms of which 12 ms to minimize.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3504701315660256955.txt' '-o' '/tmp/graph3504701315660256955.bin' '-w' '/tmp/graph3504701315660256955.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3504701315660256955.bin' '-l' '-1' '-v' '-w' '/tmp/graph3504701315660256955.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:50:23] [INFO ] Decomposing Gal with order
[2025-06-02 20:50:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:50:24] [INFO ] Deduced a trap composed of 71 places in 737 ms of which 9 ms to minimize.
[2025-06-02 20:50:24] [INFO ] Removed a total of 5785 redundant transitions.
[2025-06-02 20:50:24] [INFO ] Flatten gal took : 574 ms
[2025-06-02 20:50:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 2377 labels/synchronizations in 169 ms.
[2025-06-02 20:50:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16318870012770251259.gal : 43 ms
[2025-06-02 20:50:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8501646100502790485.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16318870012770251259.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8501646100502790485.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
[2025-06-02 20:50:25] [INFO ] Deduced a trap composed of 176 places in 741 ms of which 8 ms to minimize.
Loading property file /tmp/ReachabilityCardinality8501646100502790485.prop.
[2025-06-02 20:50:25] [INFO ] Deduced a trap composed of 97 places in 747 ms of which 9 ms to minimize.
[2025-06-02 20:50:26] [INFO ] Deduced a trap composed of 130 places in 961 ms of which 9 ms to minimize.
[2025-06-02 20:50:28] [INFO ] Deduced a trap composed of 46 places in 1251 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/914 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 20:50:29] [INFO ] Deduced a trap composed of 88 places in 974 ms of which 8 ms to minimize.
[2025-06-02 20:50:30] [INFO ] Deduced a trap composed of 123 places in 1033 ms of which 8 ms to minimize.
[2025-06-02 20:50:31] [INFO ] Deduced a trap composed of 182 places in 1042 ms of which 9 ms to minimize.
[2025-06-02 20:50:32] [INFO ] Deduced a trap composed of 165 places in 1118 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 505
[2025-06-02 20:50:33] [INFO ] Deduced a trap composed of 56 places in 1115 ms of which 12 ms to minimize.
[2025-06-02 20:50:34] [INFO ] Deduced a trap composed of 74 places in 1222 ms of which 12 ms to minimize.
[2025-06-02 20:50:36] [INFO ] Deduced a trap composed of 72 places in 1171 ms of which 10 ms to minimize.
[2025-06-02 20:50:37] [INFO ] Deduced a trap composed of 66 places in 1208 ms of which 12 ms to minimize.
SMT process timed out in 48402ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 101 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 952/952 places, 3439/3439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 125 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
[2025-06-02 20:50:37] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-02 20:50:37] [INFO ] Invariant cache hit.
[2025-06-02 20:50:39] [INFO ] Implicit Places using invariants in 2094 ms returned []
[2025-06-02 20:50:39] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-02 20:50:39] [INFO ] Invariant cache hit.
[2025-06-02 20:50:41] [INFO ] State equation strengthened by 1903 read => feed constraints.
[2025-06-02 20:51:11] [INFO ] Performed 639/952 implicitness test of which 0 returned IMPLICIT in 30 seconds.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :505 after 4279
Detected timeout of ITS tools.
[2025-06-02 20:51:23] [INFO ] Implicit Places using invariants and state equation in 44137 ms returned []
Implicit Place search using SMT with State Equation took 46234 ms to find 0 implicit places.
[2025-06-02 20:51:24] [INFO ] Redundant transitions in 197 ms returned []
Running 3377 sub problems to find dead transitions.
[2025-06-02 20:51:24] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-02 20:51:24] [INFO ] Invariant cache hit.
[2025-06-02 20:51:24] [INFO ] State equation strengthened by 1903 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 0.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 0.0)
(s436 0.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 0.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 0.0)
(s522 0.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 0.0)
(s551 0.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 0.0)
(s590 0.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 0.0)
(s643 0.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 0.0)
(s714 0.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/949 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3377 unsolved
SMT process timed out in 52801ms, After SMT, problems are : Problem set: 0 solved, 3377 unsolved
Search for dead transitions found 0 dead transitions in 52837ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99412 ms. Remains : 952/952 places, 3439/3439 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-04 in 310334 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C05-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-02 20:52:16] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
// Phase 1: matrix 3047 rows 954 cols
[2025-06-02 20:52:16] [INFO ] Computed 43 invariants in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (341 resets) in 170 ms. (58 steps per ms)
BEST_FIRST walk for 10001 steps (41 resets) in 29 ms. (333 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 20:52:17] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2025-06-02 20:52:17] [INFO ] Invariant cache hit.
[2025-06-02 20:52:17] [INFO ] [Real]Absence check using 31 positive place invariants in 37 ms returned sat
[2025-06-02 20:52:17] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2025-06-02 20:52:18] [INFO ] [Real]Absence check using state equation in 1187 ms returned sat
[2025-06-02 20:52:18] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2025-06-02 20:52:18] [INFO ] [Real]Added 1906 Read/Feed constraints in 340 ms returned sat
[2025-06-02 20:52:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:52:19] [INFO ] [Nat]Absence check using 31 positive place invariants in 29 ms returned sat
[2025-06-02 20:52:19] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2025-06-02 20:52:20] [INFO ] [Nat]Absence check using state equation in 1035 ms returned sat
[2025-06-02 20:52:20] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 20:52:21] [INFO ] [Nat]Added 1906 Read/Feed constraints in 1154 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 954 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node14ThinksNode4ShouldBeNodeMasterToReplaceNode5) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3443/3443 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 3441
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 952 transition count 3439
Applied a total of 2 rules in 106 ms. Remains 952 /954 variables (removed 2) and now considering 3439/3443 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 952/954 places, 3439/3443 transitions.
[2025-06-02 20:52:21] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
// Phase 1: matrix 3041 rows 952 cols
[2025-06-02 20:52:21] [INFO ] Computed 43 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (34082 resets) in 17303 ms. (57 steps per ms)
BEST_FIRST walk for 1000001 steps (4024 resets) in 2854 ms. (350 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 20:52:41] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-02 20:52:41] [INFO ] Invariant cache hit.
[2025-06-02 20:52:41] [INFO ] [Real]Absence check using 31 positive place invariants in 25 ms returned sat
[2025-06-02 20:52:41] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2025-06-02 20:52:43] [INFO ] [Real]Absence check using state equation in 1126 ms returned sat
[2025-06-02 20:52:43] [INFO ] State equation strengthened by 1903 read => feed constraints.
[2025-06-02 20:52:43] [INFO ] [Real]Added 1903 Read/Feed constraints in 311 ms returned sat
[2025-06-02 20:52:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:52:43] [INFO ] [Nat]Absence check using 31 positive place invariants in 26 ms returned sat
[2025-06-02 20:52:43] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 10 ms returned sat
[2025-06-02 20:52:45] [INFO ] [Nat]Absence check using state equation in 1309 ms returned sat
[2025-06-02 20:52:46] [INFO ] [Nat]Added 1903 Read/Feed constraints in 1585 ms returned sat
[2025-06-02 20:52:47] [INFO ] Deduced a trap composed of 176 places in 807 ms of which 9 ms to minimize.
[2025-06-02 20:52:48] [INFO ] Deduced a trap composed of 78 places in 1019 ms of which 9 ms to minimize.
[2025-06-02 20:52:50] [INFO ] Deduced a trap composed of 65 places in 1220 ms of which 9 ms to minimize.
[2025-06-02 20:52:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3581 ms
[2025-06-02 20:52:50] [INFO ] Computed and/alt/rep : 1326/1907/1326 causal constraints (skipped 1653 transitions) in 323 ms.
[2025-06-02 20:52:51] [INFO ] Added : 13 causal constraints over 3 iterations in 1252 ms. Result :sat
Minimization took 5475 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 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 97 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 952/952 places, 3439/3439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 162 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
[2025-06-02 20:52:57] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-02 20:52:57] [INFO ] Invariant cache hit.
[2025-06-02 20:52:59] [INFO ] Implicit Places using invariants in 2169 ms returned []
[2025-06-02 20:52:59] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-02 20:52:59] [INFO ] Invariant cache hit.
[2025-06-02 20:53:01] [INFO ] State equation strengthened by 1903 read => feed constraints.
[2025-06-02 20:53:31] [INFO ] Performed 631/952 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 20:53:44] [INFO ] Implicit Places using invariants and state equation in 44667 ms returned []
Implicit Place search using SMT with State Equation took 46842 ms to find 0 implicit places.
[2025-06-02 20:53:44] [INFO ] Redundant transitions in 198 ms returned []
Running 3377 sub problems to find dead transitions.
[2025-06-02 20:53:44] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-02 20:53:44] [INFO ] Invariant cache hit.
[2025-06-02 20:53:44] [INFO ] State equation strengthened by 1903 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/949 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3377 unsolved
SMT process timed out in 53760ms, After SMT, problems are : Problem set: 0 solved, 3377 unsolved
Search for dead transitions found 0 dead transitions in 53798ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101017 ms. Remains : 952/952 places, 3439/3439 transitions.
[2025-06-02 20:54:38] [INFO ] Flatten gal took : 110 ms
[2025-06-02 20:54:38] [INFO ] Flatten gal took : 140 ms
[2025-06-02 20:54:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12025417095565699745.gal : 45 ms
[2025-06-02 20:54:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5724974820369908498.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12025417095565699745.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5724974820369908498.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (1361 resets) in 2734 ms. (14 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (162 resets) in 288 ms. (138 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (158 resets) in 291 ms. (137 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality5724974820369908498.prop.
Interrupted probabilistic random walk after 57881 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 2
Probabilistic random walk after 57881 steps, saw 24205 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
[2025-06-02 20:54:42] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-02 20:54:42] [INFO ] Invariant cache hit.
[2025-06-02 20:54:42] [INFO ] State equation strengthened by 1903 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 20:54:43] [INFO ] Deduced a trap composed of 173 places in 933 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :31 after 37
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :37 after 38
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :38 after 72
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :72 after 74
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :74 after 148
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :148 after 151
[2025-06-02 20:54:44] [INFO ] Deduced a trap composed of 212 places in 933 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/914 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/914 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/942 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/942 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/952 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :151 after 282
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :282 after 430
At refinement iteration 12 (OVERLAPS) 3041/3993 variables, 952/997 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3993 variables, 1903/2900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3993 variables, 0/2900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3993 variables, 0/2900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3993/3993 variables, and 2900 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4096 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 952/952 constraints, ReadFeed: 1903/1903 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :430 after 700
[2025-06-02 20:54:47] [INFO ] Deduced a trap composed of 202 places in 917 ms of which 8 ms to minimize.
[2025-06-02 20:54:48] [INFO ] Deduced a trap composed of 99 places in 919 ms of which 9 ms to minimize.
[2025-06-02 20:54:49] [INFO ] Deduced a trap composed of 85 places in 933 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :700 after 1153
[2025-06-02 20:54:50] [INFO ] Deduced a trap composed of 75 places in 921 ms of which 9 ms to minimize.
[2025-06-02 20:54:51] [INFO ] Deduced a trap composed of 154 places in 925 ms of which 8 ms to minimize.
[2025-06-02 20:54:52] [INFO ] Deduced a trap composed of 85 places in 946 ms of which 8 ms to minimize.
SMT process timed out in 10023ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 98 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 952/952 places, 3439/3439 transitions.
RANDOM walk for 40000 steps (1360 resets) in 2039 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (158 resets) in 341 ms. (116 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (156 resets) in 304 ms. (131 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1153 after 2199
Interrupted probabilistic random walk after 57570 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 2
Probabilistic random walk after 57570 steps, saw 24079 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
[2025-06-02 20:54:56] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-02 20:54:56] [INFO ] Invariant cache hit.
[2025-06-02 20:54:56] [INFO ] State equation strengthened by 1903 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 20:54:57] [INFO ] Deduced a trap composed of 173 places in 899 ms of which 9 ms to minimize.
[2025-06-02 20:54:58] [INFO ] Deduced a trap composed of 212 places in 920 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/914 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/914 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/942 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/942 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/952 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3041/3993 variables, 952/997 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3993 variables, 1903/2900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3993 variables, 0/2900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3993 variables, 0/2900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3993/3993 variables, and 2900 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4066 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 952/952 constraints, ReadFeed: 1903/1903 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 20:55:01] [INFO ] Deduced a trap composed of 202 places in 898 ms of which 8 ms to minimize.
[2025-06-02 20:55:02] [INFO ] Deduced a trap composed of 99 places in 890 ms of which 9 ms to minimize.
[2025-06-02 20:55:03] [INFO ] Deduced a trap composed of 85 places in 915 ms of which 9 ms to minimize.
[2025-06-02 20:55:04] [INFO ] Deduced a trap composed of 75 places in 920 ms of which 8 ms to minimize.
[2025-06-02 20:55:05] [INFO ] Deduced a trap composed of 154 places in 923 ms of which 8 ms to minimize.
[2025-06-02 20:55:06] [INFO ] Deduced a trap composed of 85 places in 936 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/914 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 20:55:07] [INFO ] Deduced a trap composed of 5 places in 995 ms of which 9 ms to minimize.
[2025-06-02 20:55:08] [INFO ] Deduced a trap composed of 82 places in 998 ms of which 9 ms to minimize.
[2025-06-02 20:55:09] [INFO ] Deduced a trap composed of 74 places in 980 ms of which 8 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2199 after 4998
[2025-06-02 20:55:10] [INFO ] Deduced a trap composed of 73 places in 950 ms of which 9 ms to minimize.
[2025-06-02 20:55:11] [INFO ] Deduced a trap composed of 78 places in 976 ms of which 9 ms to minimize.
[2025-06-02 20:55:12] [INFO ] Deduced a trap composed of 60 places in 976 ms of which 9 ms to minimize.
[2025-06-02 20:55:13] [INFO ] Deduced a trap composed of 65 places in 966 ms of which 9 ms to minimize.
[2025-06-02 20:55:14] [INFO ] Deduced a trap composed of 78 places in 974 ms of which 9 ms to minimize.
[2025-06-02 20:55:15] [INFO ] Deduced a trap composed of 58 places in 958 ms of which 9 ms to minimize.
[2025-06-02 20:55:16] [INFO ] Deduced a trap composed of 27 places in 957 ms of which 8 ms to minimize.
[2025-06-02 20:55:17] [INFO ] Deduced a trap composed of 76 places in 968 ms of which 8 ms to minimize.
[2025-06-02 20:55:18] [INFO ] Deduced a trap composed of 68 places in 968 ms of which 8 ms to minimize.
[2025-06-02 20:55:19] [INFO ] Deduced a trap composed of 68 places in 960 ms of which 8 ms to minimize.
[2025-06-02 20:55:20] [INFO ] Deduced a trap composed of 68 places in 942 ms of which 9 ms to minimize.
[2025-06-02 20:55:21] [INFO ] Deduced a trap composed of 68 places in 965 ms of which 8 ms to minimize.
[2025-06-02 20:55:21] [INFO ] Deduced a trap composed of 62 places in 966 ms of which 9 ms to minimize.
[2025-06-02 20:55:22] [INFO ] Deduced a trap composed of 66 places in 970 ms of which 9 ms to minimize.
[2025-06-02 20:55:23] [INFO ] Deduced a trap composed of 93 places in 961 ms of which 9 ms to minimize.
[2025-06-02 20:55:24] [INFO ] Deduced a trap composed of 76 places in 978 ms of which 8 ms to minimize.
[2025-06-02 20:55:26] [INFO ] Deduced a trap composed of 68 places in 996 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/914 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 20:55:27] [INFO ] Deduced a trap composed of 46 places in 971 ms of which 9 ms to minimize.
[2025-06-02 20:55:28] [INFO ] Deduced a trap composed of 75 places in 1100 ms of which 9 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 20:55:28] [INFO ] Flatten gal took : 130 ms
[2025-06-02 20:55:28] [INFO ] Applying decomposition
[2025-06-02 20:55:28] [INFO ] Flatten gal took : 96 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18105902700172370686.txt' '-o' '/tmp/graph18105902700172370686.bin' '-w' '/tmp/graph18105902700172370686.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18105902700172370686.bin' '-l' '-1' '-v' '-w' '/tmp/graph18105902700172370686.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:55:29] [INFO ] Decomposing Gal with order
[2025-06-02 20:55:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:55:29] [INFO ] Deduced a trap composed of 80 places in 1098 ms of which 9 ms to minimize.
[2025-06-02 20:55:29] [INFO ] Removed a total of 5784 redundant transitions.
[2025-06-02 20:55:29] [INFO ] Flatten gal took : 578 ms
[2025-06-02 20:55:30] [INFO ] Deduced a trap composed of 88 places in 922 ms of which 8 ms to minimize.
[2025-06-02 20:55:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 2366 labels/synchronizations in 157 ms.
[2025-06-02 20:55:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6896771686478100006.gal : 37 ms
[2025-06-02 20:55:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17619596096899737509.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6896771686478100006.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17619596096899737509.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality17619596096899737509.prop.
[2025-06-02 20:55:31] [INFO ] Deduced a trap composed of 71 places in 842 ms of which 9 ms to minimize.
[2025-06-02 20:55:32] [INFO ] Deduced a trap composed of 158 places in 1014 ms of which 9 ms to minimize.
[2025-06-02 20:55:33] [INFO ] Deduced a trap composed of 83 places in 1011 ms of which 8 ms to minimize.
[2025-06-02 20:55:34] [INFO ] Deduced a trap composed of 62 places in 1012 ms of which 9 ms to minimize.
[2025-06-02 20:55:35] [INFO ] Deduced a trap composed of 61 places in 980 ms of which 9 ms to minimize.
[2025-06-02 20:55:36] [INFO ] Deduced a trap composed of 70 places in 1008 ms of which 9 ms to minimize.
[2025-06-02 20:55:37] [INFO ] Deduced a trap composed of 70 places in 994 ms of which 9 ms to minimize.
[2025-06-02 20:55:38] [INFO ] Deduced a trap composed of 58 places in 1000 ms of which 8 ms to minimize.
[2025-06-02 20:55:39] [INFO ] Deduced a trap composed of 76 places in 1019 ms of which 9 ms to minimize.
[2025-06-02 20:55:40] [INFO ] Deduced a trap composed of 79 places in 985 ms of which 9 ms to minimize.
[2025-06-02 20:55:41] [INFO ] Deduced a trap composed of 57 places in 1006 ms of which 9 ms to minimize.
[2025-06-02 20:55:42] [INFO ] Deduced a trap composed of 65 places in 1007 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1371
[2025-06-02 20:55:43] [INFO ] Deduced a trap composed of 87 places in 998 ms of which 9 ms to minimize.
[2025-06-02 20:55:44] [INFO ] Deduced a trap composed of 104 places in 1477 ms of which 14 ms to minimize.
[2025-06-02 20:55:46] [INFO ] Deduced a trap composed of 74 places in 1573 ms of which 14 ms to minimize.
SMT process timed out in 50397ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 162 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 952/952 places, 3439/3439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 161 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
[2025-06-02 20:55:46] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-02 20:55:46] [INFO ] Invariant cache hit.
[2025-06-02 20:55:49] [INFO ] Implicit Places using invariants in 2295 ms returned []
[2025-06-02 20:55:49] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-02 20:55:49] [INFO ] Invariant cache hit.
[2025-06-02 20:55:50] [INFO ] State equation strengthened by 1903 read => feed constraints.
Detected timeout of ITS tools.
[2025-06-02 20:56:21] [INFO ] Performed 652/952 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 20:56:30] [INFO ] Implicit Places using invariants and state equation in 41404 ms returned []
Implicit Place search using SMT with State Equation took 43701 ms to find 0 implicit places.
[2025-06-02 20:56:30] [INFO ] Redundant transitions in 199 ms returned []
Running 3377 sub problems to find dead transitions.
[2025-06-02 20:56:30] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-02 20:56:30] [INFO ] Invariant cache hit.
[2025-06-02 20:56:30] [INFO ] State equation strengthened by 1903 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 0.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 0.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 0.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 0.0)
(s501 0.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 0.0)
(s524 0.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 0.0)
(s553 0.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 0.0)
(s592 0.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 0.0)
(s645 0.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/949 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3377 unsolved
SMT process timed out in 52547ms, After SMT, problems are : Problem set: 0 solved, 3377 unsolved
Search for dead transitions found 0 dead transitions in 52584ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96661 ms. Remains : 952/952 places, 3439/3439 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-06 in 306532 ms.
[2025-06-02 20:57:23] [INFO ] Flatten gal took : 114 ms
[2025-06-02 20:57:23] [INFO ] Applying decomposition
[2025-06-02 20:57:23] [INFO ] Flatten gal took : 113 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16260698893826645929.txt' '-o' '/tmp/graph16260698893826645929.bin' '-w' '/tmp/graph16260698893826645929.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16260698893826645929.bin' '-l' '-1' '-v' '-w' '/tmp/graph16260698893826645929.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:57:23] [INFO ] Decomposing Gal with order
[2025-06-02 20:57:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:57:24] [INFO ] Removed a total of 5845 redundant transitions.
[2025-06-02 20:57:24] [INFO ] Flatten gal took : 460 ms
[2025-06-02 20:57:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 2418 labels/synchronizations in 158 ms.
[2025-06-02 20:57:24] [INFO ] Time to serialize gal into /tmp/UpperBounds14462216779064091718.gal : 32 ms
[2025-06-02 20:57:24] [INFO ] Time to serialize properties into /tmp/UpperBounds8433937568046787100.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14462216779064091718.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8433937568046787100.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds8433937568046787100.prop.
ITS-tools command line returned an error code 137
[2025-06-02 21:06:28] [INFO ] Flatten gal took : 150 ms
[2025-06-02 21:06:28] [INFO ] Time to serialize gal into /tmp/UpperBounds9800666604980531673.gal : 24 ms
[2025-06-02 21:06:28] [INFO ] Time to serialize properties into /tmp/UpperBounds1202288963969257382.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9800666604980531673.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1202288963969257382.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds1202288963969257382.prop.
ITS-tools command line returned an error code 137
[2025-06-02 21:16:25] [INFO ] Flatten gal took : 116 ms
[2025-06-02 21:16:25] [INFO ] Input system was already deterministic with 3445 transitions.
[2025-06-02 21:16:25] [INFO ] Transformed 954 places.
[2025-06-02 21:16:25] [INFO ] Transformed 3445 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-02 21:16:26] [INFO ] Time to serialize gal into /tmp/UpperBounds15862111835730284096.gal : 19 ms
[2025-06-02 21:16:26] [INFO ] Time to serialize properties into /tmp/UpperBounds17227771091759199807.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15862111835730284096.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17227771091759199807.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds17227771091759199807.prop.
ITS-tools command line returned an error code 137
Total runtime 2920305 ms.

BK_STOP 1748899592022

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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 gold2024"
echo " Input is MultiCrashLeafsetExtension-PT-S16C05, 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 r139-smll-174876533200039"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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