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.r083-tall-174860079800101.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 EisenbergMcGuire-PT-09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-174860079800101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K 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 9.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K 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 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 2.3M 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 EisenbergMcGuire-PT-09-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748734999126

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 23:43:20] [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-05-31 23:43:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 23:43:20] [INFO ] Load time of PNML (sax parser for PT used): 205 ms
[2025-05-31 23:43:20] [INFO ] Transformed 891 places.
[2025-05-31 23:43:20] [INFO ] Transformed 3888 transitions.
[2025-05-31 23:43:20] [INFO ] Found NUPN structural information;
[2025-05-31 23:43:20] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 319 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-31 23:43:20] [INFO ] Flow matrix only has 1809 transitions (discarded 2079 similar events)
// Phase 1: matrix 1809 rows 891 cols
[2025-05-31 23:43:20] [INFO ] Computed 28 invariants in 36 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 69 ms. (142 steps per ms)
FORMULA EisenbergMcGuire-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (12 resets) in 72 ms. (822 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-31 23:43:20] [INFO ] Flow matrix only has 1809 transitions (discarded 2079 similar events)
[2025-05-31 23:43:20] [INFO ] Invariant cache hit.
[2025-05-31 23:43:21] [INFO ] [Real]Absence check using 19 positive place invariants in 31 ms returned sat
[2025-05-31 23:43:21] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 15 ms returned sat
[2025-05-31 23:43:21] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2025-05-31 23:43:21] [INFO ] State equation strengthened by 932 read => feed constraints.
[2025-05-31 23:43:22] [INFO ] [Real]Added 932 Read/Feed constraints in 125 ms returned sat
[2025-05-31 23:43:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:43:22] [INFO ] [Nat]Absence check using 19 positive place invariants in 21 ms returned sat
[2025-05-31 23:43:22] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2025-05-31 23:43:22] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2025-05-31 23:43:22] [INFO ] [Nat]Added 932 Read/Feed constraints in 111 ms returned sat
[2025-05-31 23:43:23] [INFO ] Deduced a trap composed of 4 places in 440 ms of which 50 ms to minimize.
[2025-05-31 23:43:23] [INFO ] Deduced a trap composed of 3 places in 456 ms of which 6 ms to minimize.
[2025-05-31 23:43:24] [INFO ] Deduced a trap composed of 47 places in 412 ms of which 5 ms to minimize.
[2025-05-31 23:43:24] [INFO ] Deduced a trap composed of 56 places in 345 ms of which 4 ms to minimize.
[2025-05-31 23:43:25] [INFO ] Deduced a trap composed of 43 places in 336 ms of which 5 ms to minimize.
[2025-05-31 23:43:25] [INFO ] Deduced a trap composed of 54 places in 326 ms of which 4 ms to minimize.
[2025-05-31 23:43:25] [INFO ] Deduced a trap composed of 26 places in 339 ms of which 4 ms to minimize.
[2025-05-31 23:43:26] [INFO ] Deduced a trap composed of 37 places in 340 ms of which 5 ms to minimize.
[2025-05-31 23:43:26] [INFO ] Deduced a trap composed of 3 places in 333 ms of which 4 ms to minimize.
[2025-05-31 23:43:27] [INFO ] Deduced a trap composed of 3 places in 315 ms of which 5 ms to minimize.
[2025-05-31 23:43:27] [INFO ] Deduced a trap composed of 45 places in 321 ms of which 4 ms to minimize.
[2025-05-31 23:43:27] [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 0
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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
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-05-31 23:43:27] [INFO ] [Real]Absence check using 19 positive place invariants in 20 ms returned sat
[2025-05-31 23:43:27] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 9 ms returned sat
[2025-05-31 23:43:28] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2025-05-31 23:43:28] [INFO ] [Real]Added 932 Read/Feed constraints in 120 ms returned sat
[2025-05-31 23:43:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:43:28] [INFO ] [Nat]Absence check using 19 positive place invariants in 19 ms returned sat
[2025-05-31 23:43:28] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2025-05-31 23:43:28] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2025-05-31 23:43:28] [INFO ] [Nat]Added 932 Read/Feed constraints in 109 ms returned sat
[2025-05-31 23:43:29] [INFO ] Deduced a trap composed of 3 places in 329 ms of which 4 ms to minimize.
[2025-05-31 23:43:29] [INFO ] Deduced a trap composed of 3 places in 348 ms of which 5 ms to minimize.
[2025-05-31 23:43:30] [INFO ] Deduced a trap composed of 56 places in 330 ms of which 4 ms to minimize.
[2025-05-31 23:43:30] [INFO ] Deduced a trap composed of 38 places in 316 ms of which 4 ms to minimize.
[2025-05-31 23:43:30] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 5 ms to minimize.
[2025-05-31 23:43:31] [INFO ] Deduced a trap composed of 219 places in 382 ms of which 5 ms to minimize.
[2025-05-31 23:43:31] [INFO ] Deduced a trap composed of 3 places in 375 ms of which 5 ms to minimize.
[2025-05-31 23:43:32] [INFO ] Deduced a trap composed of 67 places in 389 ms of which 4 ms to minimize.
[2025-05-31 23:43:32] [INFO ] Deduced a trap composed of 44 places in 405 ms of which 5 ms to minimize.
[2025-05-31 23:43:33] [INFO ] Deduced a trap composed of 36 places in 391 ms of which 5 ms to minimize.
[2025-05-31 23:43:33] [INFO ] Deduced a trap composed of 37 places in 266 ms of which 4 ms to minimize.
[2025-05-31 23:43:33] [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 1
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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
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-05-31 23:43:33] [INFO ] [Real]Absence check using 19 positive place invariants in 26 ms returned sat
[2025-05-31 23:43:33] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 11 ms returned sat
[2025-05-31 23:43:33] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2025-05-31 23:43:34] [INFO ] [Real]Added 932 Read/Feed constraints in 125 ms returned sat
[2025-05-31 23:43:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:43:34] [INFO ] [Nat]Absence check using 19 positive place invariants in 20 ms returned sat
[2025-05-31 23:43:34] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2025-05-31 23:43:34] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2025-05-31 23:43:34] [INFO ] [Nat]Added 932 Read/Feed constraints in 101 ms returned sat
[2025-05-31 23:43:35] [INFO ] Deduced a trap composed of 3 places in 430 ms of which 5 ms to minimize.
[2025-05-31 23:43:35] [INFO ] Deduced a trap composed of 3 places in 430 ms of which 5 ms to minimize.
[2025-05-31 23:43:36] [INFO ] Deduced a trap composed of 3 places in 418 ms of which 5 ms to minimize.
[2025-05-31 23:43:36] [INFO ] Deduced a trap composed of 97 places in 446 ms of which 5 ms to minimize.
[2025-05-31 23:43:37] [INFO ] Deduced a trap composed of 90 places in 412 ms of which 5 ms to minimize.
[2025-05-31 23:43:37] [INFO ] Deduced a trap composed of 42 places in 434 ms of which 6 ms to minimize.
[2025-05-31 23:43:38] [INFO ] Deduced a trap composed of 4 places in 422 ms of which 5 ms to minimize.
[2025-05-31 23:43:38] [INFO ] Deduced a trap composed of 63 places in 414 ms of which 5 ms to minimize.
[2025-05-31 23:43:39] [INFO ] Deduced a trap composed of 31 places in 422 ms of which 5 ms to minimize.
[2025-05-31 23:43:39] [INFO ] Trap strengthening (SAT) tested/added 9/9 trap constraints in 4407 ms
[2025-05-31 23:43:39] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2025-05-31 23:43:39] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2025-05-31 23:43:39] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2025-05-31 23:43:39] [INFO ] [Real]Added 932 Read/Feed constraints in 131 ms returned sat
[2025-05-31 23:43:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:43:40] [INFO ] [Nat]Absence check using 19 positive place invariants in 19 ms returned sat
[2025-05-31 23:43:40] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 12 ms returned sat
[2025-05-31 23:43:40] [INFO ] [Nat]Absence check using state equation in 339 ms returned sat
[2025-05-31 23:43:40] [INFO ] [Nat]Added 932 Read/Feed constraints in 132 ms returned sat
[2025-05-31 23:43:40] [INFO ] Deduced a trap composed of 3 places in 277 ms of which 3 ms to minimize.
[2025-05-31 23:43:41] [INFO ] Deduced a trap composed of 3 places in 280 ms of which 4 ms to minimize.
[2025-05-31 23:43:41] [INFO ] Deduced a trap composed of 42 places in 271 ms of which 4 ms to minimize.
[2025-05-31 23:43:41] [INFO ] Deduced a trap composed of 45 places in 236 ms of which 5 ms to minimize.
[2025-05-31 23:43:42] [INFO ] Deduced a trap composed of 38 places in 238 ms of which 4 ms to minimize.
[2025-05-31 23:43:42] [INFO ] Deduced a trap composed of 3 places in 268 ms of which 4 ms to minimize.
[2025-05-31 23:43:42] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 3 ms to minimize.
[2025-05-31 23:43:42] [INFO ] Deduced a trap composed of 3 places in 221 ms of which 3 ms to minimize.
[2025-05-31 23:43:43] [INFO ] Deduced a trap composed of 89 places in 193 ms of which 4 ms to minimize.
[2025-05-31 23:43:43] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 3 ms to minimize.
[2025-05-31 23:43:43] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 3 ms to minimize.
[2025-05-31 23:43:43] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 2 ms to minimize.
[2025-05-31 23:43:44] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 3 ms to minimize.
[2025-05-31 23:43:44] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:43:44] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3822 ms
[2025-05-31 23:43:44] [INFO ] Computed and/alt/rep : 1045/1882/829 causal constraints (skipped 971 transitions) in 165 ms.
[2025-05-31 23:43:44] [INFO ] Added : 20 causal constraints over 4 iterations in 546 ms. Result :unknown
[2025-05-31 23:43:45] [INFO ] [Real]Absence check using 19 positive place invariants in 19 ms returned sat
[2025-05-31 23:43:45] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2025-05-31 23:43:45] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2025-05-31 23:43:45] [INFO ] [Real]Added 932 Read/Feed constraints in 135 ms returned sat
[2025-05-31 23:43:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:43:45] [INFO ] [Nat]Absence check using 19 positive place invariants in 19 ms returned sat
[2025-05-31 23:43:45] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2025-05-31 23:43:46] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2025-05-31 23:43:46] [INFO ] [Nat]Added 932 Read/Feed constraints in 97 ms returned sat
[2025-05-31 23:43:46] [INFO ] Deduced a trap composed of 3 places in 339 ms of which 4 ms to minimize.
[2025-05-31 23:43:46] [INFO ] Deduced a trap composed of 7 places in 333 ms of which 4 ms to minimize.
[2025-05-31 23:43:47] [INFO ] Deduced a trap composed of 3 places in 327 ms of which 4 ms to minimize.
[2025-05-31 23:43:47] [INFO ] Deduced a trap composed of 123 places in 343 ms of which 4 ms to minimize.
[2025-05-31 23:43:48] [INFO ] Deduced a trap composed of 44 places in 259 ms of which 3 ms to minimize.
[2025-05-31 23:43:48] [INFO ] Deduced a trap composed of 3 places in 240 ms of which 4 ms to minimize.
[2025-05-31 23:43:48] [INFO ] Deduced a trap composed of 259 places in 334 ms of which 5 ms to minimize.
[2025-05-31 23:43:49] [INFO ] Deduced a trap composed of 62 places in 344 ms of which 4 ms to minimize.
[2025-05-31 23:43:49] [INFO ] Deduced a trap composed of 146 places in 330 ms of which 4 ms to minimize.
[2025-05-31 23:43:49] [INFO ] Deduced a trap composed of 3 places in 240 ms of which 3 ms to minimize.
[2025-05-31 23:43:50] [INFO ] Deduced a trap composed of 49 places in 356 ms of which 5 ms to minimize.
[2025-05-31 23:43:50] [INFO ] Deduced a trap composed of 124 places in 334 ms of which 5 ms to minimize.
[2025-05-31 23:43:50] [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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
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-05-31 23:43:50] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2025-05-31 23:43:50] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2025-05-31 23:43:51] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2025-05-31 23:43:51] [INFO ] [Real]Added 932 Read/Feed constraints in 110 ms returned sat
[2025-05-31 23:43:51] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:43:51] [INFO ] [Nat]Absence check using 19 positive place invariants in 20 ms returned sat
[2025-05-31 23:43:51] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2025-05-31 23:43:51] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2025-05-31 23:43:52] [INFO ] [Nat]Added 932 Read/Feed constraints in 107 ms returned sat
[2025-05-31 23:43:52] [INFO ] Deduced a trap composed of 3 places in 314 ms of which 4 ms to minimize.
[2025-05-31 23:43:52] [INFO ] Deduced a trap composed of 6 places in 322 ms of which 4 ms to minimize.
[2025-05-31 23:43:53] [INFO ] Deduced a trap composed of 3 places in 333 ms of which 5 ms to minimize.
[2025-05-31 23:43:53] [INFO ] Deduced a trap composed of 3 places in 325 ms of which 4 ms to minimize.
[2025-05-31 23:43:53] [INFO ] Deduced a trap composed of 65 places in 320 ms of which 5 ms to minimize.
[2025-05-31 23:43:54] [INFO ] Deduced a trap composed of 3 places in 324 ms of which 5 ms to minimize.
[2025-05-31 23:43:54] [INFO ] Deduced a trap composed of 41 places in 334 ms of which 5 ms to minimize.
[2025-05-31 23:43:55] [INFO ] Deduced a trap composed of 32 places in 285 ms of which 4 ms to minimize.
[2025-05-31 23:43:55] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 4 ms to minimize.
[2025-05-31 23:43:55] [INFO ] Deduced a trap composed of 50 places in 292 ms of which 4 ms to minimize.
[2025-05-31 23:43:56] [INFO ] Deduced a trap composed of 3 places in 232 ms of which 3 ms to minimize.
[2025-05-31 23:43:56] [INFO ] Deduced a trap composed of 3 places in 229 ms of which 4 ms to minimize.
[2025-05-31 23:43:56] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 3 ms to minimize.
[2025-05-31 23:43:56] [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 5
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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA EisenbergMcGuire-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 891 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 891/891 places, 3888/3888 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 891 transition count 3879
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 882 transition count 3879
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 882 transition count 3627
Deduced a syphon composed of 252 places in 3 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 630 transition count 3627
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 594 place count 558 transition count 2979
Iterating global reduction 2 with 72 rules applied. Total rules applied 666 place count 558 transition count 2979
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 810 place count 486 transition count 2907
Applied a total of 810 rules in 415 ms. Remains 486 /891 variables (removed 405) and now considering 2907/3888 (removed 981) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 425 ms. Remains : 486/891 places, 2907/3888 transitions.
[2025-05-31 23:43:57] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2025-05-31 23:43:57] [INFO ] Computed 28 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 2151 ms. (464 steps per ms)
BEST_FIRST walk for 5000005 steps (10 resets) in 2508 ms. (1992 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-05-31 23:44:02] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 23:44:02] [INFO ] Invariant cache hit.
[2025-05-31 23:44:02] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-05-31 23:44:02] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-05-31 23:44:02] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2025-05-31 23:44:02] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-31 23:44:02] [INFO ] [Real]Added 356 Read/Feed constraints in 46 ms returned sat
[2025-05-31 23:44:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:44:02] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-05-31 23:44:02] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2025-05-31 23:44:02] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2025-05-31 23:44:02] [INFO ] [Nat]Added 356 Read/Feed constraints in 38 ms returned sat
[2025-05-31 23:44:02] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:44:02] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:44:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 196 ms
[2025-05-31 23:44:02] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 65 ms.
[2025-05-31 23:44:03] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:44:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2025-05-31 23:44:03] [INFO ] Added : 79 causal constraints over 17 iterations in 1001 ms. Result :sat
Minimization took 183 ms.
[2025-05-31 23:44:04] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-05-31 23:44:04] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-05-31 23:44:04] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2025-05-31 23:44:04] [INFO ] [Real]Added 356 Read/Feed constraints in 59 ms returned sat
[2025-05-31 23:44:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:44:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-05-31 23:44:04] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2025-05-31 23:44:04] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2025-05-31 23:44:04] [INFO ] [Nat]Added 356 Read/Feed constraints in 45 ms returned sat
[2025-05-31 23:44:04] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:44:04] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 0 ms to minimize.
[2025-05-31 23:44:04] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:44:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 273 ms
[2025-05-31 23:44:05] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 71 ms.
[2025-05-31 23:44:05] [INFO ] Added : 62 causal constraints over 13 iterations in 639 ms. Result :sat
Minimization took 183 ms.
[2025-05-31 23:44:05] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-05-31 23:44:05] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2025-05-31 23:44:06] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2025-05-31 23:44:06] [INFO ] [Real]Added 356 Read/Feed constraints in 56 ms returned sat
[2025-05-31 23:44:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:44:06] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-05-31 23:44:06] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2025-05-31 23:44:06] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2025-05-31 23:44:06] [INFO ] [Nat]Added 356 Read/Feed constraints in 41 ms returned sat
[2025-05-31 23:44:06] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:44:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2025-05-31 23:44:06] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 97 ms.
[2025-05-31 23:44:07] [INFO ] Added : 35 causal constraints over 8 iterations in 468 ms. Result :sat
Minimization took 193 ms.
[2025-05-31 23:44:07] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-05-31 23:44:07] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-05-31 23:44:07] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2025-05-31 23:44:07] [INFO ] [Real]Added 356 Read/Feed constraints in 39 ms returned sat
[2025-05-31 23:44:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:44:07] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-05-31 23:44:07] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-05-31 23:44:07] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2025-05-31 23:44:07] [INFO ] [Nat]Added 356 Read/Feed constraints in 37 ms returned sat
[2025-05-31 23:44:07] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2025-05-31 23:44:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2025-05-31 23:44:07] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 71 ms.
[2025-05-31 23:44:08] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:44:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2025-05-31 23:44:08] [INFO ] Added : 66 causal constraints over 14 iterations in 874 ms. Result :sat
Minimization took 176 ms.
[2025-05-31 23:44:09] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-05-31 23:44:09] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2025-05-31 23:44:09] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2025-05-31 23:44:09] [INFO ] [Real]Added 356 Read/Feed constraints in 49 ms returned sat
[2025-05-31 23:44:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:44:09] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-05-31 23:44:09] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-05-31 23:44:09] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2025-05-31 23:44:09] [INFO ] [Nat]Added 356 Read/Feed constraints in 40 ms returned sat
[2025-05-31 23:44:09] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2025-05-31 23:44:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2025-05-31 23:44:09] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 64 ms.
[2025-05-31 23:44:10] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2025-05-31 23:44:10] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2025-05-31 23:44:10] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 1 ms to minimize.
[2025-05-31 23:44:10] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 0 ms to minimize.
[2025-05-31 23:44:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 519 ms
[2025-05-31 23:44:11] [INFO ] Added : 96 causal constraints over 20 iterations in 1479 ms. Result :sat
Minimization took 186 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA EisenbergMcGuire-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 133 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 486/486 places, 2907/2907 transitions.
[2025-05-31 23:44:12] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 23:44:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 2058 ms. (485 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 1475 ms. (2032 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-31 23:44:15] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 23:44:15] [INFO ] Invariant cache hit.
[2025-05-31 23:44:15] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-05-31 23:44:15] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-05-31 23:44:16] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2025-05-31 23:44:16] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-31 23:44:16] [INFO ] [Real]Added 356 Read/Feed constraints in 45 ms returned sat
[2025-05-31 23:44:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:44:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-05-31 23:44:16] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-05-31 23:44:16] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2025-05-31 23:44:16] [INFO ] [Nat]Added 356 Read/Feed constraints in 42 ms returned sat
[2025-05-31 23:44:16] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:44:16] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2025-05-31 23:44:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 199 ms
[2025-05-31 23:44:16] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 63 ms.
[2025-05-31 23:44:17] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:44:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2025-05-31 23:44:17] [INFO ] Added : 79 causal constraints over 17 iterations in 981 ms. Result :sat
Minimization took 177 ms.
[2025-05-31 23:44:17] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-05-31 23:44:17] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-05-31 23:44:18] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2025-05-31 23:44:18] [INFO ] [Real]Added 356 Read/Feed constraints in 58 ms returned sat
[2025-05-31 23:44:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:44:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-05-31 23:44:18] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2025-05-31 23:44:18] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2025-05-31 23:44:18] [INFO ] [Nat]Added 356 Read/Feed constraints in 43 ms returned sat
[2025-05-31 23:44:18] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2025-05-31 23:44:18] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:44:18] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:44:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 248 ms
[2025-05-31 23:44:18] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 64 ms.
[2025-05-31 23:44:19] [INFO ] Added : 62 causal constraints over 13 iterations in 631 ms. Result :sat
Minimization took 185 ms.
[2025-05-31 23:44:19] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-05-31 23:44:19] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-05-31 23:44:19] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2025-05-31 23:44:19] [INFO ] [Real]Added 356 Read/Feed constraints in 58 ms returned sat
[2025-05-31 23:44:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:44:19] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-05-31 23:44:19] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-05-31 23:44:20] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2025-05-31 23:44:20] [INFO ] [Nat]Added 356 Read/Feed constraints in 39 ms returned sat
[2025-05-31 23:44:20] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2025-05-31 23:44:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2025-05-31 23:44:20] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 63 ms.
[2025-05-31 23:44:20] [INFO ] Added : 35 causal constraints over 8 iterations in 459 ms. Result :sat
Minimization took 177 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 128 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 129 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2025-05-31 23:44:21] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 23:44:21] [INFO ] Invariant cache hit.
[2025-05-31 23:44:22] [INFO ] Implicit Places using invariants in 526 ms returned []
[2025-05-31 23:44:22] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 23:44:22] [INFO ] Invariant cache hit.
[2025-05-31 23:44:22] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-31 23:44:24] [INFO ] Implicit Places using invariants and state equation in 2564 ms returned []
Implicit Place search using SMT with State Equation took 3096 ms to find 0 implicit places.
[2025-05-31 23:44:24] [INFO ] Redundant transitions in 145 ms returned []
Running 2898 sub problems to find dead transitions.
[2025-05-31 23:44:24] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 23:44:24] [INFO ] Invariant cache hit.
[2025-05-31 23:44:25] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-05-31 23:44:49] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 3 ms to minimize.
[2025-05-31 23:44:49] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 2 ms to minimize.
[2025-05-31 23:44:50] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 1 ms to minimize.
[2025-05-31 23:44:50] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2025-05-31 23:44:50] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:44:50] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:44:50] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2025-05-31 23:44:50] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 2 ms to minimize.
[2025-05-31 23:44:50] [INFO ] Deduced a trap composed of 75 places in 135 ms of which 2 ms to minimize.
[2025-05-31 23:44:52] [INFO ] Deduced a trap composed of 50 places in 134 ms of which 2 ms to minimize.
[2025-05-31 23:44:52] [INFO ] Deduced a trap composed of 59 places in 142 ms of which 2 ms to minimize.
[2025-05-31 23:44:53] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 2 ms to minimize.
[2025-05-31 23:44:53] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 2 ms to minimize.
[2025-05-31 23:44:53] [INFO ] Deduced a trap composed of 57 places in 141 ms of which 2 ms to minimize.
[2025-05-31 23:44:53] [INFO ] Deduced a trap composed of 66 places in 142 ms of which 2 ms to minimize.
[2025-05-31 23:44:54] [INFO ] Deduced a trap composed of 79 places in 146 ms of which 2 ms to minimize.
[2025-05-31 23:44:54] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 2 ms to minimize.
[2025-05-31 23:44:54] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 2 ms to minimize.
[2025-05-31 23:44:54] [INFO ] Deduced a trap composed of 81 places in 162 ms of which 3 ms to minimize.
[2025-05-31 23:44:54] [INFO ] Deduced a trap composed of 75 places in 160 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1314 variables, and 48 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 2898/2898 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2898 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-05-31 23:45:01] [INFO ] Deduced a trap composed of 59 places in 159 ms of which 2 ms to minimize.
[2025-05-31 23:45:02] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 2 ms to minimize.
[2025-05-31 23:45:02] [INFO ] Deduced a trap composed of 60 places in 127 ms of which 2 ms to minimize.
[2025-05-31 23:45:02] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 2 ms to minimize.
[2025-05-31 23:45:02] [INFO ] Deduced a trap composed of 74 places in 175 ms of which 2 ms to minimize.
[2025-05-31 23:45:02] [INFO ] Deduced a trap composed of 116 places in 174 ms of which 2 ms to minimize.
[2025-05-31 23:45:03] [INFO ] Deduced a trap composed of 79 places in 171 ms of which 3 ms to minimize.
[2025-05-31 23:45:03] [INFO ] Deduced a trap composed of 89 places in 165 ms of which 2 ms to minimize.
[2025-05-31 23:45:03] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 2 ms to minimize.
[2025-05-31 23:45:03] [INFO ] Deduced a trap composed of 58 places in 180 ms of which 3 ms to minimize.
[2025-05-31 23:45:03] [INFO ] Deduced a trap composed of 70 places in 201 ms of which 3 ms to minimize.
[2025-05-31 23:45:04] [INFO ] Deduced a trap composed of 83 places in 226 ms of which 4 ms to minimize.
[2025-05-31 23:45:04] [INFO ] Deduced a trap composed of 51 places in 217 ms of which 3 ms to minimize.
[2025-05-31 23:45:04] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 2 ms to minimize.
[2025-05-31 23:45:04] [INFO ] Deduced a trap composed of 81 places in 202 ms of which 3 ms to minimize.
[2025-05-31 23:45:04] [INFO ] Deduced a trap composed of 69 places in 203 ms of which 3 ms to minimize.
[2025-05-31 23:45:05] [INFO ] Deduced a trap composed of 22 places in 245 ms of which 3 ms to minimize.
[2025-05-31 23:45:05] [INFO ] Deduced a trap composed of 63 places in 219 ms of which 2 ms to minimize.
[2025-05-31 23:45:05] [INFO ] Deduced a trap composed of 3 places in 220 ms of which 3 ms to minimize.
[2025-05-31 23:45:05] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-05-31 23:45:11] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2025-05-31 23:45:15] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 2 ms to minimize.
[2025-05-31 23:45:16] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2025-05-31 23:45:20] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 2 ms to minimize.
[2025-05-31 23:45:20] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 2 ms to minimize.
[2025-05-31 23:45:25] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/1314 variables, and 74 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 0/2898 constraints, Known Traps: 46/46 constraints]
After SMT, in 61990ms problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 62043ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65446 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 916 ms. (43 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
[2025-05-31 23:45:28] [INFO ] Flatten gal took : 521 ms
[2025-05-31 23:45:28] [INFO ] Flatten gal took : 144 ms
[2025-05-31 23:45:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10030040985102679790.gal : 46 ms
[2025-05-31 23:45:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12818827874627035692.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/ReachabilityCardinality10030040985102679790.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12818827874627035692.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 ...330
Loading property file /tmp/ReachabilityCardinality12818827874627035692.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :8 after 23
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :23 after 30
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :30 after 60
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :60 after 91
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :91 after 280
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :280 after 395
Interrupted probabilistic random walk after 249880 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :4 out of 6
Probabilistic random walk after 249880 steps, saw 160055 distinct states, run finished after 3010 ms. (steps per millisecond=83 ) properties seen :4
[2025-05-31 23:45:30] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 23:45:30] [INFO ] Invariant cache hit.
[2025-05-31 23:45:30] [INFO ] State equation strengthened by 356 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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:45:30] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 92/145 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 137/282 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/474 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 504/1314 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 314/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :395 after 1330
At refinement iteration 23 (OVERLAPS) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 871 constraints, problems are : Problem set: 0 solved, 2 unsolved in 776 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 92/145 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 137/282 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/474 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:45:31] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/810 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 504/1314 variables, 336/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 314/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:45:32] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 1/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1314 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1314 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 875 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1007 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 1807ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 219 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 97 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 250 ms. (159 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :1330 after 5100
Interrupted probabilistic random walk after 255690 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 2
Probabilistic random walk after 255690 steps, saw 163369 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
[2025-05-31 23:45:35] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 23:45:35] [INFO ] Invariant cache hit.
[2025-05-31 23:45:35] [INFO ] State equation strengthened by 356 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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:45:36] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 92/145 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 137/282 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/474 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 504/1314 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :5100 after 13717
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 314/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 871 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1727 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 92/145 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 137/282 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/474 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:45:38] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/810 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 504/1314 variables, 336/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 314/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:45:38] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 1/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1314 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1314 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 875 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1304 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 3072ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 177 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 93 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 91 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2025-05-31 23:45:39] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 23:45:39] [INFO ] Invariant cache hit.
[2025-05-31 23:45:39] [INFO ] Implicit Places using invariants in 484 ms returned []
[2025-05-31 23:45:39] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 23:45:39] [INFO ] Invariant cache hit.
[2025-05-31 23:45:40] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-31 23:45:42] [INFO ] Implicit Places using invariants and state equation in 2621 ms returned []
Implicit Place search using SMT with State Equation took 3115 ms to find 0 implicit places.
[2025-05-31 23:45:42] [INFO ] Redundant transitions in 74 ms returned []
Running 2898 sub problems to find dead transitions.
[2025-05-31 23:45:42] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 23:45:42] [INFO ] Invariant cache hit.
[2025-05-31 23:45:42] [INFO ] State equation strengthened by 356 read => feed constraints.
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :13717 after 54285
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :54285 after 99770
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-05-31 23:46:07] [INFO ] Deduced a trap composed of 3 places in 255 ms of which 3 ms to minimize.
[2025-05-31 23:46:08] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 1 ms to minimize.
[2025-05-31 23:46:08] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 2 ms to minimize.
[2025-05-31 23:46:08] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 2 ms to minimize.
[2025-05-31 23:46:08] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 1 ms to minimize.
[2025-05-31 23:46:09] [INFO ] Deduced a trap composed of 3 places in 598 ms of which 1 ms to minimize.
[2025-05-31 23:46:09] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 0 ms to minimize.
[2025-05-31 23:46:09] [INFO ] Deduced a trap composed of 49 places in 308 ms of which 3 ms to minimize.
[2025-05-31 23:46:09] [INFO ] Deduced a trap composed of 75 places in 176 ms of which 3 ms to minimize.
[2025-05-31 23:46:11] [INFO ] Deduced a trap composed of 50 places in 359 ms of which 2 ms to minimize.
[2025-05-31 23:46:11] [INFO ] Deduced a trap composed of 59 places in 143 ms of which 2 ms to minimize.
[2025-05-31 23:46:12] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 2 ms to minimize.
[2025-05-31 23:46:12] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 2 ms to minimize.
[2025-05-31 23:46:12] [INFO ] Deduced a trap composed of 57 places in 145 ms of which 2 ms to minimize.
[2025-05-31 23:46:13] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 2 ms to minimize.
[2025-05-31 23:46:13] [INFO ] Deduced a trap composed of 79 places in 164 ms of which 2 ms to minimize.
[2025-05-31 23:46:13] [INFO ] Deduced a trap composed of 49 places in 153 ms of which 2 ms to minimize.
[2025-05-31 23:46:13] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 2 ms to minimize.
[2025-05-31 23:46:13] [INFO ] Deduced a trap composed of 81 places in 177 ms of which 2 ms to minimize.
[2025-05-31 23:46:14] [INFO ] Deduced a trap composed of 75 places in 179 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1314 variables, and 48 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 2898/2898 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2898 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Detected timeout of ITS tools.
[2025-05-31 23:46:18] [INFO ] Flatten gal took : 90 ms
[2025-05-31 23:46:18] [INFO ] Applying decomposition
[2025-05-31 23:46:18] [INFO ] Flatten gal took : 85 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/graph1852063047425910732.txt' '-o' '/tmp/graph1852063047425910732.bin' '-w' '/tmp/graph1852063047425910732.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1852063047425910732.bin' '-l' '-1' '-v' '-w' '/tmp/graph1852063047425910732.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:46:19] [INFO ] Decomposing Gal with order
[2025-05-31 23:46:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:46:20] [INFO ] Removed a total of 6323 redundant transitions.
[2025-05-31 23:46:20] [INFO ] Flatten gal took : 792 ms
[2025-05-31 23:46:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 786 labels/synchronizations in 248 ms.
[2025-05-31 23:46:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3982075618067345121.gal : 63 ms
[2025-05-31 23:46:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16166188878819976626.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/ReachabilityCardinality3982075618067345121.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16166188878819976626.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-05-31 23:46:21] [INFO ] Deduced a trap composed of 59 places in 230 ms of which 6 ms to minimize.
Loading property file /tmp/ReachabilityCardinality16166188878819976626.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 488
[2025-05-31 23:46:21] [INFO ] Deduced a trap composed of 52 places in 184 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :488 after 2449
[2025-05-31 23:46:21] [INFO ] Deduced a trap composed of 60 places in 145 ms of which 2 ms to minimize.
[2025-05-31 23:46:21] [INFO ] Deduced a trap composed of 54 places in 145 ms of which 2 ms to minimize.
[2025-05-31 23:46:22] [INFO ] Deduced a trap composed of 74 places in 186 ms of which 2 ms to minimize.
[2025-05-31 23:46:22] [INFO ] Deduced a trap composed of 116 places in 200 ms of which 2 ms to minimize.
[2025-05-31 23:46:22] [INFO ] Deduced a trap composed of 79 places in 195 ms of which 2 ms to minimize.
[2025-05-31 23:46:22] [INFO ] Deduced a trap composed of 89 places in 182 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :2449 after 72580
[2025-05-31 23:46:22] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 2 ms to minimize.
[2025-05-31 23:46:23] [INFO ] Deduced a trap composed of 58 places in 205 ms of which 2 ms to minimize.
[2025-05-31 23:46:23] [INFO ] Deduced a trap composed of 70 places in 222 ms of which 3 ms to minimize.
[2025-05-31 23:46:23] [INFO ] Deduced a trap composed of 83 places in 239 ms of which 3 ms to minimize.
[2025-05-31 23:46:23] [INFO ] Deduced a trap composed of 51 places in 232 ms of which 2 ms to minimize.
[2025-05-31 23:46:24] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 2 ms to minimize.
[2025-05-31 23:46:24] [INFO ] Deduced a trap composed of 81 places in 223 ms of which 2 ms to minimize.
[2025-05-31 23:46:24] [INFO ] Deduced a trap composed of 69 places in 213 ms of which 2 ms to minimize.
[2025-05-31 23:46:24] [INFO ] Deduced a trap composed of 22 places in 267 ms of which 2 ms to minimize.
[2025-05-31 23:46:25] [INFO ] Deduced a trap composed of 63 places in 230 ms of which 2 ms to minimize.
[2025-05-31 23:46:25] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 2 ms to minimize.
[2025-05-31 23:46:25] [INFO ] Deduced a trap composed of 15 places in 251 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :72580 after 799854
[2025-05-31 23:46:31] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 2 ms to minimize.
[2025-05-31 23:46:35] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 2 ms to minimize.
[2025-05-31 23:46:35] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
[2025-05-31 23:46:39] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 2 ms to minimize.
[2025-05-31 23:46:40] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :799854 after 3.45466e+06
[2025-05-31 23:46:44] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/1314 variables, and 74 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 0/2898 constraints, Known Traps: 46/46 constraints]
After SMT, in 62158ms problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 62192ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65490 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 6 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 70 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 190 rows 64 cols
[2025-05-31 23:46:44] [INFO ] Computed 19 invariants in 0 ms
[2025-05-31 23:46:44] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2025-05-31 23:46:44] [INFO ] After 64ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2025-05-31 23:46:44] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 23:46:45] [INFO ] After 15ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 23:46:45] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 23:46:45] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2025-05-31 23:46:45] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-05-31 23:46:45] [INFO ] After 28ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 23:46:45] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-31 23:46:45] [INFO ] After 219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-31 23:46:45] [INFO ] Flatten gal took : 8 ms
[2025-05-31 23:46:45] [INFO ] Flatten gal took : 9 ms
[2025-05-31 23:46:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6356960557269908846.gal : 2 ms
[2025-05-31 23:46:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9284800511850465465.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/ReachabilityCardinality6356960557269908846.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9284800511850465465.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 ...328
Loading property file /tmp/ReachabilityCardinality9284800511850465465.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :16 after 48
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,480,0.028588,5720,2,283,8,1106,6,0,449,654,0
Total reachable state count : 480

Verifying 2 reachability properties.
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,32,0.028953,5720,2,110,8,1106,7,0,452,654,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,32,0.029133,5720,2,110,8,1106,8,0,453,654,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 566 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA EisenbergMcGuire-PT-09-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
FORMULA EisenbergMcGuire-PT-09-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for EisenbergMcGuire-PT-09-UpperBounds-08
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-05-31 23:46:45] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2025-05-31 23:46:45] [INFO ] Computed 28 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2 resets) in 22 ms. (434 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:46:45] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-05-31 23:46:45] [INFO ] Invariant cache hit.
[2025-05-31 23:46:45] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-05-31 23:46:45] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-05-31 23:46:45] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2025-05-31 23:46:45] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-31 23:46:45] [INFO ] [Real]Added 356 Read/Feed constraints in 58 ms returned sat
[2025-05-31 23:46:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:46:45] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-05-31 23:46:45] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-05-31 23:46:46] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2025-05-31 23:46:46] [INFO ] [Nat]Added 356 Read/Feed constraints in 40 ms returned sat
[2025-05-31 23:46:46] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:46:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2025-05-31 23:46:46] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 63 ms.
[2025-05-31 23:46:46] [INFO ] Added : 35 causal constraints over 8 iterations in 448 ms. Result :sat
Minimization took 168 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 486 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p37_3_0) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2906/2906 transitions.
Applied a total of 0 rules in 93 ms. Remains 486 /486 variables (removed 0) and now considering 2906/2906 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 486/486 places, 2906/2906 transitions.
[2025-05-31 23:46:47] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
// Phase 1: matrix 827 rows 486 cols
[2025-05-31 23:46:47] [INFO ] Computed 28 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 2029 ms. (492 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 482 ms. (2070 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:46:49] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2025-05-31 23:46:49] [INFO ] Invariant cache hit.
[2025-05-31 23:46:49] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-05-31 23:46:49] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-05-31 23:46:49] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2025-05-31 23:46:49] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-31 23:46:49] [INFO ] [Real]Added 356 Read/Feed constraints in 51 ms returned sat
[2025-05-31 23:46:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:46:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-05-31 23:46:50] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2025-05-31 23:46:50] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2025-05-31 23:46:50] [INFO ] [Nat]Added 356 Read/Feed constraints in 41 ms returned sat
[2025-05-31 23:46:50] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2025-05-31 23:46:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2025-05-31 23:46:50] [INFO ] Computed and/alt/rep : 704/1602/488 causal constraints (skipped 330 transitions) in 66 ms.
[2025-05-31 23:46:50] [INFO ] Added : 47 causal constraints over 10 iterations in 495 ms. Result :sat
Minimization took 173 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2906/2906 transitions.
Applied a total of 0 rules in 90 ms. Remains 486 /486 variables (removed 0) and now considering 2906/2906 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 486/486 places, 2906/2906 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2906/2906 transitions.
Applied a total of 0 rules in 90 ms. Remains 486 /486 variables (removed 0) and now considering 2906/2906 (removed 0) transitions.
[2025-05-31 23:46:51] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2025-05-31 23:46:51] [INFO ] Invariant cache hit.
[2025-05-31 23:46:51] [INFO ] Implicit Places using invariants in 619 ms returned []
[2025-05-31 23:46:51] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2025-05-31 23:46:51] [INFO ] Invariant cache hit.
[2025-05-31 23:46:52] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-31 23:46:54] [INFO ] Implicit Places using invariants and state equation in 2466 ms returned []
Implicit Place search using SMT with State Equation took 3090 ms to find 0 implicit places.
[2025-05-31 23:46:54] [INFO ] Redundant transitions in 164 ms returned []
Running 2897 sub problems to find dead transitions.
[2025-05-31 23:46:54] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2025-05-31 23:46:54] [INFO ] Invariant cache hit.
[2025-05-31 23:46:54] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
[2025-05-31 23:47:19] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 2 ms to minimize.
[2025-05-31 23:47:19] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 2 ms to minimize.
[2025-05-31 23:47:19] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2025-05-31 23:47:19] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:47:19] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:47:19] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2025-05-31 23:47:23] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:47:24] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 485/1313 variables, and 33 constraints, problems are : Problem set: 0 solved, 2897 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 8/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 2897/2897 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2897 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/485 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
[2025-05-31 23:47:35] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:47:36] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
[2025-05-31 23:47:38] [INFO ] Deduced a trap composed of 64 places in 119 ms of which 2 ms to minimize.
[2025-05-31 23:47:40] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:47:40] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:47:40] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:47:41] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:47:42] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:47:42] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2025-05-31 23:47:45] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:47:45] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:47:47] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:47:48] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:47:49] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:47:49] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2025-05-31 23:47:50] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:47:50] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 0 ms to minimize.
[2025-05-31 23:47:50] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
[2025-05-31 23:47:51] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 0 ms to minimize.
[2025-05-31 23:47:51] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/485 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/1313 variables, and 53 constraints, problems are : Problem set: 0 solved, 2897 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 8/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 0/2897 constraints, Known Traps: 28/28 constraints]
After SMT, in 61941ms problems are : Problem set: 0 solved, 2897 unsolved
Search for dead transitions found 0 dead transitions in 61968ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65323 ms. Remains : 486/486 places, 2906/2906 transitions.
RANDOM walk for 40000 steps (8 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
[2025-05-31 23:47:56] [INFO ] Flatten gal took : 130 ms
[2025-05-31 23:47:56] [INFO ] Flatten gal took : 78 ms
[2025-05-31 23:47:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14787917253937510271.gal : 19 ms
[2025-05-31 23:47:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8033937106464852202.prop : 48 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/ReachabilityCardinality14787917253937510271.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8033937106464852202.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/ReachabilityCardinality8033937106464852202.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 23
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :23 after 30
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30 after 60
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :60 after 91
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :91 after 258
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :258 after 395
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :395 after 1361
Interrupted probabilistic random walk after 219400 steps, run timeout after 3007 ms. (steps per millisecond=72 ) properties seen :0 out of 2
Probabilistic random walk after 219400 steps, saw 142278 distinct states, run finished after 3007 ms. (steps per millisecond=72 ) properties seen :0
[2025-05-31 23:47:59] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2025-05-31 23:47:59] [INFO ] Invariant cache hit.
[2025-05-31 23:47:59] [INFO ] State equation strengthened by 356 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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:48:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 91/144 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 137/281 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/473 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/473 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 320/793 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/793 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/809 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/809 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 504/1313 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1313 variables, 314/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1313 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1313 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1313/1313 variables, and 871 constraints, problems are : Problem set: 0 solved, 2 unsolved in 909 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 91/144 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 137/281 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/473 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/473 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 320/793 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/793 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/809 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/809 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:48:00] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/809 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/809 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 504/1313 variables, 336/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1313 variables, 314/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:48:01] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1313 variables, 1/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1313 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1361 after 5100
At refinement iteration 26 (OVERLAPS) 0/1313 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1313/1313 variables, and 875 constraints, problems are : Problem set: 0 solved, 2 unsolved in 853 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 1778ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 228 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2906/2906 transitions.
Applied a total of 0 rules in 82 ms. Remains 486 /486 variables (removed 0) and now considering 2906/2906 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 486/486 places, 2906/2906 transitions.
RANDOM walk for 40000 steps (8 resets) in 274 ms. (145 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 287270 steps, run timeout after 3003 ms. (steps per millisecond=95 ) properties seen :0 out of 2
Probabilistic random walk after 287270 steps, saw 182390 distinct states, run finished after 3004 ms. (steps per millisecond=95 ) properties seen :0
[2025-05-31 23:48:04] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2025-05-31 23:48:04] [INFO ] Invariant cache hit.
[2025-05-31 23:48:04] [INFO ] State equation strengthened by 356 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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:48:05] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 91/144 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 137/281 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/473 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/473 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 320/793 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/793 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/809 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/809 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 504/1313 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1313 variables, 314/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1313 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1313 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1313/1313 variables, and 871 constraints, problems are : Problem set: 0 solved, 2 unsolved in 624 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 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) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 91/144 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 137/281 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/473 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/473 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 320/793 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/793 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/809 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/809 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:48:05] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/809 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5100 after 13710
At refinement iteration 21 (INCLUDED_ONLY) 0/809 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 504/1313 variables, 336/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1313 variables, 314/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:48:06] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1313 variables, 1/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1313 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1313 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1313/1313 variables, and 875 constraints, problems are : Problem set: 0 solved, 2 unsolved in 892 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 1537ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 185 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2906/2906 transitions.
Applied a total of 0 rules in 82 ms. Remains 486 /486 variables (removed 0) and now considering 2906/2906 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 486/486 places, 2906/2906 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2906/2906 transitions.
Applied a total of 0 rules in 102 ms. Remains 486 /486 variables (removed 0) and now considering 2906/2906 (removed 0) transitions.
[2025-05-31 23:48:06] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2025-05-31 23:48:06] [INFO ] Invariant cache hit.
[2025-05-31 23:48:07] [INFO ] Implicit Places using invariants in 476 ms returned []
[2025-05-31 23:48:07] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2025-05-31 23:48:07] [INFO ] Invariant cache hit.
[2025-05-31 23:48:07] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-05-31 23:48:09] [INFO ] Implicit Places using invariants and state equation in 2545 ms returned []
Implicit Place search using SMT with State Equation took 3024 ms to find 0 implicit places.
[2025-05-31 23:48:09] [INFO ] Redundant transitions in 75 ms returned []
Running 2897 sub problems to find dead transitions.
[2025-05-31 23:48:09] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2025-05-31 23:48:09] [INFO ] Invariant cache hit.
[2025-05-31 23:48:09] [INFO ] State equation strengthened by 356 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :13710 after 51179
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :51179 after 99625
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
[2025-05-31 23:48:35] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 2 ms to minimize.
[2025-05-31 23:48:35] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 1 ms to minimize.
[2025-05-31 23:48:35] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2025-05-31 23:48:35] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2025-05-31 23:48:35] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:48:35] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:48:40] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:48:40] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 485/1313 variables, and 33 constraints, problems are : Problem set: 0 solved, 2897 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 8/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 2897/2897 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2897 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/485 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
Detected timeout of ITS tools.
[2025-05-31 23:48:47] [INFO ] Flatten gal took : 67 ms
[2025-05-31 23:48:47] [INFO ] Applying decomposition
[2025-05-31 23:48:47] [INFO ] Flatten gal took : 68 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/graph8098714011867894682.txt' '-o' '/tmp/graph8098714011867894682.bin' '-w' '/tmp/graph8098714011867894682.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8098714011867894682.bin' '-l' '-1' '-v' '-w' '/tmp/graph8098714011867894682.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:48:47] [INFO ] Decomposing Gal with order
[2025-05-31 23:48:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:48:47] [INFO ] Removed a total of 6109 redundant transitions.
[2025-05-31 23:48:47] [INFO ] Flatten gal took : 193 ms
[2025-05-31 23:48:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 612 labels/synchronizations in 50 ms.
[2025-05-31 23:48:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6296480248014023193.gal : 15 ms
[2025-05-31 23:48:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14153559991847729996.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/ReachabilityCardinality6296480248014023193.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14153559991847729996.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/ReachabilityCardinality14153559991847729996.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :13 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 114
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :114 after 4718
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :4718 after 153762
[2025-05-31 23:48:51] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2025-05-31 23:48:51] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :153762 after 1.2119e+06
[2025-05-31 23:48:54] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 2 ms to minimize.
[2025-05-31 23:48:56] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:48:56] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:48:56] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:48:57] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:48:57] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:48:58] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 2 ms to minimize.
[2025-05-31 23:49:01] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2025-05-31 23:49:01] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:49:02] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:49:03] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2025-05-31 23:49:05] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:49:05] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2025-05-31 23:49:05] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 0 ms to minimize.
[2025-05-31 23:49:06] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 0 ms to minimize.
[2025-05-31 23:49:06] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:49:06] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2025-05-31 23:49:07] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/485 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 1)
(s39 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/1313 variables, and 53 constraints, problems are : Problem set: 0 solved, 2897 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 8/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 0/2897 constraints, Known Traps: 28/28 constraints]
After SMT, in 62117ms problems are : Problem set: 0 solved, 2897 unsolved
Search for dead transitions found 0 dead transitions in 62145ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65359 ms. Remains : 486/486 places, 2906/2906 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 513
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 513
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 494
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 494
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 351
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 279
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 279
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 270
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 261
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 189
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 189
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 189
Applied a total of 791 rules in 32 ms. Remains 64 /486 variables (removed 422) and now considering 189/2906 (removed 2717) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 189 rows 64 cols
[2025-05-31 23:49:12] [INFO ] Computed 19 invariants in 1 ms
[2025-05-31 23:49:12] [INFO ] [Real]Absence check using 19 positive place invariants in 2 ms returned sat
[2025-05-31 23:49:12] [INFO ] After 37ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2025-05-31 23:49:12] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-31 23:49:12] [INFO ] After 11ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 23:49:12] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 23:49:12] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2025-05-31 23:49:12] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-05-31 23:49:12] [INFO ] After 8ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 23:49:12] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-31 23:49:12] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-31 23:49:12] [INFO ] Flatten gal took : 5 ms
[2025-05-31 23:49:12] [INFO ] Flatten gal took : 5 ms
[2025-05-31 23:49:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13895284283596252249.gal : 1 ms
[2025-05-31 23:49:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality847417303656444143.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/ReachabilityCardinality13895284283596252249.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality847417303656444143.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 ...328
Loading property file /tmp/ReachabilityCardinality847417303656444143.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :16 after 48
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,480,0.030052,5724,2,289,8,1293,6,0,445,801,0
Total reachable state count : 480

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,8,0.03035,5724,2,69,8,1293,7,0,448,801,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,8,0.030492,5724,2,69,8,1293,8,0,449,801,0
Over-approximation ignoring read arcs solved 0 properties in 274 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for EisenbergMcGuire-PT-09-UpperBounds-08 in 147038 ms.
[2025-05-31 23:49:12] [INFO ] Flatten gal took : 74 ms
[2025-05-31 23:49:12] [INFO ] Applying decomposition
[2025-05-31 23:49:12] [INFO ] Flatten gal took : 78 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/graph13344115279877361289.txt' '-o' '/tmp/graph13344115279877361289.bin' '-w' '/tmp/graph13344115279877361289.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13344115279877361289.bin' '-l' '-1' '-v' '-w' '/tmp/graph13344115279877361289.weights' '-q' '0' '-e' '0.001'
[2025-05-31 23:49:12] [INFO ] Decomposing Gal with order
[2025-05-31 23:49:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:49:12] [INFO ] Removed a total of 6356 redundant transitions.
[2025-05-31 23:49:13] [INFO ] Flatten gal took : 189 ms
[2025-05-31 23:49:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 577 labels/synchronizations in 52 ms.
[2025-05-31 23:49:13] [INFO ] Time to serialize gal into /tmp/UpperBounds718569590513003463.gal : 24 ms
[2025-05-31 23:49:13] [INFO ] Time to serialize properties into /tmp/UpperBounds5125701296660998217.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/UpperBounds718569590513003463.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5125701296660998217.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 ...282
Loading property file /tmp/UpperBounds5125701296660998217.prop.
ITS-tools command line returned an error code 137
[2025-05-31 23:59:34] [INFO ] Applying decomposition
[2025-05-31 23:59:34] [INFO ] Flatten gal took : 72 ms
[2025-05-31 23:59:34] [INFO ] Decomposing Gal with order
[2025-05-31 23:59:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 23:59:34] [INFO ] Removed a total of 7598 redundant transitions.
[2025-05-31 23:59:34] [INFO ] Flatten gal took : 177 ms
[2025-05-31 23:59:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 347 labels/synchronizations in 43 ms.
[2025-05-31 23:59:34] [INFO ] Time to serialize gal into /tmp/UpperBounds12552245185441552747.gal : 16 ms
[2025-05-31 23:59:34] [INFO ] Time to serialize properties into /tmp/UpperBounds8537818476508541935.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/UpperBounds12552245185441552747.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8537818476508541935.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/UpperBounds8537818476508541935.prop.
ITS-tools command line returned an error code 137
[2025-06-01 00:07:29] [INFO ] Flatten gal took : 78 ms
[2025-06-01 00:07:29] [INFO ] Input system was already deterministic with 2907 transitions.
[2025-06-01 00:07:29] [INFO ] Transformed 486 places.
[2025-06-01 00:07:29] [INFO ] Transformed 2907 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-01 00:07:29] [INFO ] Time to serialize gal into /tmp/UpperBounds5955549112768296665.gal : 9 ms
[2025-06-01 00:07:29] [INFO ] Time to serialize properties into /tmp/UpperBounds16847237641015036961.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/UpperBounds5955549112768296665.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16847237641015036961.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 ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds16847237641015036961.prop.
ITS-tools command line returned an error code 137
Total runtime 2009171 ms.

BK_STOP 1748737009535

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="EisenbergMcGuire-PT-09"
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 EisenbergMcGuire-PT-09, 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 r083-tall-174860079800101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-09.tgz
mv EisenbergMcGuire-PT-09 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 ;