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.r069-smll-174854075900045.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 DES-PT-50b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-174854075900045
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 127K 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 DES-PT-50b-UpperBounds-00
FORMULA_NAME DES-PT-50b-UpperBounds-01
FORMULA_NAME DES-PT-50b-UpperBounds-02
FORMULA_NAME DES-PT-50b-UpperBounds-03
FORMULA_NAME DES-PT-50b-UpperBounds-04
FORMULA_NAME DES-PT-50b-UpperBounds-05
FORMULA_NAME DES-PT-50b-UpperBounds-06
FORMULA_NAME DES-PT-50b-UpperBounds-07
FORMULA_NAME DES-PT-50b-UpperBounds-08
FORMULA_NAME DES-PT-50b-UpperBounds-09
FORMULA_NAME DES-PT-50b-UpperBounds-10
FORMULA_NAME DES-PT-50b-UpperBounds-11
FORMULA_NAME DES-PT-50b-UpperBounds-12
FORMULA_NAME DES-PT-50b-UpperBounds-13
FORMULA_NAME DES-PT-50b-UpperBounds-14
FORMULA_NAME DES-PT-50b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748604488786

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 11:28:11] [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-30 11:28:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:28:11] [INFO ] Load time of PNML (sax parser for PT used): 246 ms
[2025-05-30 11:28:11] [INFO ] Transformed 479 places.
[2025-05-30 11:28:12] [INFO ] Transformed 430 transitions.
[2025-05-30 11:28:12] [INFO ] Found NUPN structural information;
[2025-05-30 11:28:12] [INFO ] Parsed PT model containing 479 places and 430 transitions and 1463 arcs in 514 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 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]
// Phase 1: matrix 430 rows 479 cols
[2025-05-30 11:28:12] [INFO ] Computed 65 invariants in 84 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 (84 resets) in 129 ms. (76 steps per ms)
FORMULA DES-PT-50b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80008 steps (95 resets) in 214 ms. (372 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-30 11:28:12] [INFO ] Invariant cache hit.
[2025-05-30 11:28:13] [INFO ] [Real]Absence check using 40 positive place invariants in 46 ms returned sat
[2025-05-30 11:28:13] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 51 ms returned sat
[2025-05-30 11:28:14] [INFO ] [Real]Absence check using state equation in 648 ms returned sat
[2025-05-30 11:28:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:28:14] [INFO ] [Nat]Absence check using 40 positive place invariants in 36 ms returned sat
[2025-05-30 11:28:14] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 43 ms returned sat
[2025-05-30 11:28:15] [INFO ] [Nat]Absence check using state equation in 608 ms returned sat
[2025-05-30 11:28:15] [INFO ] Deduced a trap composed of 24 places in 372 ms of which 60 ms to minimize.
[2025-05-30 11:28:16] [INFO ] Deduced a trap composed of 17 places in 420 ms of which 9 ms to minimize.
[2025-05-30 11:28:16] [INFO ] Deduced a trap composed of 17 places in 251 ms of which 6 ms to minimize.
[2025-05-30 11:28:16] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 3 ms to minimize.
[2025-05-30 11:28:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1414 ms
[2025-05-30 11:28:16] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 76 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-30 11:28:19] [INFO ] [Real]Absence check using 40 positive place invariants in 39 ms returned sat
[2025-05-30 11:28:19] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 45 ms returned sat
[2025-05-30 11:28:19] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2025-05-30 11:28:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:28:20] [INFO ] [Nat]Absence check using 40 positive place invariants in 40 ms returned sat
[2025-05-30 11:28:20] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 40 ms returned sat
[2025-05-30 11:28:20] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2025-05-30 11:28:21] [INFO ] Deduced a trap composed of 7 places in 456 ms of which 9 ms to minimize.
[2025-05-30 11:28:21] [INFO ] Deduced a trap composed of 17 places in 404 ms of which 9 ms to minimize.
[2025-05-30 11:28:21] [INFO ] Deduced a trap composed of 41 places in 268 ms of which 6 ms to minimize.
[2025-05-30 11:28:22] [INFO ] Deduced a trap composed of 40 places in 268 ms of which 5 ms to minimize.
[2025-05-30 11:28:22] [INFO ] Deduced a trap composed of 37 places in 252 ms of which 4 ms to minimize.
[2025-05-30 11:28:22] [INFO ] Deduced a trap composed of 50 places in 197 ms of which 4 ms to minimize.
[2025-05-30 11:28:23] [INFO ] Deduced a trap composed of 59 places in 275 ms of which 5 ms to minimize.
[2025-05-30 11:28:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2367 ms
[2025-05-30 11:28:23] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 39 ms.
[2025-05-30 11:28:25] [INFO ] Added : 190 causal constraints over 38 iterations in 1990 ms. Result :unknown
[2025-05-30 11:28:25] [INFO ] [Real]Absence check using 40 positive place invariants in 38 ms returned sat
[2025-05-30 11:28:25] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 45 ms returned sat
[2025-05-30 11:28:25] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2025-05-30 11:28:26] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 4 ms to minimize.
[2025-05-30 11:28:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:28:26] [INFO ] [Nat]Absence check using 40 positive place invariants in 38 ms returned sat
[2025-05-30 11:28:26] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 44 ms returned sat
[2025-05-30 11:28:26] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2025-05-30 11:28:27] [INFO ] Deduced a trap composed of 28 places in 289 ms of which 6 ms to minimize.
[2025-05-30 11:28:27] [INFO ] Deduced a trap composed of 15 places in 294 ms of which 6 ms to minimize.
[2025-05-30 11:28:27] [INFO ] Deduced a trap composed of 15 places in 323 ms of which 5 ms to minimize.
[2025-05-30 11:28:28] [INFO ] Deduced a trap composed of 10 places in 323 ms of which 6 ms to minimize.
[2025-05-30 11:28:28] [INFO ] Deduced a trap composed of 29 places in 240 ms of which 6 ms to minimize.
[2025-05-30 11:28:28] [INFO ] Deduced a trap composed of 31 places in 301 ms of which 6 ms to minimize.
[2025-05-30 11:28:29] [INFO ] Deduced a trap composed of 46 places in 296 ms of which 6 ms to minimize.
[2025-05-30 11:28:29] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 4 ms to minimize.
[2025-05-30 11:28:29] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 3 ms to minimize.
[2025-05-30 11:28:29] [INFO ] Deduced a trap composed of 20 places in 267 ms of which 4 ms to minimize.
[2025-05-30 11:28:30] [INFO ] Deduced a trap composed of 12 places in 365 ms of which 6 ms to minimize.
[2025-05-30 11:28:30] [INFO ] Deduced a trap composed of 30 places in 189 ms of which 4 ms to minimize.
[2025-05-30 11:28:30] [INFO ] Deduced a trap composed of 39 places in 222 ms of which 3 ms to minimize.
[2025-05-30 11:28:31] [INFO ] Deduced a trap composed of 34 places in 249 ms of which 5 ms to minimize.
[2025-05-30 11:28:31] [INFO ] Deduced a trap composed of 18 places in 248 ms of which 14 ms to minimize.
[2025-05-30 11:28:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-30 11:28:31] [INFO ] [Real]Absence check using 40 positive place invariants in 41 ms returned sat
[2025-05-30 11:28:31] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 43 ms returned sat
[2025-05-30 11:28:31] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2025-05-30 11:28:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:28:32] [INFO ] [Nat]Absence check using 40 positive place invariants in 39 ms returned sat
[2025-05-30 11:28:32] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 44 ms returned sat
[2025-05-30 11:28:32] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2025-05-30 11:28:33] [INFO ] Deduced a trap composed of 32 places in 293 ms of which 5 ms to minimize.
[2025-05-30 11:28:33] [INFO ] Deduced a trap composed of 42 places in 253 ms of which 7 ms to minimize.
[2025-05-30 11:28:33] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 3 ms to minimize.
[2025-05-30 11:28:33] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 4 ms to minimize.
[2025-05-30 11:28:33] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 4 ms to minimize.
[2025-05-30 11:28:34] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 4 ms to minimize.
[2025-05-30 11:28:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1467 ms
[2025-05-30 11:28:34] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 46 ms.
[2025-05-30 11:28:36] [INFO ] Deduced a trap composed of 13 places in 320 ms of which 8 ms to minimize.
[2025-05-30 11:28:37] [INFO ] Deduced a trap composed of 14 places in 334 ms of which 6 ms to minimize.
[2025-05-30 11:28:37] [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 3
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.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
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-30 11:28:37] [INFO ] [Real]Absence check using 40 positive place invariants in 37 ms returned sat
[2025-05-30 11:28:37] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 29 ms returned sat
[2025-05-30 11:28:37] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2025-05-30 11:28:37] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 5 ms to minimize.
[2025-05-30 11:28:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:28:38] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2025-05-30 11:28:38] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 33 ms returned sat
[2025-05-30 11:28:38] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2025-05-30 11:28:38] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 4 ms to minimize.
[2025-05-30 11:28:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2025-05-30 11:28:38] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 51 ms.
[2025-05-30 11:28:41] [INFO ] Deduced a trap composed of 44 places in 195 ms of which 3 ms to minimize.
[2025-05-30 11:28:41] [INFO ] Deduced a trap composed of 63 places in 184 ms of which 4 ms to minimize.
[2025-05-30 11:28:41] [INFO ] Deduced a trap composed of 51 places in 165 ms of which 3 ms to minimize.
[2025-05-30 11:28:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 722 ms
[2025-05-30 11:28:41] [INFO ] Added : 244 causal constraints over 50 iterations in 3155 ms. Result :sat
Minimization took 506 ms.
[2025-05-30 11:28:42] [INFO ] [Real]Absence check using 40 positive place invariants in 26 ms returned sat
[2025-05-30 11:28:42] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 29 ms returned sat
[2025-05-30 11:28:42] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2025-05-30 11:28:43] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 4 ms to minimize.
[2025-05-30 11:28:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:28:43] [INFO ] [Nat]Absence check using 40 positive place invariants in 34 ms returned sat
[2025-05-30 11:28:43] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 31 ms returned sat
[2025-05-30 11:28:43] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2025-05-30 11:28:43] [INFO ] Deduced a trap composed of 17 places in 276 ms of which 5 ms to minimize.
[2025-05-30 11:28:44] [INFO ] Deduced a trap composed of 60 places in 237 ms of which 5 ms to minimize.
[2025-05-30 11:28:44] [INFO ] Deduced a trap composed of 22 places in 252 ms of which 4 ms to minimize.
[2025-05-30 11:28:44] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 4 ms to minimize.
[2025-05-30 11:28:45] [INFO ] Deduced a trap composed of 20 places in 271 ms of which 4 ms to minimize.
[2025-05-30 11:28:45] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 3 ms to minimize.
[2025-05-30 11:28:45] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 4 ms to minimize.
[2025-05-30 11:28:45] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 3 ms to minimize.
[2025-05-30 11:28:45] [INFO ] Deduced a trap composed of 76 places in 215 ms of which 4 ms to minimize.
[2025-05-30 11:28:45] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 6 ms to minimize.
[2025-05-30 11:28:46] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 4 ms to minimize.
[2025-05-30 11:28:46] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 2 ms to minimize.
[2025-05-30 11:28:46] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2668 ms
[2025-05-30 11:28:46] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 33 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-30 11:28:48] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2025-05-30 11:28:48] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 32 ms returned sat
[2025-05-30 11:28:48] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2025-05-30 11:28:48] [INFO ] Deduced a trap composed of 22 places in 245 ms of which 4 ms to minimize.
[2025-05-30 11:28:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:28:49] [INFO ] [Nat]Absence check using 40 positive place invariants in 32 ms returned sat
[2025-05-30 11:28:49] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 30 ms returned sat
[2025-05-30 11:28:49] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2025-05-30 11:28:49] [INFO ] Deduced a trap composed of 14 places in 210 ms of which 5 ms to minimize.
[2025-05-30 11:28:49] [INFO ] Deduced a trap composed of 20 places in 193 ms of which 8 ms to minimize.
[2025-05-30 11:28:50] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 4 ms to minimize.
[2025-05-30 11:28:50] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 4 ms to minimize.
[2025-05-30 11:28:50] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 4 ms to minimize.
[2025-05-30 11:28:50] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 4 ms to minimize.
[2025-05-30 11:28:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1252 ms
[2025-05-30 11:28:50] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 41 ms.
[2025-05-30 11:28:54] [INFO ] Added : 272 causal constraints over 55 iterations in 3268 ms. Result :unknown
[2025-05-30 11:28:54] [INFO ] [Real]Absence check using 40 positive place invariants in 38 ms returned sat
[2025-05-30 11:28:54] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 46 ms returned sat
[2025-05-30 11:28:54] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2025-05-30 11:28:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:28:54] [INFO ] [Nat]Absence check using 40 positive place invariants in 26 ms returned sat
[2025-05-30 11:28:55] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 29 ms returned sat
[2025-05-30 11:28:55] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2025-05-30 11:28:55] [INFO ] Deduced a trap composed of 38 places in 379 ms of which 10 ms to minimize.
[2025-05-30 11:28:56] [INFO ] Deduced a trap composed of 41 places in 369 ms of which 7 ms to minimize.
[2025-05-30 11:28:56] [INFO ] Deduced a trap composed of 61 places in 353 ms of which 6 ms to minimize.
[2025-05-30 11:28:56] [INFO ] Deduced a trap composed of 50 places in 349 ms of which 7 ms to minimize.
[2025-05-30 11:28:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1580 ms
[2025-05-30 11:28:56] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 50 ms.
[2025-05-30 11:28:59] [INFO ] Added : 235 causal constraints over 47 iterations in 2882 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 479 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 479/479 places, 430/430 transitions.
Graph (complete) has 1098 edges and 479 vertex of which 472 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 472 transition count 403
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 451 transition count 403
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 451 transition count 394
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 442 transition count 394
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 423 transition count 375
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 423 transition count 375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 423 transition count 374
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 422 transition count 374
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 407 transition count 359
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 407 transition count 359
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 407 transition count 344
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 405 transition count 343
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 405 transition count 340
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 402 transition count 340
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 325 transition count 263
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 323 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 323 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 322 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 321 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 320 transition count 263
Applied a total of 319 rules in 513 ms. Remains 320 /479 variables (removed 159) and now considering 263/430 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 534 ms. Remains : 320/479 places, 263/430 transitions.
// Phase 1: matrix 263 rows 320 cols
[2025-05-30 11:29:02] [INFO ] Computed 63 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (47803 resets) in 2686 ms. (372 steps per ms)
BEST_FIRST walk for 8000005 steps (72524 resets) in 10429 ms. (767 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-30 11:29:15] [INFO ] Invariant cache hit.
[2025-05-30 11:29:15] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2025-05-30 11:29:15] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 26 ms returned sat
[2025-05-30 11:29:16] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2025-05-30 11:29:16] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 ms to minimize.
[2025-05-30 11:29:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:29:16] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2025-05-30 11:29:16] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 43 ms returned sat
[2025-05-30 11:29:16] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2025-05-30 11:29:16] [INFO ] Computed and/alt/rep : 249/442/249 causal constraints (skipped 11 transitions) in 23 ms.
[2025-05-30 11:29:17] [INFO ] Added : 197 causal constraints over 40 iterations in 1011 ms. Result :sat
Minimization took 308 ms.
[2025-05-30 11:29:17] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2025-05-30 11:29:17] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 43 ms returned sat
[2025-05-30 11:29:18] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2025-05-30 11:29:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:29:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2025-05-30 11:29:18] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 46 ms returned sat
[2025-05-30 11:29:18] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2025-05-30 11:29:18] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2025-05-30 11:29:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2025-05-30 11:29:18] [INFO ] Computed and/alt/rep : 249/442/249 causal constraints (skipped 11 transitions) in 30 ms.
[2025-05-30 11:29:19] [INFO ] Added : 123 causal constraints over 25 iterations in 920 ms. Result :sat
Minimization took 289 ms.
[2025-05-30 11:29:20] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2025-05-30 11:29:20] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 44 ms returned sat
[2025-05-30 11:29:20] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2025-05-30 11:29:20] [INFO ] Computed and/alt/rep : 249/442/249 causal constraints (skipped 11 transitions) in 31 ms.
[2025-05-30 11:29:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:29:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2025-05-30 11:29:20] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 42 ms returned sat
[2025-05-30 11:29:21] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2025-05-30 11:29:21] [INFO ] Computed and/alt/rep : 249/442/249 causal constraints (skipped 11 transitions) in 30 ms.
[2025-05-30 11:29:22] [INFO ] Added : 245 causal constraints over 49 iterations in 1434 ms. Result :sat
Minimization took 204 ms.
[2025-05-30 11:29:22] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2025-05-30 11:29:22] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 24 ms returned sat
[2025-05-30 11:29:22] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2025-05-30 11:29:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:29:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2025-05-30 11:29:23] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 22 ms returned sat
[2025-05-30 11:29:23] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2025-05-30 11:29:23] [INFO ] Computed and/alt/rep : 249/442/249 causal constraints (skipped 11 transitions) in 20 ms.
[2025-05-30 11:29:23] [INFO ] Added : 67 causal constraints over 14 iterations in 337 ms. Result :sat
Minimization took 168 ms.
[2025-05-30 11:29:23] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2025-05-30 11:29:23] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 38 ms returned sat
[2025-05-30 11:29:24] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2025-05-30 11:29:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:29:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2025-05-30 11:29:24] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 43 ms returned sat
[2025-05-30 11:29:24] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2025-05-30 11:29:24] [INFO ] Computed and/alt/rep : 249/442/249 causal constraints (skipped 11 transitions) in 30 ms.
[2025-05-30 11:29:25] [INFO ] Added : 73 causal constraints over 15 iterations in 565 ms. Result :sat
Minimization took 305 ms.
[2025-05-30 11:29:25] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2025-05-30 11:29:25] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 42 ms returned sat
[2025-05-30 11:29:25] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2025-05-30 11:29:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:29:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2025-05-30 11:29:26] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 40 ms returned sat
[2025-05-30 11:29:26] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2025-05-30 11:29:26] [INFO ] Computed and/alt/rep : 249/442/249 causal constraints (skipped 11 transitions) in 26 ms.
[2025-05-30 11:29:27] [INFO ] Added : 134 causal constraints over 27 iterations in 747 ms. Result :sat
Minimization took 187 ms.
[2025-05-30 11:29:27] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2025-05-30 11:29:27] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 44 ms returned sat
[2025-05-30 11:29:27] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2025-05-30 11:29:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:29:27] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2025-05-30 11:29:27] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 44 ms returned sat
[2025-05-30 11:29:28] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2025-05-30 11:29:28] [INFO ] Computed and/alt/rep : 249/442/249 causal constraints (skipped 11 transitions) in 30 ms.
[2025-05-30 11:29:28] [INFO ] Added : 90 causal constraints over 18 iterations in 637 ms. Result :sat
Minimization took 267 ms.
[2025-05-30 11:29:29] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2025-05-30 11:29:29] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 45 ms returned sat
[2025-05-30 11:29:29] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2025-05-30 11:29:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:29:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2025-05-30 11:29:29] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 43 ms returned sat
[2025-05-30 11:29:29] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2025-05-30 11:29:30] [INFO ] Computed and/alt/rep : 249/442/249 causal constraints (skipped 11 transitions) in 30 ms.
[2025-05-30 11:29:30] [INFO ] Added : 111 causal constraints over 23 iterations in 817 ms. Result :sat
Minimization took 277 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 263/263 transitions.
Applied a total of 0 rules in 19 ms. Remains 320 /320 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 320/320 places, 263/263 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 263/263 transitions.
Applied a total of 0 rules in 17 ms. Remains 320 /320 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2025-05-30 11:29:33] [INFO ] Invariant cache hit.
[2025-05-30 11:29:34] [INFO ] Implicit Places using invariants in 451 ms returned []
[2025-05-30 11:29:34] [INFO ] Invariant cache hit.
[2025-05-30 11:29:35] [INFO ] Implicit Places using invariants and state equation in 911 ms returned []
Implicit Place search using SMT with State Equation took 1366 ms to find 0 implicit places.
[2025-05-30 11:29:35] [INFO ] Redundant transitions in 23 ms returned []
Running 260 sub problems to find dead transitions.
[2025-05-30 11:29:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 3/320 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 263/583 variables, 320/383 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2025-05-30 11:29:48] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2025-05-30 11:29:48] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 3 ms to minimize.
[2025-05-30 11:29:48] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 3/386 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2025-05-30 11:29:54] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 5 ms to minimize.
[2025-05-30 11:29:55] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 4 ms to minimize.
[2025-05-30 11:29:55] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2025-05-30 11:29:55] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 4/390 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2025-05-30 11:30:03] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 (/ 2.0 25.0))
(s51 (/ 23.0 25.0))
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 1.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 583/583 variables, and 391 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 3/320 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 263/583 variables, 320/391 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 260/651 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/583 variables, and 651 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints]
After SMT, in 60706ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60732ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62171 ms. Remains : 320/320 places, 263/263 transitions.
RANDOM walk for 40000 steps (1909 resets) in 1547 ms. (25 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (34 resets) in 105 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (32 resets) in 59 ms. (66 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (34 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (36 resets) in 79 ms. (50 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (34 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (40 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (40 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (39 resets) in 48 ms. (81 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (31 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (42 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (37 resets) in 57 ms. (69 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (28 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (42 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (32 resets) in 55 ms. (71 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (37 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (37 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
[2025-05-30 11:30:36] [INFO ] Flatten gal took : 245 ms
[2025-05-30 11:30:36] [INFO ] Flatten gal took : 58 ms
[2025-05-30 11:30:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12102801136455521232.gal : 28 ms
[2025-05-30 11:30:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4757716903725824632.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/ReachabilityCardinality12102801136455521232.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4757716903725824632.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/ReachabilityCardinality4757716903725824632.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :4 after 32
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :32 after 36
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :36 after 58
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :58 after 1240
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :1240 after 2044
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :2044 after 8104
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :8104 after 85336
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :197648 after 264832
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :264832 after 629648
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :1.84298e+06 after 2.00111e+09
Interrupted probabilistic random walk after 296708 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :8 out of 16
Probabilistic random walk after 296708 steps, saw 75532 distinct states, run finished after 3007 ms. (steps per millisecond=98 ) properties seen :8
[2025-05-30 11:30:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 186/190 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 35/225 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 76/301 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 7/308 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 259/567 variables, 308/366 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 14/581 variables, 10/376 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-30 11:30:41] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 2 ms to minimize.
[2025-05-30 11:30:41] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/581 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,16 properties remain. new max is 16384
At refinement iteration 15 (OVERLAPS) 2/583 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD size :2.00111e+09 after 2.089e+09
At refinement iteration 16 (INCLUDED_ONLY) 0/583 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/583 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/583 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 583/583 variables, and 385 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2245 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 186/190 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 35/225 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-30 11:30:42] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 76/301 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 7/308 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 259/567 variables, 308/369 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/567 variables, 8/377 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/567 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 14/581 variables, 10/387 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/581 variables, 4/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/581 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 2/583 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/583 variables, 2/394 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/583 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :2.335e+09 after 2.79672e+09
At refinement iteration 21 (OVERLAPS) 0/583 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 583/583 variables, and 394 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2605 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 4862ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
SDD proceeding with computation,16 properties remain. new max is 65536
SDD size :2.85325e+09 after 2.29388e+10
Parikh walk visited 0 properties in 16855 ms.
Support contains 4 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 263/263 transitions.
Applied a total of 0 rules in 25 ms. Remains 320 /320 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 320/320 places, 263/263 transitions.
RANDOM walk for 40000 steps (1890 resets) in 262 ms. (152 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (356 resets) in 134 ms. (296 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (354 resets) in 143 ms. (277 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (352 resets) in 140 ms. (283 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (356 resets) in 232 ms. (171 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (368 resets) in 202 ms. (197 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (361 resets) in 181 ms. (219 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (355 resets) in 242 ms. (164 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (363 resets) in 189 ms. (210 steps per ms) remains 8/8 properties
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
Interrupted probabilistic random walk after 341708 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 8
Probabilistic random walk after 341708 steps, saw 86735 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
[2025-05-30 11:31:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 186/190 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 35/225 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 76/301 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 7/308 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 259/567 variables, 308/366 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 14/581 variables, 10/376 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-30 11:31:06] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 3 ms to minimize.
[2025-05-30 11:31:06] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/581 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 2/583 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/583 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/583 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/583 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 583/583 variables, and 385 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1867 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 186/190 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 35/225 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-30 11:31:07] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
SDD proceeding with computation,14 properties remain. new max is 65536
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 76/301 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 7/308 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD size :2.67828e+10 after 9.15915e+10
At refinement iteration 12 (OVERLAPS) 259/567 variables, 308/369 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/567 variables, 8/377 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/567 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 14/581 variables, 10/387 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/581 variables, 4/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/581 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 2/583 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/583 variables, 2/394 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/583 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 0/583 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 583/583 variables, and 394 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2183 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 4064ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
SDD proceeding with computation,14 properties remain. new max is 131072
SDD size :1.01254e+11 after 2.31171e+11
Detected timeout of ITS tools.
Parikh walk visited 0 properties in 17783 ms.
Support contains 4 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 263/263 transitions.
Applied a total of 0 rules in 16 ms. Remains 320 /320 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 320/320 places, 263/263 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 263/263 transitions.
[2025-05-30 11:31:27] [INFO ] Flatten gal took : 39 ms
[2025-05-30 11:31:27] [INFO ] Applying decomposition
Applied a total of 0 rules in 15 ms. Remains 320 /320 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2025-05-30 11:31:27] [INFO ] Invariant cache hit.
[2025-05-30 11:31:27] [INFO ] Flatten gal took : 35 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/graph997278429589294900.txt' '-o' '/tmp/graph997278429589294900.bin' '-w' '/tmp/graph997278429589294900.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph997278429589294900.bin' '-l' '-1' '-v' '-w' '/tmp/graph997278429589294900.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:31:27] [INFO ] Decomposing Gal with order
[2025-05-30 11:31:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:31:27] [INFO ] Removed a total of 44 redundant transitions.
[2025-05-30 11:31:27] [INFO ] Flatten gal took : 85 ms
[2025-05-30 11:31:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 13 ms.
[2025-05-30 11:31:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1265645371754142514.gal : 9 ms
[2025-05-30 11:31:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16110988523902950367.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/ReachabilityCardinality1265645371754142514.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16110988523902950367.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/ReachabilityCardinality16110988523902950367.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 14
[2025-05-30 11:31:27] [INFO ] Implicit Places using invariants in 528 ms returned []
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :14 after 2066
[2025-05-30 11:31:27] [INFO ] Invariant cache hit.
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :2066 after 2066
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :2066 after 34360
[2025-05-30 11:31:28] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
[2025-05-30 11:31:28] [INFO ] Redundant transitions in 4 ms returned []
Running 260 sub problems to find dead transitions.
[2025-05-30 11:31:28] [INFO ] Invariant cache hit.
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :50736 after 1.71761e+09
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :1.71761e+09 after 3.24608e+09
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :3.24608e+09 after 5.11422e+09
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :5.11422e+09 after 2.13517e+10
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 3/320 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 263/583 variables, 320/383 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2025-05-30 11:31:38] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 13 ms to minimize.
[2025-05-30 11:31:38] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 3 ms to minimize.
[2025-05-30 11:31:38] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 3/386 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2025-05-30 11:31:45] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 3 ms to minimize.
[2025-05-30 11:31:45] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 3 ms to minimize.
[2025-05-30 11:31:45] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2025-05-30 11:31:45] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 4/390 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2025-05-30 11:31:52] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.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 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 (/ 1.0 2.0))
(s88 (/ 1.0 2.0))
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 (/ 1.0 2.0))
(s189 (/ 1.0 2.0))
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/583 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 583/583 variables, and 391 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 3/320 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 263/583 variables, 320/391 constraints. Problems are: Problem set: 0 solved, 260 unsolved
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :2.87737e+13 after 2.9673e+13
Invariant property MIN5 does not hold.
Reachability property MAX5 is true.
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5.77817e+13 after 5.8681e+13
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\_mod\_flat,6.90188e+13,49.0198,843112,19288,10085,866017,20337,308,7.20518e+06,433,253736,0
Total reachable state count : 69018791059726

Verifying 8 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,1.31005e+07,49.1845,843112,325,706,866017,20337,310,7.20518e+06,436,253736,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,1.31005e+07,49.2282,843112,325,706,866017,20337,314,7.20518e+06,438,253736,0
Reachability property MAX1 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
MAX1,2.31907e+11,49.2321,843112,961,680,866017,20337,316,7.20518e+06,440,253736,0
Invariant property MIN1 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
MIN1,2.31907e+11,49.2349,843112,961,680,866017,20337,320,7.20518e+06,442,253736,0
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,2.13868e+11,49.2427,843112,2469,926,866017,20337,320,7.20518e+06,443,253736,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,2.13868e+11,49.2506,843112,2469,926,866017,20337,322,7.20518e+06,444,253736,0
Reachability property MAX5 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
MAX5,7.3158e+11,49.2613,843112,3463,1004,866017,20337,324,7.20518e+06,446,253736,0
Invariant property MIN5 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
MIN5,7.3158e+11,49.2713,843112,3463,1004,866017,20337,328,7.20518e+06,448,253736,0
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 260/651 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/583 variables, and 651 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints]
After SMT, in 60344ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60348ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61510 ms. Remains : 320/320 places, 263/263 transitions.
FORMULA DES-PT-50b-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50b-UpperBounds-08 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50b-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50b-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50b-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50b-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50b-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50b-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 8 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 257140 ms.

BK_STOP 1748604748655

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-50b"
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 DES-PT-50b, 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 r069-smll-174854075900045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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