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.r153-tall-174876824800074.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 Peterson-COL-7, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-174876824800074
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 119K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 47K 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 Peterson-COL-7-UpperBounds-00
FORMULA_NAME Peterson-COL-7-UpperBounds-01
FORMULA_NAME Peterson-COL-7-UpperBounds-02
FORMULA_NAME Peterson-COL-7-UpperBounds-03
FORMULA_NAME Peterson-COL-7-UpperBounds-04
FORMULA_NAME Peterson-COL-7-UpperBounds-05
FORMULA_NAME Peterson-COL-7-UpperBounds-06
FORMULA_NAME Peterson-COL-7-UpperBounds-07
FORMULA_NAME Peterson-COL-7-UpperBounds-08
FORMULA_NAME Peterson-COL-7-UpperBounds-09
FORMULA_NAME Peterson-COL-7-UpperBounds-10
FORMULA_NAME Peterson-COL-7-UpperBounds-11
FORMULA_NAME Peterson-COL-7-UpperBounds-12
FORMULA_NAME Peterson-COL-7-UpperBounds-13
FORMULA_NAME Peterson-COL-7-UpperBounds-14
FORMULA_NAME Peterson-COL-7-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748841535185

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-7
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 05:18:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 05:18:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:18:56] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 05:18:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 05:18:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 564 ms
[2025-06-02 05:18:57] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 2048 PT places and 3384.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Reduction of identical properties reduced properties to check from 16 to 8
[2025-06-02 05:18:57] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 4 ms.
[2025-06-02 05:18:57] [INFO ] Skeletonized 8 HLPN properties in 0 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2025-06-02 05:18:57] [INFO ] Computed 1 invariants in 6 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 8, 0, 0, 7, 8, 0, 0] Max Struct:[8, 8, 8, 8, 7, 8, 8, 8]
FORMULA Peterson-COL-7-UpperBounds-07 8 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-7-UpperBounds-11 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-7-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-7-UpperBounds-02 8 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-7-UpperBounds-14 8 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-7-UpperBounds-01 8 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 05:18:57] [INFO ] Invariant cache hit.
[2025-06-02 05:18:57] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2025-06-02 05:18:57] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 05:18:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 05:18:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:57] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 05:18:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:57] [INFO ] Added : 11 causal constraints over 4 iterations in 24 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 05:18:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:57] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:18:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 05:18:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:57] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-02 05:18:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 05:18:57] [INFO ] Added : 11 causal constraints over 4 iterations in 29 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 05:18:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:57] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:18:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:18:57] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-02 05:18:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:18:57] [INFO ] Added : 12 causal constraints over 4 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 05:18:57] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-02 05:18:57] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:18:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:18:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:57] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-02 05:18:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:18:57] [INFO ] Added : 11 causal constraints over 5 iterations in 13 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 05:18:57] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:18:57] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:18:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:18:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:18:57] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:18:57] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:18:57] [INFO ] Added : 11 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8]
Domain [Process(8), Tour(7), Process(8)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 7)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-02 05:18:57] [INFO ] Unfolded HLPN to a Petri net with 2048 places and 3208 transitions 10032 arcs in 67 ms.
[2025-06-02 05:18:57] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Deduced a syphon composed of 56 places in 18 ms
Reduce places removed 56 places and 112 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8]
[2025-06-02 05:18:58] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2025-06-02 05:18:58] [INFO ] Computed 31 invariants in 38 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[8, 8, 8, 8, 8]
RANDOM walk for 10000 steps (2 resets) in 196 ms. (50 steps per ms)
FORMULA Peterson-COL-7-UpperBounds-04 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-7-UpperBounds-09 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-7-UpperBounds-13 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-7-UpperBounds-03 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 1, 7, 4] Max Struct:[8, 8, 8, 8]
[2025-06-02 05:18:58] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2025-06-02 05:18:58] [INFO ] Invariant cache hit.
[2025-06-02 05:18:58] [INFO ] [Real]Absence check using 23 positive place invariants in 46 ms returned sat
[2025-06-02 05:18:58] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 14 ms returned sat
[2025-06-02 05:19:00] [INFO ] [Real]Absence check using state equation in 1164 ms returned sat
[2025-06-02 05:19:00] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 05:19:00] [INFO ] [Real]Added 497 Read/Feed constraints in 251 ms returned sat
[2025-06-02 05:19:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:00] [INFO ] [Nat]Absence check using 23 positive place invariants in 36 ms returned sat
[2025-06-02 05:19:00] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2025-06-02 05:19:01] [INFO ] [Nat]Absence check using state equation in 1084 ms returned sat
[2025-06-02 05:19:02] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 05:19:02] [INFO ] [Nat]Added 497 Read/Feed constraints in 809 ms returned sat
[2025-06-02 05:19:03] [INFO ] Deduced a trap composed of 40 places in 1076 ms of which 103 ms to minimize.
[2025-06-02 05:19:04] [INFO ] Deduced a trap composed of 33 places in 960 ms of which 12 ms to minimize.
[2025-06-02 05:19:05] [INFO ] Deduced a trap composed of 40 places in 988 ms of which 13 ms to minimize.
[2025-06-02 05:19:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-02 05:19:06] [INFO ] [Real]Absence check using 23 positive place invariants in 50 ms returned sat
[2025-06-02 05:19:06] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 15 ms returned sat
[2025-06-02 05:19:07] [INFO ] [Real]Absence check using state equation in 889 ms returned sat
[2025-06-02 05:19:07] [INFO ] [Real]Added 497 Read/Feed constraints in 152 ms returned sat
[2025-06-02 05:19:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:07] [INFO ] [Nat]Absence check using 23 positive place invariants in 35 ms returned sat
[2025-06-02 05:19:07] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2025-06-02 05:19:08] [INFO ] [Nat]Absence check using state equation in 912 ms returned sat
[2025-06-02 05:19:09] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 05:19:09] [INFO ] [Nat]Added 497 Read/Feed constraints in 1035 ms returned unknown
[2025-06-02 05:19:09] [INFO ] [Real]Absence check using 23 positive place invariants in 45 ms returned sat
[2025-06-02 05:19:09] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2025-06-02 05:19:11] [INFO ] [Real]Absence check using state equation in 1205 ms returned sat
[2025-06-02 05:19:11] [INFO ] [Real]Added 497 Read/Feed constraints in 159 ms returned sat
[2025-06-02 05:19:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:11] [INFO ] [Nat]Absence check using 23 positive place invariants in 37 ms returned sat
[2025-06-02 05:19:11] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2025-06-02 05:19:12] [INFO ] [Nat]Absence check using state equation in 1138 ms returned sat
[2025-06-02 05:19:13] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 05:19:13] [INFO ] [Nat]Added 497 Read/Feed constraints in 892 ms returned sat
[2025-06-02 05:19:14] [INFO ] Computed and/alt/rep : 2640/5840/2640 causal constraints (skipped 112 transitions) in 309 ms.
[2025-06-02 05:19:16] [INFO ] Added : 50 causal constraints over 10 iterations in 2567 ms. Result :unknown
[2025-06-02 05:19:16] [INFO ] [Real]Absence check using 23 positive place invariants in 36 ms returned sat
[2025-06-02 05:19:16] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 15 ms returned sat
[2025-06-02 05:19:17] [INFO ] [Real]Absence check using state equation in 860 ms returned sat
[2025-06-02 05:19:17] [INFO ] [Real]Added 497 Read/Feed constraints in 140 ms returned sat
[2025-06-02 05:19:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:18] [INFO ] [Nat]Absence check using 23 positive place invariants in 37 ms returned sat
[2025-06-02 05:19:18] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 14 ms returned sat
[2025-06-02 05:19:18] [INFO ] [Nat]Absence check using state equation in 736 ms returned sat
[2025-06-02 05:19:19] [INFO ] [Nat]Added 497 Read/Feed constraints in 444 ms returned sat
[2025-06-02 05:19:19] [INFO ] Computed and/alt/rep : 2640/5840/2640 causal constraints (skipped 112 transitions) in 176 ms.
[2025-06-02 05:19:22] [INFO ] Added : 70 causal constraints over 14 iterations in 3445 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[7, 1, 7, 4] Max Struct:[8, 8, 8, 8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 1, 8, 5] Max Struct:[8, 8, 8, 8]
Support contains 568 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 1992 transition count 2704
Reduce places removed 392 places and 0 transitions.
Performed 392 Post agglomeration using F-continuation condition.Transition count delta: 392
Iterating post reduction 1 with 784 rules applied. Total rules applied 1176 place count 1600 transition count 2312
Reduce places removed 392 places and 0 transitions.
Iterating post reduction 2 with 392 rules applied. Total rules applied 1568 place count 1208 transition count 2312
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 1568 place count 1208 transition count 2256
Deduced a syphon composed of 56 places in 4 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 1680 place count 1152 transition count 2256
Applied a total of 1680 rules in 542 ms. Remains 1152 /1992 variables (removed 840) and now considering 2256/3096 (removed 840) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 567 ms. Remains : 1152/1992 places, 2256/3096 transitions.
[2025-06-02 05:19:26] [INFO ] Flow matrix only has 1920 transitions (discarded 336 similar events)
// Phase 1: matrix 1920 rows 1152 cols
[2025-06-02 05:19:26] [INFO ] Computed 31 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7, 1, 8, 5] Max Struct:[8, 8, 8, 8]
FORMULA Peterson-COL-7-UpperBounds-08 8 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 8895 ms. (112 steps per ms)
BEST_FIRST walk for 2694255 steps (6 resets) in 8272 ms. (325 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 1, 6] Max Struct:[8, 8, 8]
[2025-06-02 05:19:43] [INFO ] Flow matrix only has 1920 transitions (discarded 336 similar events)
[2025-06-02 05:19:43] [INFO ] Invariant cache hit.
[2025-06-02 05:19:43] [INFO ] [Real]Absence check using 23 positive place invariants in 23 ms returned sat
[2025-06-02 05:19:43] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 20 ms returned sat
[2025-06-02 05:19:44] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2025-06-02 05:19:44] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 05:19:44] [INFO ] [Real]Added 497 Read/Feed constraints in 134 ms returned sat
[2025-06-02 05:19:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:44] [INFO ] [Nat]Absence check using 23 positive place invariants in 22 ms returned sat
[2025-06-02 05:19:44] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-02 05:19:45] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2025-06-02 05:19:45] [INFO ] [Nat]Added 497 Read/Feed constraints in 326 ms returned sat
[2025-06-02 05:19:45] [INFO ] Deduced a trap composed of 22 places in 403 ms of which 6 ms to minimize.
[2025-06-02 05:19:46] [INFO ] Deduced a trap composed of 25 places in 423 ms of which 5 ms to minimize.
[2025-06-02 05:19:46] [INFO ] Deduced a trap composed of 25 places in 413 ms of which 7 ms to minimize.
[2025-06-02 05:19:47] [INFO ] Deduced a trap composed of 21 places in 425 ms of which 6 ms to minimize.
[2025-06-02 05:19:47] [INFO ] Deduced a trap composed of 21 places in 418 ms of which 6 ms to minimize.
[2025-06-02 05:19:48] [INFO ] Deduced a trap composed of 25 places in 419 ms of which 5 ms to minimize.
[2025-06-02 05:19:48] [INFO ] Deduced a trap composed of 25 places in 423 ms of which 6 ms to minimize.
[2025-06-02 05:19:49] [INFO ] Deduced a trap composed of 25 places in 443 ms of which 6 ms to minimize.
[2025-06-02 05:19:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 3890 ms
[2025-06-02 05:19:49] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2025-06-02 05:19:49] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-02 05:19:49] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2025-06-02 05:19:50] [INFO ] [Real]Added 497 Read/Feed constraints in 50 ms returned sat
[2025-06-02 05:19:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:19:50] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2025-06-02 05:19:50] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-02 05:19:50] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2025-06-02 05:19:51] [INFO ] [Nat]Added 497 Read/Feed constraints in 343 ms returned sat
[2025-06-02 05:19:51] [INFO ] Deduced a trap composed of 28 places in 418 ms of which 6 ms to minimize.
[2025-06-02 05:19:52] [INFO ] Deduced a trap composed of 13 places in 403 ms of which 6 ms to minimize.
[2025-06-02 05:19:52] [INFO ] Deduced a trap composed of 73 places in 440 ms of which 6 ms to minimize.
[2025-06-02 05:19:53] [INFO ] Deduced a trap composed of 44 places in 441 ms of which 6 ms to minimize.
[2025-06-02 05:19:53] [INFO ] Deduced a trap composed of 114 places in 444 ms of which 6 ms to minimize.
[2025-06-02 05:19:54] [INFO ] Deduced a trap composed of 13 places in 423 ms of which 6 ms to minimize.
[2025-06-02 05:19:54] [INFO ] Deduced a trap composed of 51 places in 427 ms of which 7 ms to minimize.
[2025-06-02 05:19:55] [INFO ] Deduced a trap composed of 80 places in 442 ms of which 7 ms to minimize.
[2025-06-02 05:19:55] [INFO ] Deduced a trap composed of 140 places in 401 ms of which 6 ms to minimize.
[2025-06-02 05:19:56] [INFO ] Deduced a trap composed of 70 places in 418 ms of which 6 ms to minimize.
[2025-06-02 05:19:56] [INFO ] Deduced a trap composed of 34 places in 429 ms of which 5 ms to minimize.
[2025-06-02 05:19:57] [INFO ] Deduced a trap composed of 32 places in 420 ms of which 5 ms to minimize.
[2025-06-02 05:19:57] [INFO ] Deduced a trap composed of 43 places in 399 ms of which 6 ms to minimize.
[2025-06-02 05:19:57] [INFO ] Deduced a trap composed of 67 places in 433 ms of which 6 ms to minimize.
[2025-06-02 05:19:58] [INFO ] Deduced a trap composed of 32 places in 436 ms of which 6 ms to minimize.
[2025-06-02 05:19:59] [INFO ] Deduced a trap composed of 68 places in 408 ms of which 6 ms to minimize.
[2025-06-02 05:19:59] [INFO ] Deduced a trap composed of 56 places in 422 ms of which 6 ms to minimize.
[2025-06-02 05:20:00] [INFO ] Deduced a trap composed of 41 places in 436 ms of which 6 ms to minimize.
[2025-06-02 05:20:00] [INFO ] Deduced a trap composed of 26 places in 404 ms of which 5 ms to minimize.
[2025-06-02 05:20:01] [INFO ] Deduced a trap composed of 17 places in 399 ms of which 5 ms to minimize.
[2025-06-02 05:20:01] [INFO ] Deduced a trap composed of 42 places in 403 ms of which 6 ms to minimize.
[2025-06-02 05:20:02] [INFO ] Deduced a trap composed of 15 places in 438 ms of which 6 ms to minimize.
[2025-06-02 05:20:02] [INFO ] Deduced a trap composed of 125 places in 441 ms of which 6 ms to minimize.
[2025-06-02 05:20:03] [INFO ] Deduced a trap composed of 60 places in 427 ms of which 6 ms to minimize.
[2025-06-02 05:20:03] [INFO ] Deduced a trap composed of 34 places in 440 ms of which 6 ms to minimize.
[2025-06-02 05:20:04] [INFO ] Deduced a trap composed of 49 places in 426 ms of which 6 ms to minimize.
[2025-06-02 05:20:04] [INFO ] Deduced a trap composed of 73 places in 423 ms of which 5 ms to minimize.
[2025-06-02 05:20:05] [INFO ] Deduced a trap composed of 35 places in 414 ms of which 5 ms to minimize.
[2025-06-02 05:20:05] [INFO ] Deduced a trap composed of 136 places in 417 ms of which 6 ms to minimize.
[2025-06-02 05:20:06] [INFO ] Deduced a trap composed of 34 places in 423 ms of which 6 ms to minimize.
[2025-06-02 05:20:06] [INFO ] Deduced a trap composed of 25 places in 384 ms of which 6 ms to minimize.
[2025-06-02 05:20:07] [INFO ] Deduced a trap composed of 23 places in 446 ms of which 6 ms to minimize.
[2025-06-02 05:20:09] [INFO ] Deduced a trap composed of 59 places in 405 ms of which 6 ms to minimize.
[2025-06-02 05:20:09] [INFO ] Deduced a trap composed of 98 places in 395 ms of which 6 ms to minimize.
[2025-06-02 05:20:10] [INFO ] Deduced a trap composed of 96 places in 410 ms of which 5 ms to minimize.
[2025-06-02 05:20:10] [INFO ] Deduced a trap composed of 127 places in 388 ms of which 5 ms to minimize.
[2025-06-02 05:20:11] [INFO ] Deduced a trap composed of 96 places in 440 ms of which 6 ms to minimize.
[2025-06-02 05:20:11] [INFO ] Deduced a trap composed of 13 places in 447 ms of which 6 ms to minimize.
[2025-06-02 05:20:12] [INFO ] Deduced a trap composed of 101 places in 426 ms of which 6 ms to minimize.
[2025-06-02 05:20:12] [INFO ] Deduced a trap composed of 79 places in 399 ms of which 5 ms to minimize.
[2025-06-02 05:20:13] [INFO ] Deduced a trap composed of 106 places in 411 ms of which 6 ms to minimize.
[2025-06-02 05:20:13] [INFO ] Deduced a trap composed of 186 places in 395 ms of which 6 ms to minimize.
[2025-06-02 05:20:14] [INFO ] Deduced a trap composed of 174 places in 444 ms of which 7 ms to minimize.
[2025-06-02 05:20:14] [INFO ] Deduced a trap composed of 89 places in 418 ms of which 5 ms to minimize.
[2025-06-02 05:20:15] [INFO ] Deduced a trap composed of 32 places in 399 ms of which 5 ms to minimize.
[2025-06-02 05:20:15] [INFO ] Deduced a trap composed of 66 places in 404 ms of which 11 ms to minimize.
[2025-06-02 05:20:16] [INFO ] Deduced a trap composed of 49 places in 374 ms of which 5 ms to minimize.
[2025-06-02 05:20:17] [INFO ] Deduced a trap composed of 138 places in 388 ms of which 5 ms to minimize.
[2025-06-02 05:20:18] [INFO ] Deduced a trap composed of 87 places in 387 ms of which 6 ms to minimize.
[2025-06-02 05:20:18] [INFO ] Deduced a trap composed of 68 places in 408 ms of which 6 ms to minimize.
[2025-06-02 05:20:19] [INFO ] Deduced a trap composed of 49 places in 398 ms of which 6 ms to minimize.
[2025-06-02 05:20:19] [INFO ] Deduced a trap composed of 71 places in 401 ms of which 7 ms to minimize.
[2025-06-02 05:20:21] [INFO ] Deduced a trap composed of 44 places in 411 ms of which 6 ms to minimize.
[2025-06-02 05:20:21] [INFO ] Deduced a trap composed of 121 places in 403 ms of which 6 ms to minimize.
[2025-06-02 05:20:22] [INFO ] Deduced a trap composed of 30 places in 397 ms of which 6 ms to minimize.
[2025-06-02 05:20:23] [INFO ] Deduced a trap composed of 44 places in 432 ms of which 6 ms to minimize.
[2025-06-02 05:20:24] [INFO ] Deduced a trap composed of 146 places in 384 ms of which 6 ms to minimize.
[2025-06-02 05:20:24] [INFO ] Deduced a trap composed of 53 places in 351 ms of which 6 ms to minimize.
[2025-06-02 05:20:25] [INFO ] Deduced a trap composed of 107 places in 393 ms of which 5 ms to minimize.
[2025-06-02 05:20:25] [INFO ] Deduced a trap composed of 70 places in 385 ms of which 5 ms to minimize.
[2025-06-02 05:20:26] [INFO ] Deduced a trap composed of 53 places in 386 ms of which 5 ms to minimize.
[2025-06-02 05:20:26] [INFO ] Deduced a trap composed of 68 places in 394 ms of which 5 ms to minimize.
[2025-06-02 05:20:27] [INFO ] Deduced a trap composed of 110 places in 391 ms of which 5 ms to minimize.
[2025-06-02 05:20:27] [INFO ] Deduced a trap composed of 51 places in 382 ms of which 6 ms to minimize.
[2025-06-02 05:20:28] [INFO ] Deduced a trap composed of 97 places in 402 ms of which 6 ms to minimize.
[2025-06-02 05:20:28] [INFO ] Deduced a trap composed of 108 places in 383 ms of which 6 ms to minimize.
[2025-06-02 05:20:29] [INFO ] Deduced a trap composed of 70 places in 396 ms of which 6 ms to minimize.
[2025-06-02 05:20:32] [INFO ] Deduced a trap composed of 89 places in 431 ms of which 6 ms to minimize.
[2025-06-02 05:20:32] [INFO ] Deduced a trap composed of 127 places in 420 ms of which 6 ms to minimize.
[2025-06-02 05:20:33] [INFO ] Deduced a trap composed of 63 places in 422 ms of which 6 ms to minimize.
[2025-06-02 05:20:33] [INFO ] Deduced a trap composed of 249 places in 421 ms of which 6 ms to minimize.
[2025-06-02 05:20:34] [INFO ] Deduced a trap composed of 34 places in 410 ms of which 6 ms to minimize.
[2025-06-02 05:20:34] [INFO ] Deduced a trap composed of 44 places in 406 ms of which 6 ms to minimize.
[2025-06-02 05:20:35] [INFO ] Deduced a trap composed of 157 places in 388 ms of which 5 ms to minimize.
[2025-06-02 05:20:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-02 05:20:35] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2025-06-02 05:20:35] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-02 05:20:35] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2025-06-02 05:20:35] [INFO ] [Real]Added 497 Read/Feed constraints in 84 ms returned sat
[2025-06-02 05:20:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:20:36] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2025-06-02 05:20:36] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-02 05:20:36] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2025-06-02 05:20:36] [INFO ] [Nat]Added 497 Read/Feed constraints in 174 ms returned sat
[2025-06-02 05:20:36] [INFO ] Computed and/alt/rep : 1800/5000/1800 causal constraints (skipped 112 transitions) in 111 ms.
[2025-06-02 05:20:42] [INFO ] Deduced a trap composed of 141 places in 512 ms of which 7 ms to minimize.
[2025-06-02 05:20:42] [INFO ] Deduced a trap composed of 85 places in 372 ms of which 5 ms to minimize.
[2025-06-02 05:20:43] [INFO ] Deduced a trap composed of 162 places in 497 ms of which 7 ms to minimize.
[2025-06-02 05:20:43] [INFO ] Deduced a trap composed of 36 places in 359 ms of which 5 ms to minimize.
[2025-06-02 05:20:44] [INFO ] Deduced a trap composed of 130 places in 441 ms of which 6 ms to minimize.
[2025-06-02 05:20:45] [INFO ] Deduced a trap composed of 143 places in 453 ms of which 7 ms to minimize.
[2025-06-02 05:20:45] [INFO ] Deduced a trap composed of 108 places in 490 ms of which 7 ms to minimize.
[2025-06-02 05:20:46] [INFO ] Deduced a trap composed of 90 places in 442 ms of which 6 ms to minimize.
[2025-06-02 05:20:47] [INFO ] Deduced a trap composed of 62 places in 423 ms of which 6 ms to minimize.
[2025-06-02 05:20:47] [INFO ] Deduced a trap composed of 72 places in 348 ms of which 5 ms to minimize.
[2025-06-02 05:20:48] [INFO ] Deduced a trap composed of 102 places in 411 ms of which 6 ms to minimize.
[2025-06-02 05:20:48] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 6840 ms
[2025-06-02 05:20:49] [INFO ] Added : 238 causal constraints over 48 iterations in 12428 ms. Result :sat
Minimization took 1208 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7, 1, 6] Max Struct:[7, 8, 8]
FORMULA Peterson-COL-7-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 6] Max Struct:[8, 8]
Support contains 456 out of 1152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1152/1152 places, 2256/2256 transitions.
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 48 Pre rules applied. Total rules applied 0 place count 1152 transition count 2208
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 1104 transition count 2208
Applied a total of 96 rules in 93 ms. Remains 1104 /1152 variables (removed 48) and now considering 2208/2256 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 1104/1152 places, 2208/2256 transitions.
[2025-06-02 05:20:52] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1104 cols
[2025-06-02 05:20:52] [INFO ] Computed 31 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 6] Max Struct:[8, 8]
RANDOM walk for 1000000 steps (2 resets) in 7114 ms. (140 steps per ms)
BEST_FIRST walk for 1689358 steps (4 resets) in 6212 ms. (271 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 6] Max Struct:[8, 8]
[2025-06-02 05:21:06] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2025-06-02 05:21:06] [INFO ] Invariant cache hit.
[2025-06-02 05:21:06] [INFO ] [Real]Absence check using 23 positive place invariants in 28 ms returned sat
[2025-06-02 05:21:06] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 10 ms returned sat
[2025-06-02 05:21:06] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2025-06-02 05:21:06] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 05:21:06] [INFO ] [Real]Added 497 Read/Feed constraints in 58 ms returned sat
[2025-06-02 05:21:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:07] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2025-06-02 05:21:07] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-02 05:21:07] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2025-06-02 05:21:07] [INFO ] [Nat]Added 497 Read/Feed constraints in 312 ms returned sat
[2025-06-02 05:21:08] [INFO ] Deduced a trap composed of 39 places in 383 ms of which 6 ms to minimize.
[2025-06-02 05:21:08] [INFO ] Deduced a trap composed of 15 places in 394 ms of which 5 ms to minimize.
[2025-06-02 05:21:09] [INFO ] Deduced a trap composed of 89 places in 411 ms of which 6 ms to minimize.
[2025-06-02 05:21:09] [INFO ] Deduced a trap composed of 127 places in 421 ms of which 5 ms to minimize.
[2025-06-02 05:21:10] [INFO ] Deduced a trap composed of 64 places in 414 ms of which 6 ms to minimize.
[2025-06-02 05:21:10] [INFO ] Deduced a trap composed of 50 places in 390 ms of which 6 ms to minimize.
[2025-06-02 05:21:11] [INFO ] Deduced a trap composed of 56 places in 420 ms of which 6 ms to minimize.
[2025-06-02 05:21:11] [INFO ] Deduced a trap composed of 67 places in 401 ms of which 6 ms to minimize.
[2025-06-02 05:21:12] [INFO ] Deduced a trap composed of 49 places in 397 ms of which 6 ms to minimize.
[2025-06-02 05:21:12] [INFO ] Deduced a trap composed of 46 places in 417 ms of which 6 ms to minimize.
[2025-06-02 05:21:13] [INFO ] Deduced a trap composed of 49 places in 408 ms of which 6 ms to minimize.
[2025-06-02 05:21:13] [INFO ] Deduced a trap composed of 130 places in 394 ms of which 6 ms to minimize.
[2025-06-02 05:21:13] [INFO ] Deduced a trap composed of 13 places in 410 ms of which 6 ms to minimize.
[2025-06-02 05:21:14] [INFO ] Deduced a trap composed of 49 places in 374 ms of which 6 ms to minimize.
[2025-06-02 05:21:14] [INFO ] Deduced a trap composed of 34 places in 372 ms of which 11 ms to minimize.
[2025-06-02 05:21:15] [INFO ] Deduced a trap composed of 59 places in 397 ms of which 6 ms to minimize.
[2025-06-02 05:21:15] [INFO ] Deduced a trap composed of 46 places in 389 ms of which 6 ms to minimize.
[2025-06-02 05:21:16] [INFO ] Deduced a trap composed of 31 places in 383 ms of which 5 ms to minimize.
[2025-06-02 05:21:16] [INFO ] Deduced a trap composed of 85 places in 384 ms of which 5 ms to minimize.
[2025-06-02 05:21:17] [INFO ] Deduced a trap composed of 31 places in 380 ms of which 6 ms to minimize.
[2025-06-02 05:21:17] [INFO ] Deduced a trap composed of 67 places in 391 ms of which 6 ms to minimize.
[2025-06-02 05:21:18] [INFO ] Deduced a trap composed of 30 places in 393 ms of which 5 ms to minimize.
[2025-06-02 05:21:18] [INFO ] Deduced a trap composed of 14 places in 395 ms of which 6 ms to minimize.
[2025-06-02 05:21:19] [INFO ] Deduced a trap composed of 41 places in 397 ms of which 6 ms to minimize.
[2025-06-02 05:21:19] [INFO ] Deduced a trap composed of 57 places in 401 ms of which 6 ms to minimize.
[2025-06-02 05:21:19] [INFO ] Deduced a trap composed of 20 places in 393 ms of which 6 ms to minimize.
[2025-06-02 05:21:20] [INFO ] Deduced a trap composed of 46 places in 391 ms of which 5 ms to minimize.
[2025-06-02 05:21:21] [INFO ] Deduced a trap composed of 11 places in 397 ms of which 6 ms to minimize.
[2025-06-02 05:21:21] [INFO ] Deduced a trap composed of 35 places in 408 ms of which 6 ms to minimize.
[2025-06-02 05:21:22] [INFO ] Deduced a trap composed of 33 places in 412 ms of which 6 ms to minimize.
[2025-06-02 05:21:22] [INFO ] Deduced a trap composed of 119 places in 390 ms of which 5 ms to minimize.
[2025-06-02 05:21:23] [INFO ] Deduced a trap composed of 47 places in 395 ms of which 6 ms to minimize.
[2025-06-02 05:21:23] [INFO ] Deduced a trap composed of 83 places in 385 ms of which 5 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 56 places in 388 ms of which 8 ms to minimize.
[2025-06-02 05:21:24] [INFO ] Deduced a trap composed of 34 places in 391 ms of which 5 ms to minimize.
[2025-06-02 05:21:25] [INFO ] Deduced a trap composed of 57 places in 399 ms of which 5 ms to minimize.
[2025-06-02 05:21:25] [INFO ] Deduced a trap composed of 30 places in 384 ms of which 5 ms to minimize.
[2025-06-02 05:21:29] [INFO ] Deduced a trap composed of 23 places in 418 ms of which 5 ms to minimize.
[2025-06-02 05:21:29] [INFO ] Deduced a trap composed of 20 places in 441 ms of which 5 ms to minimize.
[2025-06-02 05:21:30] [INFO ] Deduced a trap composed of 50 places in 418 ms of which 5 ms to minimize.
[2025-06-02 05:21:30] [INFO ] Deduced a trap composed of 34 places in 390 ms of which 6 ms to minimize.
[2025-06-02 05:21:31] [INFO ] Deduced a trap composed of 20 places in 374 ms of which 5 ms to minimize.
[2025-06-02 05:21:31] [INFO ] Deduced a trap composed of 13 places in 376 ms of which 5 ms to minimize.
[2025-06-02 05:21:32] [INFO ] Deduced a trap composed of 37 places in 389 ms of which 5 ms to minimize.
[2025-06-02 05:21:32] [INFO ] Deduced a trap composed of 31 places in 388 ms of which 5 ms to minimize.
[2025-06-02 05:21:33] [INFO ] Deduced a trap composed of 20 places in 386 ms of which 6 ms to minimize.
[2025-06-02 05:21:33] [INFO ] Deduced a trap composed of 38 places in 376 ms of which 6 ms to minimize.
[2025-06-02 05:21:34] [INFO ] Deduced a trap composed of 61 places in 387 ms of which 6 ms to minimize.
[2025-06-02 05:21:34] [INFO ] Deduced a trap composed of 123 places in 370 ms of which 5 ms to minimize.
[2025-06-02 05:21:34] [INFO ] Deduced a trap composed of 28 places in 393 ms of which 5 ms to minimize.
[2025-06-02 05:21:35] [INFO ] Deduced a trap composed of 91 places in 388 ms of which 5 ms to minimize.
[2025-06-02 05:21:35] [INFO ] Deduced a trap composed of 97 places in 366 ms of which 5 ms to minimize.
[2025-06-02 05:21:36] [INFO ] Deduced a trap composed of 119 places in 372 ms of which 5 ms to minimize.
[2025-06-02 05:21:36] [INFO ] Deduced a trap composed of 140 places in 378 ms of which 6 ms to minimize.
[2025-06-02 05:21:37] [INFO ] Deduced a trap composed of 73 places in 368 ms of which 6 ms to minimize.
[2025-06-02 05:21:37] [INFO ] Deduced a trap composed of 38 places in 376 ms of which 5 ms to minimize.
[2025-06-02 05:21:38] [INFO ] Deduced a trap composed of 37 places in 400 ms of which 6 ms to minimize.
[2025-06-02 05:21:42] [INFO ] Deduced a trap composed of 37 places in 368 ms of which 5 ms to minimize.
[2025-06-02 05:21:43] [INFO ] Deduced a trap composed of 15 places in 374 ms of which 5 ms to minimize.
[2025-06-02 05:21:43] [INFO ] Deduced a trap composed of 49 places in 342 ms of which 5 ms to minimize.
[2025-06-02 05:21:44] [INFO ] Deduced a trap composed of 74 places in 341 ms of which 5 ms to minimize.
[2025-06-02 05:21:44] [INFO ] Deduced a trap composed of 95 places in 348 ms of which 5 ms to minimize.
[2025-06-02 05:21:44] [INFO ] Deduced a trap composed of 55 places in 342 ms of which 5 ms to minimize.
[2025-06-02 05:21:45] [INFO ] Deduced a trap composed of 29 places in 341 ms of which 5 ms to minimize.
[2025-06-02 05:21:45] [INFO ] Deduced a trap composed of 74 places in 342 ms of which 5 ms to minimize.
[2025-06-02 05:21:46] [INFO ] Deduced a trap composed of 69 places in 364 ms of which 17 ms to minimize.
[2025-06-02 05:21:46] [INFO ] Deduced a trap composed of 142 places in 356 ms of which 6 ms to minimize.
[2025-06-02 05:21:47] [INFO ] Deduced a trap composed of 84 places in 354 ms of which 5 ms to minimize.
[2025-06-02 05:21:47] [INFO ] Deduced a trap composed of 56 places in 343 ms of which 5 ms to minimize.
[2025-06-02 05:21:48] [INFO ] Deduced a trap composed of 47 places in 353 ms of which 5 ms to minimize.
[2025-06-02 05:21:49] [INFO ] Deduced a trap composed of 41 places in 349 ms of which 5 ms to minimize.
[2025-06-02 05:21:50] [INFO ] Deduced a trap composed of 70 places in 350 ms of which 5 ms to minimize.
[2025-06-02 05:21:51] [INFO ] Deduced a trap composed of 49 places in 360 ms of which 5 ms to minimize.
[2025-06-02 05:21:52] [INFO ] Deduced a trap composed of 51 places in 381 ms of which 5 ms to minimize.
[2025-06-02 05:21:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-02 05:21:52] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2025-06-02 05:21:52] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 16 ms returned sat
[2025-06-02 05:21:52] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2025-06-02 05:21:52] [INFO ] [Real]Added 497 Read/Feed constraints in 61 ms returned sat
[2025-06-02 05:21:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:52] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2025-06-02 05:21:52] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 9 ms returned sat
[2025-06-02 05:21:53] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2025-06-02 05:21:53] [INFO ] [Nat]Added 497 Read/Feed constraints in 187 ms returned sat
[2025-06-02 05:21:54] [INFO ] Deduced a trap composed of 17 places in 454 ms of which 7 ms to minimize.
[2025-06-02 05:21:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 586 ms
[2025-06-02 05:21:54] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 109 ms.
[2025-06-02 05:21:57] [INFO ] Deduced a trap composed of 133 places in 458 ms of which 6 ms to minimize.
[2025-06-02 05:21:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 660 ms
[2025-06-02 05:21:57] [INFO ] Added : 123 causal constraints over 25 iterations in 3777 ms. Result :sat
Minimization took 946 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 6] Max Struct:[8, 8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 7] Max Struct:[8, 8]
Support contains 456 out of 1104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1104/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 55 ms. Remains 1104 /1104 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 1104/1104 places, 2208/2208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1104/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 38 ms. Remains 1104 /1104 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2025-06-02 05:21:59] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2025-06-02 05:21:59] [INFO ] Invariant cache hit.
[2025-06-02 05:22:00] [INFO ] Implicit Places using invariants in 478 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 482 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1096/1104 places, 2208/2208 transitions.
Applied a total of 0 rules in 36 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 559 ms. Remains : 1096/1104 places, 2208/2208 transitions.
[2025-06-02 05:22:00] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2025-06-02 05:22:00] [INFO ] Computed 23 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 7] Max Struct:[8, 8]
RANDOM walk for 1000000 steps (2 resets) in 7607 ms. (131 steps per ms)
BEST_FIRST walk for 1706530 steps (4 resets) in 6215 ms. (274 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 7] Max Struct:[8, 8]
[2025-06-02 05:22:14] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2025-06-02 05:22:14] [INFO ] Invariant cache hit.
[2025-06-02 05:22:14] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2025-06-02 05:22:14] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2025-06-02 05:22:14] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 05:22:14] [INFO ] [Real]Added 497 Read/Feed constraints in 50 ms returned sat
[2025-06-02 05:22:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:15] [INFO ] [Nat]Absence check using 23 positive place invariants in 16 ms returned sat
[2025-06-02 05:22:15] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2025-06-02 05:22:15] [INFO ] [Nat]Added 497 Read/Feed constraints in 328 ms returned sat
[2025-06-02 05:22:16] [INFO ] Deduced a trap composed of 104 places in 412 ms of which 5 ms to minimize.
[2025-06-02 05:22:16] [INFO ] Deduced a trap composed of 51 places in 389 ms of which 5 ms to minimize.
[2025-06-02 05:22:17] [INFO ] Deduced a trap composed of 15 places in 396 ms of which 5 ms to minimize.
[2025-06-02 05:22:17] [INFO ] Deduced a trap composed of 96 places in 395 ms of which 5 ms to minimize.
[2025-06-02 05:22:18] [INFO ] Deduced a trap composed of 54 places in 408 ms of which 5 ms to minimize.
[2025-06-02 05:22:18] [INFO ] Deduced a trap composed of 40 places in 384 ms of which 5 ms to minimize.
[2025-06-02 05:22:19] [INFO ] Deduced a trap composed of 77 places in 414 ms of which 5 ms to minimize.
[2025-06-02 05:22:19] [INFO ] Deduced a trap composed of 56 places in 382 ms of which 6 ms to minimize.
[2025-06-02 05:22:20] [INFO ] Deduced a trap composed of 31 places in 373 ms of which 5 ms to minimize.
[2025-06-02 05:22:20] [INFO ] Deduced a trap composed of 28 places in 386 ms of which 6 ms to minimize.
[2025-06-02 05:22:20] [INFO ] Deduced a trap composed of 24 places in 375 ms of which 6 ms to minimize.
[2025-06-02 05:22:21] [INFO ] Deduced a trap composed of 15 places in 388 ms of which 5 ms to minimize.
[2025-06-02 05:22:21] [INFO ] Deduced a trap composed of 24 places in 400 ms of which 6 ms to minimize.
[2025-06-02 05:22:22] [INFO ] Deduced a trap composed of 29 places in 399 ms of which 6 ms to minimize.
[2025-06-02 05:22:22] [INFO ] Deduced a trap composed of 31 places in 403 ms of which 5 ms to minimize.
[2025-06-02 05:22:23] [INFO ] Deduced a trap composed of 26 places in 414 ms of which 5 ms to minimize.
[2025-06-02 05:22:23] [INFO ] Deduced a trap composed of 33 places in 381 ms of which 5 ms to minimize.
[2025-06-02 05:22:24] [INFO ] Deduced a trap composed of 66 places in 374 ms of which 5 ms to minimize.
[2025-06-02 05:22:24] [INFO ] Deduced a trap composed of 48 places in 366 ms of which 5 ms to minimize.
[2025-06-02 05:22:25] [INFO ] Deduced a trap composed of 49 places in 387 ms of which 6 ms to minimize.
[2025-06-02 05:22:25] [INFO ] Deduced a trap composed of 13 places in 399 ms of which 6 ms to minimize.
[2025-06-02 05:22:26] [INFO ] Deduced a trap composed of 74 places in 385 ms of which 6 ms to minimize.
[2025-06-02 05:22:26] [INFO ] Deduced a trap composed of 50 places in 390 ms of which 6 ms to minimize.
[2025-06-02 05:22:27] [INFO ] Deduced a trap composed of 71 places in 417 ms of which 6 ms to minimize.
[2025-06-02 05:22:28] [INFO ] Deduced a trap composed of 50 places in 409 ms of which 6 ms to minimize.
[2025-06-02 05:22:28] [INFO ] Deduced a trap composed of 29 places in 376 ms of which 5 ms to minimize.
[2025-06-02 05:22:28] [INFO ] Deduced a trap composed of 37 places in 357 ms of which 6 ms to minimize.
[2025-06-02 05:22:29] [INFO ] Deduced a trap composed of 13 places in 376 ms of which 6 ms to minimize.
[2025-06-02 05:22:29] [INFO ] Deduced a trap composed of 80 places in 392 ms of which 6 ms to minimize.
[2025-06-02 05:22:30] [INFO ] Deduced a trap composed of 72 places in 386 ms of which 6 ms to minimize.
[2025-06-02 05:22:30] [INFO ] Deduced a trap composed of 123 places in 409 ms of which 6 ms to minimize.
[2025-06-02 05:22:31] [INFO ] Deduced a trap composed of 19 places in 399 ms of which 5 ms to minimize.
[2025-06-02 05:22:31] [INFO ] Deduced a trap composed of 135 places in 385 ms of which 5 ms to minimize.
[2025-06-02 05:22:32] [INFO ] Deduced a trap composed of 97 places in 387 ms of which 6 ms to minimize.
[2025-06-02 05:22:32] [INFO ] Deduced a trap composed of 140 places in 396 ms of which 6 ms to minimize.
[2025-06-02 05:22:33] [INFO ] Deduced a trap composed of 46 places in 389 ms of which 6 ms to minimize.
[2025-06-02 05:22:33] [INFO ] Deduced a trap composed of 93 places in 379 ms of which 6 ms to minimize.
[2025-06-02 05:22:34] [INFO ] Deduced a trap composed of 73 places in 389 ms of which 6 ms to minimize.
[2025-06-02 05:22:34] [INFO ] Deduced a trap composed of 48 places in 393 ms of which 6 ms to minimize.
[2025-06-02 05:22:34] [INFO ] Deduced a trap composed of 48 places in 388 ms of which 6 ms to minimize.
[2025-06-02 05:22:35] [INFO ] Deduced a trap composed of 83 places in 392 ms of which 5 ms to minimize.
[2025-06-02 05:22:35] [INFO ] Deduced a trap composed of 110 places in 387 ms of which 6 ms to minimize.
[2025-06-02 05:22:36] [INFO ] Deduced a trap composed of 51 places in 402 ms of which 6 ms to minimize.
[2025-06-02 05:22:36] [INFO ] Deduced a trap composed of 134 places in 381 ms of which 5 ms to minimize.
[2025-06-02 05:22:37] [INFO ] Deduced a trap composed of 71 places in 410 ms of which 5 ms to minimize.
[2025-06-02 05:22:37] [INFO ] Deduced a trap composed of 122 places in 372 ms of which 6 ms to minimize.
[2025-06-02 05:22:38] [INFO ] Deduced a trap composed of 123 places in 383 ms of which 6 ms to minimize.
[2025-06-02 05:22:38] [INFO ] Deduced a trap composed of 55 places in 362 ms of which 5 ms to minimize.
[2025-06-02 05:22:39] [INFO ] Deduced a trap composed of 63 places in 378 ms of which 5 ms to minimize.
[2025-06-02 05:22:39] [INFO ] Deduced a trap composed of 62 places in 393 ms of which 6 ms to minimize.
[2025-06-02 05:22:40] [INFO ] Deduced a trap composed of 51 places in 386 ms of which 5 ms to minimize.
[2025-06-02 05:22:40] [INFO ] Deduced a trap composed of 109 places in 389 ms of which 6 ms to minimize.
[2025-06-02 05:22:41] [INFO ] Deduced a trap composed of 48 places in 368 ms of which 5 ms to minimize.
[2025-06-02 05:22:41] [INFO ] Deduced a trap composed of 98 places in 371 ms of which 6 ms to minimize.
[2025-06-02 05:22:42] [INFO ] Deduced a trap composed of 61 places in 362 ms of which 5 ms to minimize.
[2025-06-02 05:22:42] [INFO ] Deduced a trap composed of 42 places in 391 ms of which 5 ms to minimize.
[2025-06-02 05:22:43] [INFO ] Deduced a trap composed of 87 places in 389 ms of which 5 ms to minimize.
[2025-06-02 05:22:44] [INFO ] Deduced a trap composed of 55 places in 416 ms of which 6 ms to minimize.
[2025-06-02 05:22:44] [INFO ] Deduced a trap composed of 32 places in 416 ms of which 5 ms to minimize.
[2025-06-02 05:22:45] [INFO ] Deduced a trap composed of 128 places in 412 ms of which 6 ms to minimize.
[2025-06-02 05:22:45] [INFO ] Deduced a trap composed of 66 places in 398 ms of which 5 ms to minimize.
[2025-06-02 05:22:46] [INFO ] Deduced a trap composed of 69 places in 389 ms of which 5 ms to minimize.
[2025-06-02 05:22:46] [INFO ] Deduced a trap composed of 48 places in 375 ms of which 5 ms to minimize.
[2025-06-02 05:22:47] [INFO ] Deduced a trap composed of 60 places in 374 ms of which 6 ms to minimize.
[2025-06-02 05:22:47] [INFO ] Deduced a trap composed of 37 places in 374 ms of which 5 ms to minimize.
[2025-06-02 05:22:48] [INFO ] Deduced a trap composed of 90 places in 406 ms of which 5 ms to minimize.
[2025-06-02 05:22:48] [INFO ] Deduced a trap composed of 51 places in 379 ms of which 6 ms to minimize.
[2025-06-02 05:22:53] [INFO ] Trap strengthening (SAT) tested/added 67/67 trap constraints in 37523 ms
[2025-06-02 05:22:53] [INFO ] [Real]Absence check using 23 positive place invariants in 16 ms returned sat
[2025-06-02 05:22:54] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2025-06-02 05:22:54] [INFO ] [Real]Added 497 Read/Feed constraints in 88 ms returned sat
[2025-06-02 05:22:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:54] [INFO ] [Nat]Absence check using 23 positive place invariants in 16 ms returned sat
[2025-06-02 05:22:54] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2025-06-02 05:22:54] [INFO ] [Nat]Added 497 Read/Feed constraints in 148 ms returned sat
[2025-06-02 05:22:55] [INFO ] Deduced a trap composed of 11 places in 495 ms of which 7 ms to minimize.
[2025-06-02 05:22:56] [INFO ] Deduced a trap composed of 88 places in 492 ms of which 7 ms to minimize.
[2025-06-02 05:22:56] [INFO ] Deduced a trap composed of 87 places in 474 ms of which 6 ms to minimize.
[2025-06-02 05:22:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1792 ms
[2025-06-02 05:22:56] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 118 ms.
[2025-06-02 05:23:00] [INFO ] Deduced a trap composed of 53 places in 504 ms of which 7 ms to minimize.
[2025-06-02 05:23:01] [INFO ] Deduced a trap composed of 40 places in 343 ms of which 5 ms to minimize.
[2025-06-02 05:23:01] [INFO ] Deduced a trap composed of 27 places in 324 ms of which 5 ms to minimize.
[2025-06-02 05:23:02] [INFO ] Deduced a trap composed of 31 places in 325 ms of which 5 ms to minimize.
[2025-06-02 05:23:02] [INFO ] Deduced a trap composed of 31 places in 323 ms of which 5 ms to minimize.
[2025-06-02 05:23:03] [INFO ] Deduced a trap composed of 33 places in 448 ms of which 7 ms to minimize.
[2025-06-02 05:23:03] [INFO ] Deduced a trap composed of 17 places in 442 ms of which 7 ms to minimize.
[2025-06-02 05:23:04] [INFO ] Deduced a trap composed of 24 places in 444 ms of which 6 ms to minimize.
[2025-06-02 05:23:04] [INFO ] Deduced a trap composed of 29 places in 439 ms of which 7 ms to minimize.
[2025-06-02 05:23:05] [INFO ] Deduced a trap composed of 116 places in 454 ms of which 6 ms to minimize.
[2025-06-02 05:23:05] [INFO ] Deduced a trap composed of 20 places in 472 ms of which 8 ms to minimize.
[2025-06-02 05:23:07] [INFO ] Deduced a trap composed of 23 places in 446 ms of which 7 ms to minimize.
[2025-06-02 05:23:07] [INFO ] Deduced a trap composed of 32 places in 498 ms of which 6 ms to minimize.
[2025-06-02 05:23:08] [INFO ] Deduced a trap composed of 38 places in 514 ms of which 9 ms to minimize.
[2025-06-02 05:23:08] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 8273 ms
[2025-06-02 05:23:08] [INFO ] Added : 174 causal constraints over 36 iterations in 12085 ms. Result :sat
Minimization took 538 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 7] Max Struct:[8, 8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 7] Max Struct:[8, 8]
Support contains 456 out of 1096 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 36 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 1096/1096 places, 2208/2208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 34 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2025-06-02 05:23:10] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2025-06-02 05:23:10] [INFO ] Invariant cache hit.
[2025-06-02 05:23:11] [INFO ] Implicit Places using invariants in 412 ms returned []
[2025-06-02 05:23:11] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2025-06-02 05:23:11] [INFO ] Invariant cache hit.
[2025-06-02 05:23:11] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 05:23:16] [INFO ] Implicit Places using invariants and state equation in 4776 ms returned []
Implicit Place search using SMT with State Equation took 5191 ms to find 0 implicit places.
[2025-06-02 05:23:16] [INFO ] Redundant transitions in 131 ms returned []
Running 2200 sub problems to find dead transitions.
[2025-06-02 05:23:16] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2025-06-02 05:23:16] [INFO ] Invariant cache hit.
[2025-06-02 05:23:16] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1096 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1096/2968 variables, and 23 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/1096 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 2200/2200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1096 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
[2025-06-02 05:23:48] [INFO ] Deduced a trap composed of 66 places in 431 ms of which 6 ms to minimize.
[2025-06-02 05:23:49] [INFO ] Deduced a trap composed of 17 places in 444 ms of which 6 ms to minimize.
[2025-06-02 05:23:49] [INFO ] Deduced a trap composed of 55 places in 436 ms of which 6 ms to minimize.
[2025-06-02 05:23:50] [INFO ] Deduced a trap composed of 75 places in 440 ms of which 6 ms to minimize.
[2025-06-02 05:23:50] [INFO ] Deduced a trap composed of 19 places in 412 ms of which 6 ms to minimize.
[2025-06-02 05:23:51] [INFO ] Deduced a trap composed of 68 places in 417 ms of which 6 ms to minimize.
[2025-06-02 05:23:51] [INFO ] Deduced a trap composed of 28 places in 403 ms of which 5 ms to minimize.
[2025-06-02 05:23:51] [INFO ] Deduced a trap composed of 71 places in 415 ms of which 6 ms to minimize.
[2025-06-02 05:23:52] [INFO ] Deduced a trap composed of 64 places in 408 ms of which 6 ms to minimize.
[2025-06-02 05:23:52] [INFO ] Deduced a trap composed of 76 places in 401 ms of which 6 ms to minimize.
[2025-06-02 05:23:53] [INFO ] Deduced a trap composed of 70 places in 406 ms of which 6 ms to minimize.
[2025-06-02 05:23:53] [INFO ] Deduced a trap composed of 80 places in 400 ms of which 6 ms to minimize.
[2025-06-02 05:23:54] [INFO ] Deduced a trap composed of 51 places in 432 ms of which 6 ms to minimize.
[2025-06-02 05:23:54] [INFO ] Deduced a trap composed of 28 places in 439 ms of which 6 ms to minimize.
[2025-06-02 05:23:54] [INFO ] Deduced a trap composed of 37 places in 451 ms of which 5 ms to minimize.
[2025-06-02 05:23:55] [INFO ] Deduced a trap composed of 80 places in 422 ms of which 6 ms to minimize.
[2025-06-02 05:23:55] [INFO ] Deduced a trap composed of 38 places in 428 ms of which 6 ms to minimize.
[2025-06-02 05:23:56] [INFO ] Deduced a trap composed of 62 places in 422 ms of which 6 ms to minimize.
[2025-06-02 05:23:56] [INFO ] Deduced a trap composed of 49 places in 437 ms of which 6 ms to minimize.
[2025-06-02 05:23:57] [INFO ] Deduced a trap composed of 40 places in 415 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1096 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
[2025-06-02 05:23:57] [INFO ] Deduced a trap composed of 59 places in 333 ms of which 5 ms to minimize.
[2025-06-02 05:23:58] [INFO ] Deduced a trap composed of 49 places in 332 ms of which 5 ms to minimize.
[2025-06-02 05:23:58] [INFO ] Deduced a trap composed of 49 places in 336 ms of which 4 ms to minimize.
[2025-06-02 05:23:58] [INFO ] Deduced a trap composed of 78 places in 331 ms of which 5 ms to minimize.
[2025-06-02 05:23:59] [INFO ] Deduced a trap composed of 56 places in 336 ms of which 5 ms to minimize.
[2025-06-02 05:23:59] [INFO ] Deduced a trap composed of 80 places in 340 ms of which 4 ms to minimize.
[2025-06-02 05:24:00] [INFO ] Deduced a trap composed of 96 places in 345 ms of which 5 ms to minimize.
[2025-06-02 05:24:00] [INFO ] Deduced a trap composed of 77 places in 339 ms of which 5 ms to minimize.
[2025-06-02 05:24:00] [INFO ] Deduced a trap composed of 17 places in 340 ms of which 5 ms to minimize.
[2025-06-02 05:24:01] [INFO ] Deduced a trap composed of 39 places in 312 ms of which 5 ms to minimize.
[2025-06-02 05:24:01] [INFO ] Deduced a trap composed of 35 places in 315 ms of which 4 ms to minimize.
[2025-06-02 05:24:01] [INFO ] Deduced a trap composed of 17 places in 309 ms of which 5 ms to minimize.
[2025-06-02 05:24:02] [INFO ] Deduced a trap composed of 104 places in 352 ms of which 5 ms to minimize.
[2025-06-02 05:24:02] [INFO ] Deduced a trap composed of 17 places in 347 ms of which 5 ms to minimize.
[2025-06-02 05:24:02] [INFO ] Deduced a trap composed of 46 places in 400 ms of which 6 ms to minimize.
[2025-06-02 05:24:03] [INFO ] Deduced a trap composed of 28 places in 400 ms of which 6 ms to minimize.
[2025-06-02 05:24:03] [INFO ] Deduced a trap composed of 31 places in 437 ms of which 6 ms to minimize.
[2025-06-02 05:24:04] [INFO ] Deduced a trap composed of 28 places in 398 ms of which 6 ms to minimize.
[2025-06-02 05:24:04] [INFO ] Deduced a trap composed of 67 places in 413 ms of which 6 ms to minimize.
[2025-06-02 05:24:05] [INFO ] Deduced a trap composed of 67 places in 402 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1096 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
[2025-06-02 05:24:05] [INFO ] Deduced a trap composed of 28 places in 419 ms of which 6 ms to minimize.
[2025-06-02 05:24:06] [INFO ] Deduced a trap composed of 28 places in 397 ms of which 6 ms to minimize.
[2025-06-02 05:24:06] [INFO ] Deduced a trap composed of 28 places in 413 ms of which 6 ms to minimize.
[2025-06-02 05:24:07] [INFO ] Deduced a trap composed of 28 places in 429 ms of which 5 ms to minimize.
[2025-06-02 05:24:07] [INFO ] Deduced a trap composed of 13 places in 412 ms of which 6 ms to minimize.
[2025-06-02 05:24:08] [INFO ] Deduced a trap composed of 15 places in 400 ms of which 5 ms to minimize.
[2025-06-02 05:24:08] [INFO ] Deduced a trap composed of 58 places in 370 ms of which 5 ms to minimize.
[2025-06-02 05:24:08] [INFO ] Deduced a trap composed of 40 places in 368 ms of which 6 ms to minimize.
[2025-06-02 05:24:09] [INFO ] Deduced a trap composed of 58 places in 373 ms of which 5 ms to minimize.
[2025-06-02 05:24:09] [INFO ] Deduced a trap composed of 43 places in 370 ms of which 5 ms to minimize.
[2025-06-02 05:24:10] [INFO ] Deduced a trap composed of 25 places in 334 ms of which 5 ms to minimize.
[2025-06-02 05:24:10] [INFO ] Deduced a trap composed of 85 places in 348 ms of which 5 ms to minimize.
[2025-06-02 05:24:10] [INFO ] Deduced a trap composed of 86 places in 344 ms of which 5 ms to minimize.
[2025-06-02 05:24:11] [INFO ] Deduced a trap composed of 80 places in 342 ms of which 5 ms to minimize.
[2025-06-02 05:24:11] [INFO ] Deduced a trap composed of 101 places in 336 ms of which 5 ms to minimize.
[2025-06-02 05:24:11] [INFO ] Deduced a trap composed of 98 places in 354 ms of which 5 ms to minimize.
[2025-06-02 05:24:12] [INFO ] Deduced a trap composed of 21 places in 330 ms of which 6 ms to minimize.
[2025-06-02 05:24:12] [INFO ] Deduced a trap composed of 76 places in 404 ms of which 5 ms to minimize.
[2025-06-02 05:24:13] [INFO ] Deduced a trap composed of 45 places in 383 ms of which 5 ms to minimize.
[2025-06-02 05:24:13] [INFO ] Deduced a trap composed of 44 places in 402 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1096 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
[2025-06-02 05:24:14] [INFO ] Deduced a trap composed of 44 places in 407 ms of which 5 ms to minimize.
[2025-06-02 05:24:14] [INFO ] Deduced a trap composed of 85 places in 402 ms of which 6 ms to minimize.
[2025-06-02 05:24:15] [INFO ] Deduced a trap composed of 23 places in 403 ms of which 5 ms to minimize.
[2025-06-02 05:24:15] [INFO ] Deduced a trap composed of 17 places in 414 ms of which 6 ms to minimize.
[2025-06-02 05:24:16] [INFO ] Deduced a trap composed of 25 places in 346 ms of which 5 ms to minimize.
[2025-06-02 05:24:16] [INFO ] Deduced a trap composed of 118 places in 457 ms of which 7 ms to minimize.
[2025-06-02 05:24:17] [INFO ] Deduced a trap composed of 62 places in 472 ms of which 6 ms to minimize.
[2025-06-02 05:24:17] [INFO ] Deduced a trap composed of 78 places in 474 ms of which 6 ms to minimize.
SMT process timed out in 61320ms, After SMT, problems are : Problem set: 0 solved, 2200 unsolved
Search for dead transitions found 0 dead transitions in 61357ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66742 ms. Remains : 1096/1096 places, 2208/2208 transitions.
[2025-06-02 05:24:18] [INFO ] Flatten gal took : 267 ms
RANDOM walk for 40000 steps (8 resets) in 1810 ms. (22 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 4/4 properties
[2025-06-02 05:24:18] [INFO ] Flatten gal took : 239 ms
BEST_FIRST walk for 40004 steps (8 resets) in 327 ms. (121 steps per ms) remains 4/4 properties
[2025-06-02 05:24:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14916538101898297384.gal : 84 ms
[2025-06-02 05:24:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5869681559217826007.prop : 7 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/ReachabilityCardinality14916538101898297384.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5869681559217826007.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 901 ms. (44 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 809 ms. (49 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality5869681559217826007.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 11
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :11 after 12
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :12 after 24
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :24 after 30
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :30 after 48
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :48 after 132
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :132 after 367
Interrupted probabilistic random walk after 123417 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 4
Probabilistic random walk after 123417 steps, saw 56819 distinct states, run finished after 3004 ms. (steps per millisecond=41 ) properties seen :0
[2025-06-02 05:24:21] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2025-06-02 05:24:21] [INFO ] Invariant cache hit.
[2025-06-02 05:24:21] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 576/1032 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :367 after 766
[2025-06-02 05:24:22] [INFO ] Deduced a trap composed of 62 places in 435 ms of which 6 ms to minimize.
[2025-06-02 05:24:22] [INFO ] Deduced a trap composed of 132 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:24:23] [INFO ] Deduced a trap composed of 118 places in 151 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1032 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 05:24:23] [INFO ] Deduced a trap composed of 104 places in 249 ms of which 3 ms to minimize.
[2025-06-02 05:24:23] [INFO ] Deduced a trap composed of 132 places in 188 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1032 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1032 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/1040 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1040 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1872/2912 variables, 1040/1061 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2912 variables, 497/1558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :766 after 3375
At refinement iteration 9 (INCLUDED_ONLY) 0/2912 variables, 0/1558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 56/2968 variables, 56/1614 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2968 variables, 7/1621 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/2968 variables, 0/1621 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/2968 variables, 0/1621 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2968/2968 variables, and 1621 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3855 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 1096/1096 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 576/1032 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1032 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 05:24:26] [INFO ] Deduced a trap composed of 90 places in 185 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1032 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1032 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/1040 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1040 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1872/2912 variables, 1040/1062 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2912 variables, 497/1559 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2912 variables, 4/1563 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 05:24:29] [INFO ] Deduced a trap composed of 174 places in 203 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2912 variables, 1/1564 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2912/2968 variables, and 1564 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/23 constraints, State Equation: 1040/1096 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 9155ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 456 out of 1096 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 29 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 1096/1096 places, 2208/2208 transitions.
RANDOM walk for 40000 steps (8 resets) in 1876 ms. (21 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 657 ms. (60 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 571 ms. (69 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :3375 after 11187
Interrupted probabilistic random walk after 120222 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 4
Probabilistic random walk after 120222 steps, saw 55201 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2025-06-02 05:24:35] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2025-06-02 05:24:35] [INFO ] Invariant cache hit.
[2025-06-02 05:24:35] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 576/1032 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 05:24:35] [INFO ] Deduced a trap composed of 62 places in 437 ms of which 6 ms to minimize.
[2025-06-02 05:24:36] [INFO ] Deduced a trap composed of 132 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:24:36] [INFO ] Deduced a trap composed of 118 places in 148 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1032 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 05:24:36] [INFO ] Deduced a trap composed of 104 places in 247 ms of which 4 ms to minimize.
[2025-06-02 05:24:37] [INFO ] Deduced a trap composed of 132 places in 200 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1032 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1032 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/1040 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1040 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1872/2912 variables, 1040/1061 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2912 variables, 497/1558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2912 variables, 0/1558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 56/2968 variables, 56/1614 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2968 variables, 7/1621 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/2968 variables, 0/1621 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/2968 variables, 0/1621 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2968/2968 variables, and 1621 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3822 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 1096/1096 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 576/1032 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1032 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 05:24:39] [INFO ] Deduced a trap composed of 90 places in 195 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1032 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1032 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/1040 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1040 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 8192
At refinement iteration 7 (OVERLAPS) 1872/2912 variables, 1040/1062 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD size :11187 after 17836
At refinement iteration 8 (INCLUDED_ONLY) 0/2912 variables, 497/1559 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2912 variables, 4/1563 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2912 variables, 0/1563 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 56/2968 variables, 56/1619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2968 variables, 7/1626 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 05:24:47] [INFO ] Deduced a trap composed of 69 places in 409 ms of which 6 ms to minimize.
[2025-06-02 05:24:48] [INFO ] Deduced a trap composed of 43 places in 411 ms of which 6 ms to minimize.
[2025-06-02 05:24:48] [INFO ] Deduced a trap composed of 24 places in 404 ms of which 5 ms to minimize.
[2025-06-02 05:24:49] [INFO ] Deduced a trap composed of 61 places in 393 ms of which 6 ms to minimize.
[2025-06-02 05:24:49] [INFO ] Deduced a trap composed of 53 places in 405 ms of which 5 ms to minimize.
[2025-06-02 05:24:50] [INFO ] Deduced a trap composed of 73 places in 415 ms of which 6 ms to minimize.
[2025-06-02 05:24:50] [INFO ] Deduced a trap composed of 81 places in 408 ms of which 6 ms to minimize.
[2025-06-02 05:24:51] [INFO ] Deduced a trap composed of 71 places in 404 ms of which 6 ms to minimize.
[2025-06-02 05:24:51] [INFO ] Deduced a trap composed of 75 places in 415 ms of which 6 ms to minimize.
[2025-06-02 05:24:52] [INFO ] Deduced a trap composed of 91 places in 418 ms of which 6 ms to minimize.
[2025-06-02 05:24:52] [INFO ] Deduced a trap composed of 89 places in 417 ms of which 6 ms to minimize.
[2025-06-02 05:24:53] [INFO ] Deduced a trap composed of 83 places in 418 ms of which 6 ms to minimize.
[2025-06-02 05:24:53] [INFO ] Deduced a trap composed of 87 places in 428 ms of which 6 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :17836 after 100663
[2025-06-02 05:24:54] [INFO ] Deduced a trap composed of 59 places in 458 ms of which 6 ms to minimize.
[2025-06-02 05:24:54] [INFO ] Deduced a trap composed of 93 places in 441 ms of which 6 ms to minimize.
[2025-06-02 05:24:55] [INFO ] Deduced a trap composed of 24 places in 428 ms of which 6 ms to minimize.
[2025-06-02 05:24:55] [INFO ] Deduced a trap composed of 21 places in 413 ms of which 6 ms to minimize.
[2025-06-02 05:24:56] [INFO ] Deduced a trap composed of 21 places in 419 ms of which 6 ms to minimize.
[2025-06-02 05:24:56] [INFO ] Deduced a trap composed of 44 places in 411 ms of which 6 ms to minimize.
[2025-06-02 05:24:57] [INFO ] Deduced a trap composed of 41 places in 414 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2968 variables, 20/1646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 05:24:59] [INFO ] Deduced a trap composed of 28 places in 428 ms of which 6 ms to minimize.
[2025-06-02 05:24:59] [INFO ] Deduced a trap composed of 70 places in 422 ms of which 6 ms to minimize.
[2025-06-02 05:25:00] [INFO ] Deduced a trap composed of 90 places in 419 ms of which 5 ms to minimize.
[2025-06-02 05:25:00] [INFO ] Deduced a trap composed of 95 places in 416 ms of which 6 ms to minimize.
[2025-06-02 05:25:01] [INFO ] Deduced a trap composed of 58 places in 404 ms of which 6 ms to minimize.
[2025-06-02 05:25:01] [INFO ] Deduced a trap composed of 73 places in 414 ms of which 6 ms to minimize.
[2025-06-02 05:25:02] [INFO ] Deduced a trap composed of 68 places in 425 ms of which 6 ms to minimize.
[2025-06-02 05:25:02] [INFO ] Deduced a trap composed of 33 places in 397 ms of which 6 ms to minimize.
[2025-06-02 05:25:03] [INFO ] Deduced a trap composed of 21 places in 398 ms of which 6 ms to minimize.
[2025-06-02 05:25:03] [INFO ] Deduced a trap composed of 39 places in 394 ms of which 6 ms to minimize.
[2025-06-02 05:25:04] [INFO ] Deduced a trap composed of 89 places in 414 ms of which 7 ms to minimize.
[2025-06-02 05:25:04] [INFO ] Deduced a trap composed of 69 places in 419 ms of which 6 ms to minimize.
[2025-06-02 05:25:05] [INFO ] Deduced a trap composed of 32 places in 412 ms of which 5 ms to minimize.
[2025-06-02 05:25:05] [INFO ] Deduced a trap composed of 24 places in 406 ms of which 6 ms to minimize.
[2025-06-02 05:25:06] [INFO ] Deduced a trap composed of 67 places in 404 ms of which 6 ms to minimize.
[2025-06-02 05:25:06] [INFO ] Deduced a trap composed of 13 places in 407 ms of which 5 ms to minimize.
[2025-06-02 05:25:06] [INFO ] Deduced a trap composed of 118 places in 413 ms of which 6 ms to minimize.
[2025-06-02 05:25:07] [INFO ] Deduced a trap composed of 71 places in 415 ms of which 5 ms to minimize.
[2025-06-02 05:25:07] [INFO ] Deduced a trap composed of 101 places in 422 ms of which 6 ms to minimize.
[2025-06-02 05:25:08] [INFO ] Deduced a trap composed of 86 places in 415 ms of which 6 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 05:25:08] [INFO ] Flatten gal took : 88 ms
[2025-06-02 05:25:08] [INFO ] Applying decomposition
[2025-06-02 05:25:08] [INFO ] Flatten gal took : 78 ms
At refinement iteration 14 (INCLUDED_ONLY) 0/2968 variables, 20/1666 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10561112313657245938.txt' '-o' '/tmp/graph10561112313657245938.bin' '-w' '/tmp/graph10561112313657245938.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10561112313657245938.bin' '-l' '-1' '-v' '-w' '/tmp/graph10561112313657245938.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:25:09] [INFO ] Decomposing Gal with order
[2025-06-02 05:25:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:25:10] [INFO ] Removed a total of 2493 redundant transitions.
[2025-06-02 05:25:10] [INFO ] Flatten gal took : 840 ms
[2025-06-02 05:25:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 299 labels/synchronizations in 74 ms.
[2025-06-02 05:25:10] [INFO ] Deduced a trap composed of 101 places in 424 ms of which 6 ms to minimize.
[2025-06-02 05:25:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10775695257401383367.gal : 32 ms
[2025-06-02 05:25:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4703447596145114995.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10775695257401383367.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4703447596145114995.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/ReachabilityCardinality4703447596145114995.prop.
[2025-06-02 05:25:11] [INFO ] Deduced a trap composed of 33 places in 398 ms of which 5 ms to minimize.
[2025-06-02 05:25:11] [INFO ] Deduced a trap composed of 40 places in 419 ms of which 6 ms to minimize.
[2025-06-02 05:25:12] [INFO ] Deduced a trap composed of 45 places in 411 ms of which 8 ms to minimize.
[2025-06-02 05:25:12] [INFO ] Deduced a trap composed of 80 places in 451 ms of which 5 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 21
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :21 after 24
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :24 after 32
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :32 after 45
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :45 after 54
[2025-06-02 05:25:13] [INFO ] Deduced a trap composed of 110 places in 444 ms of which 6 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :54 after 66
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :66 after 180
[2025-06-02 05:25:13] [INFO ] Deduced a trap composed of 63 places in 435 ms of which 6 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :180 after 360
[2025-06-02 05:25:14] [INFO ] Deduced a trap composed of 24 places in 428 ms of which 5 ms to minimize.
[2025-06-02 05:25:14] [INFO ] Deduced a trap composed of 57 places in 431 ms of which 6 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :360 after 1013
[2025-06-02 05:25:15] [INFO ] Deduced a trap composed of 125 places in 429 ms of which 6 ms to minimize.
[2025-06-02 05:25:15] [INFO ] Deduced a trap composed of 87 places in 423 ms of which 6 ms to minimize.
[2025-06-02 05:25:16] [INFO ] Deduced a trap composed of 28 places in 424 ms of which 6 ms to minimize.
[2025-06-02 05:25:16] [INFO ] Deduced a trap composed of 105 places in 419 ms of which 6 ms to minimize.
[2025-06-02 05:25:17] [INFO ] Deduced a trap composed of 24 places in 421 ms of which 5 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1013 after 6110
[2025-06-02 05:25:18] [INFO ] Deduced a trap composed of 15 places in 417 ms of which 6 ms to minimize.
[2025-06-02 05:25:18] [INFO ] Deduced a trap composed of 31 places in 415 ms of which 5 ms to minimize.
[2025-06-02 05:25:19] [INFO ] Deduced a trap composed of 15 places in 396 ms of which 6 ms to minimize.
[2025-06-02 05:25:19] [INFO ] Deduced a trap composed of 36 places in 410 ms of which 6 ms to minimize.
[2025-06-02 05:25:20] [INFO ] Deduced a trap composed of 77 places in 398 ms of which 5 ms to minimize.
[2025-06-02 05:25:20] [INFO ] Deduced a trap composed of 39 places in 407 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2968 variables, 20/1686 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :6110 after 12442
[2025-06-02 05:25:22] [INFO ] Deduced a trap composed of 61 places in 413 ms of which 6 ms to minimize.
Problem MAX0 is UNSAT
[2025-06-02 05:25:24] [INFO ] Deduced a trap composed of 37 places in 951 ms of which 17 ms to minimize.
SMT process timed out in 49354ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1840 ms.
Support contains 456 out of 1096 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 62 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 1096/1096 places, 2208/2208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 54 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2025-06-02 05:25:26] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2025-06-02 05:25:26] [INFO ] Invariant cache hit.
[2025-06-02 05:25:27] [INFO ] Implicit Places using invariants in 791 ms returned []
[2025-06-02 05:25:27] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2025-06-02 05:25:27] [INFO ] Invariant cache hit.
[2025-06-02 05:25:28] [INFO ] State equation strengthened by 497 read => feed constraints.
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :12442 after 34906
[2025-06-02 05:25:34] [INFO ] Implicit Places using invariants and state equation in 7192 ms returned []
Implicit Place search using SMT with State Equation took 8006 ms to find 0 implicit places.
[2025-06-02 05:25:34] [INFO ] Redundant transitions in 177 ms returned []
Running 2200 sub problems to find dead transitions.
[2025-06-02 05:25:34] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2025-06-02 05:25:34] [INFO ] Invariant cache hit.
[2025-06-02 05:25:34] [INFO ] State equation strengthened by 497 read => feed constraints.
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :34906 after 123479
Detected timeout of ITS tools.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.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 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.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 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 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 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1096 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1096/2968 variables, and 23 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/1096 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 2200/2200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1096 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
[2025-06-02 05:26:06] [INFO ] Deduced a trap composed of 66 places in 381 ms of which 6 ms to minimize.
[2025-06-02 05:26:07] [INFO ] Deduced a trap composed of 17 places in 404 ms of which 5 ms to minimize.
[2025-06-02 05:26:07] [INFO ] Deduced a trap composed of 55 places in 425 ms of which 5 ms to minimize.
[2025-06-02 05:26:08] [INFO ] Deduced a trap composed of 75 places in 437 ms of which 6 ms to minimize.
[2025-06-02 05:26:08] [INFO ] Deduced a trap composed of 19 places in 431 ms of which 6 ms to minimize.
[2025-06-02 05:26:09] [INFO ] Deduced a trap composed of 68 places in 414 ms of which 5 ms to minimize.
[2025-06-02 05:26:09] [INFO ] Deduced a trap composed of 28 places in 400 ms of which 6 ms to minimize.
[2025-06-02 05:26:10] [INFO ] Deduced a trap composed of 71 places in 406 ms of which 5 ms to minimize.
[2025-06-02 05:26:10] [INFO ] Deduced a trap composed of 64 places in 403 ms of which 5 ms to minimize.
[2025-06-02 05:26:10] [INFO ] Deduced a trap composed of 76 places in 408 ms of which 5 ms to minimize.
[2025-06-02 05:26:11] [INFO ] Deduced a trap composed of 70 places in 407 ms of which 6 ms to minimize.
[2025-06-02 05:26:11] [INFO ] Deduced a trap composed of 80 places in 422 ms of which 5 ms to minimize.
[2025-06-02 05:26:12] [INFO ] Deduced a trap composed of 51 places in 426 ms of which 6 ms to minimize.
[2025-06-02 05:26:12] [INFO ] Deduced a trap composed of 28 places in 431 ms of which 6 ms to minimize.
[2025-06-02 05:26:13] [INFO ] Deduced a trap composed of 37 places in 420 ms of which 6 ms to minimize.
[2025-06-02 05:26:13] [INFO ] Deduced a trap composed of 80 places in 400 ms of which 6 ms to minimize.
[2025-06-02 05:26:13] [INFO ] Deduced a trap composed of 38 places in 426 ms of which 6 ms to minimize.
[2025-06-02 05:26:14] [INFO ] Deduced a trap composed of 62 places in 433 ms of which 6 ms to minimize.
[2025-06-02 05:26:14] [INFO ] Deduced a trap composed of 49 places in 432 ms of which 5 ms to minimize.
[2025-06-02 05:26:15] [INFO ] Deduced a trap composed of 40 places in 411 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1096 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
[2025-06-02 05:26:16] [INFO ] Deduced a trap composed of 59 places in 330 ms of which 5 ms to minimize.
[2025-06-02 05:26:16] [INFO ] Deduced a trap composed of 49 places in 336 ms of which 5 ms to minimize.
[2025-06-02 05:26:16] [INFO ] Deduced a trap composed of 49 places in 343 ms of which 5 ms to minimize.
[2025-06-02 05:26:17] [INFO ] Deduced a trap composed of 78 places in 324 ms of which 4 ms to minimize.
[2025-06-02 05:26:17] [INFO ] Deduced a trap composed of 56 places in 338 ms of which 5 ms to minimize.
[2025-06-02 05:26:17] [INFO ] Deduced a trap composed of 80 places in 329 ms of which 5 ms to minimize.
[2025-06-02 05:26:18] [INFO ] Deduced a trap composed of 96 places in 331 ms of which 5 ms to minimize.
[2025-06-02 05:26:18] [INFO ] Deduced a trap composed of 77 places in 351 ms of which 5 ms to minimize.
[2025-06-02 05:26:18] [INFO ] Deduced a trap composed of 17 places in 340 ms of which 5 ms to minimize.
[2025-06-02 05:26:19] [INFO ] Deduced a trap composed of 39 places in 314 ms of which 5 ms to minimize.
[2025-06-02 05:26:19] [INFO ] Deduced a trap composed of 35 places in 296 ms of which 5 ms to minimize.
[2025-06-02 05:26:19] [INFO ] Deduced a trap composed of 17 places in 304 ms of which 4 ms to minimize.
[2025-06-02 05:26:20] [INFO ] Deduced a trap composed of 104 places in 344 ms of which 5 ms to minimize.
[2025-06-02 05:26:20] [INFO ] Deduced a trap composed of 17 places in 337 ms of which 5 ms to minimize.
[2025-06-02 05:26:21] [INFO ] Deduced a trap composed of 46 places in 437 ms of which 6 ms to minimize.
[2025-06-02 05:26:21] [INFO ] Deduced a trap composed of 28 places in 400 ms of which 6 ms to minimize.
[2025-06-02 05:26:21] [INFO ] Deduced a trap composed of 31 places in 422 ms of which 5 ms to minimize.
[2025-06-02 05:26:22] [INFO ] Deduced a trap composed of 28 places in 414 ms of which 6 ms to minimize.
[2025-06-02 05:26:22] [INFO ] Deduced a trap composed of 67 places in 428 ms of which 6 ms to minimize.
[2025-06-02 05:26:23] [INFO ] Deduced a trap composed of 67 places in 415 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1096 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
[2025-06-02 05:26:24] [INFO ] Deduced a trap composed of 28 places in 391 ms of which 6 ms to minimize.
[2025-06-02 05:26:24] [INFO ] Deduced a trap composed of 28 places in 421 ms of which 6 ms to minimize.
[2025-06-02 05:26:24] [INFO ] Deduced a trap composed of 28 places in 407 ms of which 6 ms to minimize.
[2025-06-02 05:26:25] [INFO ] Deduced a trap composed of 28 places in 429 ms of which 7 ms to minimize.
[2025-06-02 05:26:25] [INFO ] Deduced a trap composed of 13 places in 394 ms of which 5 ms to minimize.
[2025-06-02 05:26:26] [INFO ] Deduced a trap composed of 15 places in 408 ms of which 6 ms to minimize.
[2025-06-02 05:26:26] [INFO ] Deduced a trap composed of 58 places in 373 ms of which 5 ms to minimize.
[2025-06-02 05:26:27] [INFO ] Deduced a trap composed of 40 places in 368 ms of which 5 ms to minimize.
[2025-06-02 05:26:27] [INFO ] Deduced a trap composed of 58 places in 373 ms of which 6 ms to minimize.
[2025-06-02 05:26:27] [INFO ] Deduced a trap composed of 43 places in 366 ms of which 5 ms to minimize.
[2025-06-02 05:26:28] [INFO ] Deduced a trap composed of 25 places in 331 ms of which 4 ms to minimize.
[2025-06-02 05:26:28] [INFO ] Deduced a trap composed of 85 places in 322 ms of which 5 ms to minimize.
[2025-06-02 05:26:28] [INFO ] Deduced a trap composed of 86 places in 323 ms of which 6 ms to minimize.
[2025-06-02 05:26:29] [INFO ] Deduced a trap composed of 80 places in 329 ms of which 6 ms to minimize.
[2025-06-02 05:26:29] [INFO ] Deduced a trap composed of 101 places in 318 ms of which 5 ms to minimize.
[2025-06-02 05:26:29] [INFO ] Deduced a trap composed of 98 places in 315 ms of which 5 ms to minimize.
[2025-06-02 05:26:30] [INFO ] Deduced a trap composed of 21 places in 307 ms of which 5 ms to minimize.
[2025-06-02 05:26:30] [INFO ] Deduced a trap composed of 76 places in 377 ms of which 5 ms to minimize.
[2025-06-02 05:26:31] [INFO ] Deduced a trap composed of 45 places in 379 ms of which 6 ms to minimize.
[2025-06-02 05:26:31] [INFO ] Deduced a trap composed of 44 places in 377 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1096 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
[2025-06-02 05:26:32] [INFO ] Deduced a trap composed of 44 places in 384 ms of which 6 ms to minimize.
[2025-06-02 05:26:32] [INFO ] Deduced a trap composed of 85 places in 380 ms of which 6 ms to minimize.
[2025-06-02 05:26:33] [INFO ] Deduced a trap composed of 23 places in 372 ms of which 6 ms to minimize.
[2025-06-02 05:26:33] [INFO ] Deduced a trap composed of 17 places in 394 ms of which 6 ms to minimize.
[2025-06-02 05:26:33] [INFO ] Deduced a trap composed of 25 places in 321 ms of which 5 ms to minimize.
[2025-06-02 05:26:34] [INFO ] Deduced a trap composed of 118 places in 451 ms of which 6 ms to minimize.
[2025-06-02 05:26:34] [INFO ] Deduced a trap composed of 62 places in 446 ms of which 6 ms to minimize.
[2025-06-02 05:26:35] [INFO ] Deduced a trap composed of 78 places in 446 ms of which 6 ms to minimize.
[2025-06-02 05:26:35] [INFO ] Deduced a trap composed of 32 places in 425 ms of which 6 ms to minimize.
SMT process timed out in 61158ms, After SMT, problems are : Problem set: 0 solved, 2200 unsolved
Search for dead transitions found 0 dead transitions in 61180ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69436 ms. Remains : 1096/1096 places, 2208/2208 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 7] Max Struct:[8, 8]
Starting property specific reduction for Peterson-COL-7-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
[2025-06-02 05:26:35] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2025-06-02 05:26:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (2 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2025-06-02 05:26:35] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2025-06-02 05:26:35] [INFO ] Invariant cache hit.
[2025-06-02 05:26:35] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2025-06-02 05:26:36] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2025-06-02 05:26:36] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 05:26:36] [INFO ] [Real]Added 497 Read/Feed constraints in 49 ms returned sat
[2025-06-02 05:26:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:26:36] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2025-06-02 05:26:37] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2025-06-02 05:26:37] [INFO ] [Nat]Added 497 Read/Feed constraints in 314 ms returned sat
[2025-06-02 05:26:37] [INFO ] Deduced a trap composed of 104 places in 403 ms of which 5 ms to minimize.
[2025-06-02 05:26:38] [INFO ] Deduced a trap composed of 51 places in 393 ms of which 5 ms to minimize.
[2025-06-02 05:26:38] [INFO ] Deduced a trap composed of 15 places in 381 ms of which 5 ms to minimize.
[2025-06-02 05:26:39] [INFO ] Deduced a trap composed of 96 places in 399 ms of which 5 ms to minimize.
[2025-06-02 05:26:39] [INFO ] Deduced a trap composed of 54 places in 397 ms of which 6 ms to minimize.
[2025-06-02 05:26:40] [INFO ] Deduced a trap composed of 40 places in 412 ms of which 6 ms to minimize.
[2025-06-02 05:26:40] [INFO ] Deduced a trap composed of 77 places in 393 ms of which 6 ms to minimize.
[2025-06-02 05:26:41] [INFO ] Deduced a trap composed of 56 places in 387 ms of which 5 ms to minimize.
[2025-06-02 05:26:41] [INFO ] Deduced a trap composed of 31 places in 384 ms of which 8 ms to minimize.
[2025-06-02 05:26:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 8 out of 1096 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 1096 transition count 2103
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 991 transition count 2103
Performed 343 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 343 Pre rules applied. Total rules applied 210 place count 991 transition count 1760
Deduced a syphon composed of 343 places in 1 ms
Reduce places removed 343 places and 0 transitions.
Iterating global reduction 2 with 686 rules applied. Total rules applied 896 place count 648 transition count 1760
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 1008 place count 592 transition count 1704
Applied a total of 1008 rules in 81 ms. Remains 592 /1096 variables (removed 504) and now considering 1704/2208 (removed 504) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 592/1096 places, 1704/2208 transitions.
[2025-06-02 05:26:41] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2025-06-02 05:26:41] [INFO ] Computed 23 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 2127 ms. (469 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 647 ms. (1543 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[8]
[2025-06-02 05:26:44] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:26:44] [INFO ] Invariant cache hit.
[2025-06-02 05:26:44] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2025-06-02 05:26:44] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2025-06-02 05:26:44] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 05:26:44] [INFO ] [Real]Added 497 Read/Feed constraints in 42 ms returned sat
[2025-06-02 05:26:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:26:45] [INFO ] [Nat]Absence check using 23 positive place invariants in 9 ms returned sat
[2025-06-02 05:26:45] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2025-06-02 05:26:45] [INFO ] [Nat]Added 497 Read/Feed constraints in 119 ms returned sat
[2025-06-02 05:26:45] [INFO ] Deduced a trap composed of 22 places in 220 ms of which 4 ms to minimize.
[2025-06-02 05:26:45] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:26:46] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:26:46] [INFO ] Deduced a trap composed of 36 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:26:46] [INFO ] Deduced a trap composed of 45 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:26:46] [INFO ] Deduced a trap composed of 36 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:26:47] [INFO ] Deduced a trap composed of 36 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:26:47] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:26:47] [INFO ] Deduced a trap composed of 48 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:26:48] [INFO ] Deduced a trap composed of 60 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:26:48] [INFO ] Deduced a trap composed of 36 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:26:48] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:26:48] [INFO ] Deduced a trap composed of 22 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:26:49] [INFO ] Deduced a trap composed of 48 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:26:49] [INFO ] Deduced a trap composed of 67 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:26:49] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 4 ms to minimize.
[2025-06-02 05:26:49] [INFO ] Deduced a trap composed of 22 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:26:50] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:26:50] [INFO ] Deduced a trap composed of 62 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:26:50] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:26:50] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:26:51] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:26:51] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:26:51] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:26:51] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:26:52] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:26:52] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:26:52] [INFO ] Deduced a trap composed of 59 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:26:52] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 2 ms to minimize.
[2025-06-02 05:26:53] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:26:53] [INFO ] Deduced a trap composed of 68 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:26:53] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:26:53] [INFO ] Deduced a trap composed of 83 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:26:54] [INFO ] Deduced a trap composed of 48 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:26:54] [INFO ] Deduced a trap composed of 42 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:26:54] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:26:54] [INFO ] Deduced a trap composed of 33 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:26:55] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:26:55] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:26:55] [INFO ] Deduced a trap composed of 29 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:26:56] [INFO ] Deduced a trap composed of 47 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:26:56] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:26:56] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:26:58] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:26:59] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:27:02] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 4 ms to minimize.
[2025-06-02 05:27:02] [INFO ] Deduced a trap composed of 58 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:27:02] [INFO ] Deduced a trap composed of 68 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:27:02] [INFO ] Deduced a trap composed of 103 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:27:03] [INFO ] Deduced a trap composed of 65 places in 187 ms of which 2 ms to minimize.
[2025-06-02 05:27:03] [INFO ] Deduced a trap composed of 60 places in 188 ms of which 2 ms to minimize.
[2025-06-02 05:27:03] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 2 ms to minimize.
[2025-06-02 05:27:03] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 4 ms to minimize.
[2025-06-02 05:27:04] [INFO ] Deduced a trap composed of 64 places in 195 ms of which 2 ms to minimize.
[2025-06-02 05:27:06] [INFO ] Deduced a trap composed of 58 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:27:06] [INFO ] Deduced a trap composed of 61 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:27:06] [INFO ] Deduced a trap composed of 45 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:27:08] [INFO ] Deduced a trap composed of 58 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:27:09] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 2 ms to minimize.
[2025-06-02 05:27:09] [INFO ] Deduced a trap composed of 33 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:27:09] [INFO ] Deduced a trap composed of 46 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:27:09] [INFO ] Deduced a trap composed of 42 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:27:10] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:27:10] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 2 ms to minimize.
[2025-06-02 05:27:10] [INFO ] Deduced a trap composed of 83 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:27:11] [INFO ] Deduced a trap composed of 58 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:27:11] [INFO ] Deduced a trap composed of 78 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:27:11] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:27:12] [INFO ] Deduced a trap composed of 66 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:27:12] [INFO ] Deduced a trap composed of 45 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:27:12] [INFO ] Deduced a trap composed of 88 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:27:13] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:27:13] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:27:14] [INFO ] Deduced a trap composed of 73 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:27:14] [INFO ] Deduced a trap composed of 39 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:27:14] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:27:14] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:27:15] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:27:15] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:27:16] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:27:17] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 3 ms to minimize.
[2025-06-02 05:27:18] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:27:18] [INFO ] Deduced a trap composed of 48 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:27:19] [INFO ] Deduced a trap composed of 67 places in 192 ms of which 3 ms to minimize.
[2025-06-02 05:27:19] [INFO ] Deduced a trap composed of 49 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:27:20] [INFO ] Deduced a trap composed of 64 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:27:21] [INFO ] Deduced a trap composed of 76 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:27:21] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:27:21] [INFO ] Deduced a trap composed of 47 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:27:22] [INFO ] Deduced a trap composed of 81 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:27:22] [INFO ] Deduced a trap composed of 73 places in 208 ms of which 4 ms to minimize.
[2025-06-02 05:27:23] [INFO ] Deduced a trap composed of 71 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:27:25] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:27:28] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 3 ms to minimize.
[2025-06-02 05:27:28] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:27:29] [INFO ] Deduced a trap composed of 54 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:27:29] [INFO ] Deduced a trap composed of 29 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:27:29] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 2 ms to minimize.
[2025-06-02 05:27:30] [INFO ] Deduced a trap composed of 40 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:27:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[8]
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 23 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 592/592 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 23 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2025-06-02 05:27:30] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:27:30] [INFO ] Invariant cache hit.
[2025-06-02 05:27:30] [INFO ] Implicit Places using invariants in 328 ms returned []
[2025-06-02 05:27:30] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:27:30] [INFO ] Invariant cache hit.
[2025-06-02 05:27:30] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 05:27:33] [INFO ] Implicit Places using invariants and state equation in 2790 ms returned []
Implicit Place search using SMT with State Equation took 3121 ms to find 0 implicit places.
[2025-06-02 05:27:33] [INFO ] Redundant transitions in 29 ms returned []
Running 1696 sub problems to find dead transitions.
[2025-06-02 05:27:33] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:27:33] [INFO ] Invariant cache hit.
[2025-06-02 05:27:33] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:27:48] [INFO ] Deduced a trap composed of 79 places in 248 ms of which 4 ms to minimize.
[2025-06-02 05:27:48] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:27:49] [INFO ] Deduced a trap composed of 53 places in 235 ms of which 3 ms to minimize.
[2025-06-02 05:27:49] [INFO ] Deduced a trap composed of 37 places in 254 ms of which 3 ms to minimize.
[2025-06-02 05:27:49] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 3 ms to minimize.
[2025-06-02 05:27:49] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:27:50] [INFO ] Deduced a trap composed of 81 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:27:50] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:27:50] [INFO ] Deduced a trap composed of 61 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:27:50] [INFO ] Deduced a trap composed of 35 places in 216 ms of which 4 ms to minimize.
[2025-06-02 05:27:50] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 4 ms to minimize.
[2025-06-02 05:27:51] [INFO ] Deduced a trap composed of 68 places in 226 ms of which 3 ms to minimize.
[2025-06-02 05:27:51] [INFO ] Deduced a trap composed of 81 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:27:51] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 4 ms to minimize.
[2025-06-02 05:27:51] [INFO ] Deduced a trap composed of 109 places in 210 ms of which 4 ms to minimize.
[2025-06-02 05:27:52] [INFO ] Deduced a trap composed of 59 places in 209 ms of which 4 ms to minimize.
[2025-06-02 05:27:52] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:27:52] [INFO ] Deduced a trap composed of 43 places in 227 ms of which 3 ms to minimize.
[2025-06-02 05:27:52] [INFO ] Deduced a trap composed of 54 places in 217 ms of which 4 ms to minimize.
[2025-06-02 05:27:52] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:27:53] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 4 ms to minimize.
[2025-06-02 05:27:53] [INFO ] Deduced a trap composed of 49 places in 255 ms of which 3 ms to minimize.
[2025-06-02 05:27:54] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:27:54] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 4 ms to minimize.
[2025-06-02 05:27:54] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 3 ms to minimize.
[2025-06-02 05:27:54] [INFO ] Deduced a trap composed of 24 places in 226 ms of which 3 ms to minimize.
[2025-06-02 05:27:54] [INFO ] Deduced a trap composed of 55 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:27:55] [INFO ] Deduced a trap composed of 59 places in 229 ms of which 3 ms to minimize.
[2025-06-02 05:27:55] [INFO ] Deduced a trap composed of 29 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:27:55] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:27:55] [INFO ] Deduced a trap composed of 50 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:27:56] [INFO ] Deduced a trap composed of 53 places in 228 ms of which 4 ms to minimize.
[2025-06-02 05:27:56] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 3 ms to minimize.
[2025-06-02 05:27:56] [INFO ] Deduced a trap composed of 14 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:27:56] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:27:57] [INFO ] Deduced a trap composed of 67 places in 217 ms of which 4 ms to minimize.
[2025-06-02 05:27:57] [INFO ] Deduced a trap composed of 68 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:27:57] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:27:57] [INFO ] Deduced a trap composed of 66 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:27:58] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:27:58] [INFO ] Deduced a trap composed of 33 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:27:58] [INFO ] Deduced a trap composed of 95 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:27:58] [INFO ] Deduced a trap composed of 51 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:27:59] [INFO ] Deduced a trap composed of 74 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:27:59] [INFO ] Deduced a trap composed of 84 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:27:59] [INFO ] Deduced a trap composed of 53 places in 219 ms of which 4 ms to minimize.
[2025-06-02 05:27:59] [INFO ] Deduced a trap composed of 63 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:28:00] [INFO ] Deduced a trap composed of 43 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:28:00] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 4 ms to minimize.
[2025-06-02 05:28:00] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:28:00] [INFO ] Deduced a trap composed of 65 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:28:00] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:28:01] [INFO ] Deduced a trap composed of 46 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:28:01] [INFO ] Deduced a trap composed of 66 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:28:01] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 3 ms to minimize.
[2025-06-02 05:28:01] [INFO ] Deduced a trap composed of 53 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:28:02] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 3 ms to minimize.
[2025-06-02 05:28:02] [INFO ] Deduced a trap composed of 45 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:28:02] [INFO ] Deduced a trap composed of 56 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:28:02] [INFO ] Deduced a trap composed of 23 places in 223 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/1960 variables, and 83 constraints, problems are : Problem set: 0 solved, 1696 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/592 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1696/1696 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1696 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 60/83 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:28:05] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:28:05] [INFO ] Deduced a trap composed of 52 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:28:05] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:28:05] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:28:06] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:28:06] [INFO ] Deduced a trap composed of 54 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:28:06] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:28:06] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:28:06] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:28:07] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:28:07] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:28:07] [INFO ] Deduced a trap composed of 61 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:28:07] [INFO ] Deduced a trap composed of 74 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:28:08] [INFO ] Deduced a trap composed of 33 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:28:08] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:28:08] [INFO ] Deduced a trap composed of 43 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:28:08] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:28:08] [INFO ] Deduced a trap composed of 36 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:28:09] [INFO ] Deduced a trap composed of 102 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:28:09] [INFO ] Deduced a trap composed of 47 places in 203 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:28:09] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:28:10] [INFO ] Deduced a trap composed of 64 places in 241 ms of which 4 ms to minimize.
[2025-06-02 05:28:10] [INFO ] Deduced a trap composed of 40 places in 241 ms of which 3 ms to minimize.
[2025-06-02 05:28:10] [INFO ] Deduced a trap composed of 68 places in 241 ms of which 3 ms to minimize.
[2025-06-02 05:28:10] [INFO ] Deduced a trap composed of 26 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:28:11] [INFO ] Deduced a trap composed of 39 places in 251 ms of which 3 ms to minimize.
[2025-06-02 05:28:11] [INFO ] Deduced a trap composed of 35 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:28:11] [INFO ] Deduced a trap composed of 68 places in 248 ms of which 3 ms to minimize.
[2025-06-02 05:28:11] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:28:12] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:28:12] [INFO ] Deduced a trap composed of 22 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:28:12] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:28:12] [INFO ] Deduced a trap composed of 14 places in 217 ms of which 4 ms to minimize.
[2025-06-02 05:28:13] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 3 ms to minimize.
[2025-06-02 05:28:13] [INFO ] Deduced a trap composed of 36 places in 241 ms of which 3 ms to minimize.
[2025-06-02 05:28:13] [INFO ] Deduced a trap composed of 39 places in 240 ms of which 3 ms to minimize.
[2025-06-02 05:28:13] [INFO ] Deduced a trap composed of 46 places in 233 ms of which 3 ms to minimize.
[2025-06-02 05:28:14] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 4 ms to minimize.
[2025-06-02 05:28:14] [INFO ] Deduced a trap composed of 70 places in 232 ms of which 3 ms to minimize.
[2025-06-02 05:28:14] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:28:15] [INFO ] Deduced a trap composed of 33 places in 252 ms of which 3 ms to minimize.
[2025-06-02 05:28:15] [INFO ] Deduced a trap composed of 36 places in 261 ms of which 4 ms to minimize.
[2025-06-02 05:28:15] [INFO ] Deduced a trap composed of 36 places in 231 ms of which 3 ms to minimize.
[2025-06-02 05:28:15] [INFO ] Deduced a trap composed of 78 places in 219 ms of which 4 ms to minimize.
[2025-06-02 05:28:16] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:28:16] [INFO ] Deduced a trap composed of 54 places in 232 ms of which 3 ms to minimize.
[2025-06-02 05:28:16] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:28:16] [INFO ] Deduced a trap composed of 53 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:28:17] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:28:17] [INFO ] Deduced a trap composed of 46 places in 244 ms of which 3 ms to minimize.
[2025-06-02 05:28:17] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:28:17] [INFO ] Deduced a trap composed of 88 places in 251 ms of which 3 ms to minimize.
[2025-06-02 05:28:18] [INFO ] Deduced a trap composed of 28 places in 236 ms of which 3 ms to minimize.
[2025-06-02 05:28:18] [INFO ] Deduced a trap composed of 44 places in 238 ms of which 4 ms to minimize.
[2025-06-02 05:28:18] [INFO ] Deduced a trap composed of 40 places in 284 ms of which 3 ms to minimize.
[2025-06-02 05:28:18] [INFO ] Deduced a trap composed of 83 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:28:19] [INFO ] Deduced a trap composed of 42 places in 216 ms of which 4 ms to minimize.
[2025-06-02 05:28:19] [INFO ] Deduced a trap composed of 102 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:28:19] [INFO ] Deduced a trap composed of 56 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:28:19] [INFO ] Deduced a trap composed of 63 places in 236 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:28:20] [INFO ] Deduced a trap composed of 109 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:28:20] [INFO ] Deduced a trap composed of 111 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:28:21] [INFO ] Deduced a trap composed of 85 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:28:21] [INFO ] Deduced a trap composed of 67 places in 233 ms of which 3 ms to minimize.
[2025-06-02 05:28:21] [INFO ] Deduced a trap composed of 60 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:28:21] [INFO ] Deduced a trap composed of 76 places in 220 ms of which 4 ms to minimize.
[2025-06-02 05:28:21] [INFO ] Deduced a trap composed of 97 places in 215 ms of which 4 ms to minimize.
[2025-06-02 05:28:22] [INFO ] Deduced a trap composed of 38 places in 230 ms of which 3 ms to minimize.
[2025-06-02 05:28:22] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 3 ms to minimize.
[2025-06-02 05:28:22] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:28:22] [INFO ] Deduced a trap composed of 36 places in 226 ms of which 3 ms to minimize.
[2025-06-02 05:28:23] [INFO ] Deduced a trap composed of 29 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:28:23] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 4 ms to minimize.
[2025-06-02 05:28:23] [INFO ] Deduced a trap composed of 54 places in 235 ms of which 3 ms to minimize.
[2025-06-02 05:28:23] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 3 ms to minimize.
[2025-06-02 05:28:24] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:28:24] [INFO ] Deduced a trap composed of 42 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:28:24] [INFO ] Deduced a trap composed of 53 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:28:24] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:28:24] [INFO ] Deduced a trap composed of 48 places in 218 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:28:25] [INFO ] Deduced a trap composed of 66 places in 244 ms of which 4 ms to minimize.
[2025-06-02 05:28:25] [INFO ] Deduced a trap composed of 42 places in 241 ms of which 4 ms to minimize.
[2025-06-02 05:28:26] [INFO ] Deduced a trap composed of 26 places in 236 ms of which 3 ms to minimize.
[2025-06-02 05:28:26] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 4 ms to minimize.
[2025-06-02 05:28:26] [INFO ] Deduced a trap composed of 54 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:28:26] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:28:27] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:28:27] [INFO ] Deduced a trap composed of 57 places in 235 ms of which 4 ms to minimize.
[2025-06-02 05:28:27] [INFO ] Deduced a trap composed of 42 places in 233 ms of which 3 ms to minimize.
[2025-06-02 05:28:27] [INFO ] Deduced a trap composed of 50 places in 232 ms of which 3 ms to minimize.
[2025-06-02 05:28:28] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 4 ms to minimize.
[2025-06-02 05:28:28] [INFO ] Deduced a trap composed of 51 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:28:28] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:28:28] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:28:29] [INFO ] Deduced a trap composed of 111 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:28:29] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:28:29] [INFO ] Deduced a trap composed of 81 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:28:29] [INFO ] Deduced a trap composed of 84 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:28:29] [INFO ] Deduced a trap composed of 37 places in 221 ms of which 4 ms to minimize.
[2025-06-02 05:28:30] [INFO ] Deduced a trap composed of 44 places in 219 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/592 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:28:30] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:28:31] [INFO ] Deduced a trap composed of 36 places in 229 ms of which 4 ms to minimize.
[2025-06-02 05:28:31] [INFO ] Deduced a trap composed of 56 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:28:31] [INFO ] Deduced a trap composed of 57 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:28:31] [INFO ] Deduced a trap composed of 63 places in 216 ms of which 4 ms to minimize.
[2025-06-02 05:28:32] [INFO ] Deduced a trap composed of 85 places in 216 ms of which 4 ms to minimize.
[2025-06-02 05:28:32] [INFO ] Deduced a trap composed of 61 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:28:32] [INFO ] Deduced a trap composed of 51 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:28:32] [INFO ] Deduced a trap composed of 45 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:28:32] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:28:33] [INFO ] Deduced a trap composed of 58 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:28:33] [INFO ] Deduced a trap composed of 40 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:28:33] [INFO ] Deduced a trap composed of 52 places in 229 ms of which 3 ms to minimize.
[2025-06-02 05:28:33] [INFO ] Deduced a trap composed of 54 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:28:34] [INFO ] Deduced a trap composed of 83 places in 208 ms of which 2 ms to minimize.
SMT process timed out in 60868ms, After SMT, problems are : Problem set: 0 solved, 1696 unsolved
Search for dead transitions found 0 dead transitions in 60885ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64066 ms. Remains : 592/592 places, 1704/1704 transitions.
RANDOM walk for 40000 steps (8 resets) in 407 ms. (98 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
[2025-06-02 05:28:34] [INFO ] Flatten gal took : 220 ms
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 2/2 properties
[2025-06-02 05:28:34] [INFO ] Flatten gal took : 96 ms
[2025-06-02 05:28:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14802174832920524313.gal : 9 ms
[2025-06-02 05:28:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12629373978430003956.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14802174832920524313.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12629373978430003956.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12629373978430003956.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 18
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :18 after 25
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :25 after 32
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :32 after 77
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :77 after 184
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :184 after 382
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :382 after 506
Interrupted probabilistic random walk after 411408 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 2
Probabilistic random walk after 411408 steps, saw 64769 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
[2025-06-02 05:28:37] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:28:37] [INFO ] Invariant cache hit.
[2025-06-02 05:28:37] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 520/528 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/536 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1368/1904 variables, 536/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1904 variables, 497/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1904 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 56/1960 variables, 56/1105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1960 variables, 7/1112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1960 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1960 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1960/1960 variables, and 1112 constraints, problems are : Problem set: 0 solved, 2 unsolved in 681 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 592/592 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 520/528 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/536 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1368/1904 variables, 536/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1904 variables, 497/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1904 variables, 2/1051 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1904 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 56/1960 variables, 56/1107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1960 variables, 7/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:28:39] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 5 ms to minimize.
[2025-06-02 05:28:39] [INFO ] Deduced a trap composed of 57 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:28:39] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 4 ms to minimize.
[2025-06-02 05:28:39] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:28:40] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:28:40] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :506 after 3621
[2025-06-02 05:28:40] [INFO ] Deduced a trap composed of 38 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:28:40] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:28:41] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:28:41] [INFO ] Deduced a trap composed of 109 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:28:41] [INFO ] Deduced a trap composed of 56 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:28:41] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:28:42] [INFO ] Deduced a trap composed of 46 places in 210 ms of which 4 ms to minimize.
[2025-06-02 05:28:42] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:28:42] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 4 ms to minimize.
[2025-06-02 05:28:42] [INFO ] Deduced a trap composed of 15 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:28:43] [INFO ] Deduced a trap composed of 68 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:28:43] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 3 ms to minimize.
SMT process timed out in 5836ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 23 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 592/592 places, 1704/1704 transitions.
RANDOM walk for 40000 steps (8 resets) in 801 ms. (49 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3621 after 7265
Interrupted probabilistic random walk after 407979 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :0 out of 2
Probabilistic random walk after 407979 steps, saw 64432 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
[2025-06-02 05:28:46] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:28:46] [INFO ] Invariant cache hit.
[2025-06-02 05:28:46] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 520/528 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/536 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1368/1904 variables, 536/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1904 variables, 497/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1904 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 56/1960 variables, 56/1105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1960 variables, 7/1112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1960 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1960 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1960/1960 variables, and 1112 constraints, problems are : Problem set: 0 solved, 2 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 592/592 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 520/528 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/536 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1368/1904 variables, 536/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1904 variables, 497/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1904 variables, 2/1051 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1904 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 56/1960 variables, 56/1107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1960 variables, 7/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:28:48] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:28:48] [INFO ] Deduced a trap composed of 57 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:28:48] [INFO ] Deduced a trap composed of 25 places in 244 ms of which 3 ms to minimize.
[2025-06-02 05:28:49] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 4 ms to minimize.
[2025-06-02 05:28:49] [INFO ] Deduced a trap composed of 32 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:28:49] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:28:49] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:28:50] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:28:50] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:28:50] [INFO ] Deduced a trap composed of 109 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:28:50] [INFO ] Deduced a trap composed of 56 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:28:50] [INFO ] Deduced a trap composed of 35 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:28:51] [INFO ] Deduced a trap composed of 46 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:28:51] [INFO ] Deduced a trap composed of 40 places in 214 ms of which 4 ms to minimize.
[2025-06-02 05:28:51] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :7265 after 9883
[2025-06-02 05:28:51] [INFO ] Deduced a trap composed of 15 places in 257 ms of which 4 ms to minimize.
[2025-06-02 05:28:52] [INFO ] Deduced a trap composed of 68 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:28:52] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:28:52] [INFO ] Deduced a trap composed of 54 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:28:52] [INFO ] Deduced a trap composed of 62 places in 219 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1960 variables, 20/1134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:28:53] [INFO ] Deduced a trap composed of 38 places in 275 ms of which 3 ms to minimize.
[2025-06-02 05:28:53] [INFO ] Deduced a trap composed of 100 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:28:53] [INFO ] Deduced a trap composed of 60 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:28:54] [INFO ] Deduced a trap composed of 46 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:28:54] [INFO ] Deduced a trap composed of 30 places in 285 ms of which 3 ms to minimize.
[2025-06-02 05:28:54] [INFO ] Deduced a trap composed of 56 places in 290 ms of which 4 ms to minimize.
[2025-06-02 05:28:55] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:28:55] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:28:55] [INFO ] Deduced a trap composed of 57 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:28:55] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:28:56] [INFO ] Deduced a trap composed of 12 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:28:56] [INFO ] Deduced a trap composed of 83 places in 229 ms of which 3 ms to minimize.
[2025-06-02 05:28:56] [INFO ] Deduced a trap composed of 24 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:28:56] [INFO ] Deduced a trap composed of 45 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:28:57] [INFO ] Deduced a trap composed of 96 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:28:57] [INFO ] Deduced a trap composed of 129 places in 232 ms of which 4 ms to minimize.
[2025-06-02 05:28:57] [INFO ] Deduced a trap composed of 73 places in 227 ms of which 3 ms to minimize.
[2025-06-02 05:28:57] [INFO ] Deduced a trap composed of 53 places in 274 ms of which 3 ms to minimize.
[2025-06-02 05:28:58] [INFO ] Deduced a trap composed of 58 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:28:58] [INFO ] Deduced a trap composed of 45 places in 294 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1960 variables, 20/1154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:28:58] [INFO ] Deduced a trap composed of 44 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:28:59] [INFO ] Deduced a trap composed of 92 places in 217 ms of which 4 ms to minimize.
[2025-06-02 05:28:59] [INFO ] Deduced a trap composed of 22 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:28:59] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:28:59] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 4 ms to minimize.
[2025-06-02 05:29:00] [INFO ] Deduced a trap composed of 46 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:29:00] [INFO ] Deduced a trap composed of 20 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:29:00] [INFO ] Deduced a trap composed of 37 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:29:00] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:29:01] [INFO ] Deduced a trap composed of 78 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:29:01] [INFO ] Deduced a trap composed of 34 places in 216 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
[2025-06-02 05:29:01] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 4 ms to minimize.
[2025-06-02 05:29:01] [INFO ] Deduced a trap composed of 81 places in 187 ms of which 3 ms to minimize.
[2025-06-02 05:29:02] [INFO ] Deduced a trap composed of 68 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:29:02] [INFO ] Deduced a trap composed of 68 places in 188 ms of which 3 ms to minimize.
[2025-06-02 05:29:02] [INFO ] Deduced a trap composed of 55 places in 185 ms of which 2 ms to minimize.
[2025-06-02 05:29:02] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 2 ms to minimize.
[2025-06-02 05:29:02] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 3 ms to minimize.
[2025-06-02 05:29:03] [INFO ] Deduced a trap composed of 45 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:29:03] [INFO ] Deduced a trap composed of 21 places in 190 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/1960 variables, 20/1174 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 05:29:03] [INFO ] Deduced a trap composed of 14 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:29:04] [INFO ] Deduced a trap composed of 16 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:29:04] [INFO ] Deduced a trap composed of 65 places in 189 ms of which 3 ms to minimize.
[2025-06-02 05:29:04] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:29:04] [INFO ] Deduced a trap composed of 102 places in 188 ms of which 3 ms to minimize.
[2025-06-02 05:29:04] [INFO ] Deduced a trap composed of 75 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:29:05] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:29:05] [INFO ] Deduced a trap composed of 56 places in 189 ms of which 3 ms to minimize.
[2025-06-02 05:29:05] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 3 ms to minimize.
[2025-06-02 05:29:05] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:29:06] [INFO ] Deduced a trap composed of 76 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:29:06] [INFO ] Deduced a trap composed of 71 places in 181 ms of which 2 ms to minimize.
[2025-06-02 05:29:06] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:29:06] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 3 ms to minimize.
[2025-06-02 05:29:06] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 3 ms to minimize.
[2025-06-02 05:29:07] [INFO ] Deduced a trap composed of 55 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:29:07] [INFO ] Deduced a trap composed of 33 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:29:07] [INFO ] Deduced a trap composed of 50 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:29:07] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:29:08] [INFO ] Deduced a trap composed of 85 places in 205 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1960 variables, 20/1194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 05:29:08] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:29:08] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 3 ms to minimize.
[2025-06-02 05:29:08] [INFO ] Deduced a trap composed of 85 places in 192 ms of which 3 ms to minimize.
[2025-06-02 05:29:09] [INFO ] Deduced a trap composed of 74 places in 192 ms of which 3 ms to minimize.
[2025-06-02 05:29:09] [INFO ] Deduced a trap composed of 67 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:29:09] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 3 ms to minimize.
[2025-06-02 05:29:09] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 3 ms to minimize.
[2025-06-02 05:29:10] [INFO ] Deduced a trap composed of 14 places in 312 ms of which 6 ms to minimize.
[2025-06-02 05:29:10] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 4 ms to minimize.
[2025-06-02 05:29:10] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 3 ms to minimize.
[2025-06-02 05:29:10] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 3 ms to minimize.
[2025-06-02 05:29:11] [INFO ] Deduced a trap composed of 50 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:29:11] [INFO ] Deduced a trap composed of 61 places in 192 ms of which 3 ms to minimize.
[2025-06-02 05:29:11] [INFO ] Deduced a trap composed of 82 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:29:12] [INFO ] Deduced a trap composed of 52 places in 234 ms of which 6 ms to minimize.
[2025-06-02 05:29:12] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:29:13] [INFO ] Deduced a trap composed of 29 places in 248 ms of which 3 ms to minimize.
[2025-06-02 05:29:13] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 3 ms to minimize.
[2025-06-02 05:29:13] [INFO ] Deduced a trap composed of 91 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:29:13] [INFO ] Deduced a trap composed of 100 places in 184 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1960 variables, 20/1214 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 05:29:14] [INFO ] Deduced a trap composed of 42 places in 188 ms of which 3 ms to minimize.
[2025-06-02 05:29:14] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 3 ms to minimize.
[2025-06-02 05:29:14] [INFO ] Deduced a trap composed of 60 places in 157 ms of which 2 ms to minimize.
[2025-06-02 05:29:15] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:29:15] [INFO ] Deduced a trap composed of 64 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:29:15] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 3 ms to minimize.
[2025-06-02 05:29:15] [INFO ] Deduced a trap composed of 50 places in 189 ms of which 3 ms to minimize.
[2025-06-02 05:29:16] [INFO ] Deduced a trap composed of 56 places in 169 ms of which 2 ms to minimize.
[2025-06-02 05:29:16] [INFO ] Deduced a trap composed of 82 places in 168 ms of which 3 ms to minimize.
[2025-06-02 05:29:16] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 3 ms to minimize.
[2025-06-02 05:29:17] [INFO ] Deduced a trap composed of 99 places in 176 ms of which 3 ms to minimize.
[2025-06-02 05:29:17] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 3 ms to minimize.
[2025-06-02 05:29:17] [INFO ] Deduced a trap composed of 81 places in 176 ms of which 3 ms to minimize.
[2025-06-02 05:29:17] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 3 ms to minimize.
[2025-06-02 05:29:18] [INFO ] Deduced a trap composed of 67 places in 179 ms of which 3 ms to minimize.
[2025-06-02 05:29:18] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 3 ms to minimize.
[2025-06-02 05:29:18] [INFO ] Deduced a trap composed of 72 places in 170 ms of which 2 ms to minimize.
[2025-06-02 05:29:19] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 3 ms to minimize.
[2025-06-02 05:29:19] [INFO ] Deduced a trap composed of 56 places in 175 ms of which 13 ms to minimize.
[2025-06-02 05:29:19] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1960 variables, 20/1234 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 05:29:19] [INFO ] Deduced a trap composed of 84 places in 173 ms of which 2 ms to minimize.
[2025-06-02 05:29:20] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 3 ms to minimize.
[2025-06-02 05:29:20] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 3 ms to minimize.
[2025-06-02 05:29:20] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 3 ms to minimize.
[2025-06-02 05:29:20] [INFO ] Deduced a trap composed of 84 places in 180 ms of which 2 ms to minimize.
[2025-06-02 05:29:21] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 2 ms to minimize.
[2025-06-02 05:29:21] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 3 ms to minimize.
[2025-06-02 05:29:21] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 3 ms to minimize.
[2025-06-02 05:29:21] [INFO ] Deduced a trap composed of 78 places in 184 ms of which 3 ms to minimize.
[2025-06-02 05:29:22] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 2 ms to minimize.
[2025-06-02 05:29:22] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 2 ms to minimize.
[2025-06-02 05:29:23] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 2 ms to minimize.
[2025-06-02 05:29:23] [INFO ] Deduced a trap composed of 83 places in 148 ms of which 3 ms to minimize.
[2025-06-02 05:29:23] [INFO ] Deduced a trap composed of 102 places in 152 ms of which 2 ms to minimize.
[2025-06-02 05:29:23] [INFO ] Deduced a trap composed of 75 places in 155 ms of which 2 ms to minimize.
[2025-06-02 05:29:23] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 2 ms to minimize.
[2025-06-02 05:29:24] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 2 ms to minimize.
[2025-06-02 05:29:24] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 3 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 05:29:24] [INFO ] Deduced a trap composed of 46 places in 173 ms of which 2 ms to minimize.
[2025-06-02 05:29:24] [INFO ] Flatten gal took : 47 ms
[2025-06-02 05:29:24] [INFO ] Applying decomposition
[2025-06-02 05:29:24] [INFO ] Flatten gal took : 46 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/graph295071734259278882.txt' '-o' '/tmp/graph295071734259278882.bin' '-w' '/tmp/graph295071734259278882.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph295071734259278882.bin' '-l' '-1' '-v' '-w' '/tmp/graph295071734259278882.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:29:24] [INFO ] Decomposing Gal with order
[2025-06-02 05:29:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:29:24] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1960 variables, 20/1254 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 05:29:24] [INFO ] Removed a total of 2602 redundant transitions.
[2025-06-02 05:29:24] [INFO ] Flatten gal took : 96 ms
[2025-06-02 05:29:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 381 labels/synchronizations in 45 ms.
[2025-06-02 05:29:25] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 3 ms to minimize.
[2025-06-02 05:29:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2451224503585699300.gal : 13 ms
[2025-06-02 05:29:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11286404658020746043.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2451224503585699300.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11286404658020746043.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
[2025-06-02 05:29:25] [INFO ] Deduced a trap composed of 60 places in 193 ms of which 3 ms to minimize.
Loading property file /tmp/ReachabilityCardinality11286404658020746043.prop.
[2025-06-02 05:29:25] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 3 ms to minimize.
[2025-06-02 05:29:25] [INFO ] Deduced a trap composed of 86 places in 197 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 15
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :15 after 23
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :23 after 32
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :32 after 183
[2025-06-02 05:29:26] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :183 after 376
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :376 after 1632
[2025-06-02 05:29:26] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 3 ms to minimize.
[2025-06-02 05:29:26] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1632 after 5757
[2025-06-02 05:29:27] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:29:27] [INFO ] Deduced a trap composed of 47 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:29:27] [INFO ] Deduced a trap composed of 65 places in 186 ms of which 2 ms to minimize.
[2025-06-02 05:29:27] [INFO ] Deduced a trap composed of 65 places in 176 ms of which 3 ms to minimize.
[2025-06-02 05:29:28] [INFO ] Deduced a trap composed of 33 places in 200 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5757 after 26355
[2025-06-02 05:29:28] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 2 ms to minimize.
[2025-06-02 05:29:28] [INFO ] Deduced a trap composed of 60 places in 159 ms of which 3 ms to minimize.
[2025-06-02 05:29:29] [INFO ] Deduced a trap composed of 77 places in 174 ms of which 2 ms to minimize.
[2025-06-02 05:29:29] [INFO ] Deduced a trap composed of 58 places in 174 ms of which 3 ms to minimize.
[2025-06-02 05:29:30] [INFO ] Deduced a trap composed of 53 places in 211 ms of which 4 ms to minimize.
[2025-06-02 05:29:30] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:29:30] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :26355 after 101071
[2025-06-02 05:29:31] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1960 variables, 20/1274 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 05:29:31] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 3 ms to minimize.
[2025-06-02 05:29:32] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 2 ms to minimize.
SMT process timed out in 45807ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 21 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 592/592 places, 1704/1704 transitions.
RANDOM walk for 40000 steps (8 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 518697 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :0 out of 1
Probabilistic random walk after 518697 steps, saw 75768 distinct states, run finished after 3003 ms. (steps per millisecond=172 ) properties seen :0
[2025-06-02 05:29:35] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:29:35] [INFO ] Invariant cache hit.
[2025-06-02 05:29:35] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 520/528 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/536 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1368/1904 variables, 536/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1904 variables, 497/1049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1904 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 56/1960 variables, 56/1105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1960 variables, 7/1112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1960 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1960 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1960/1960 variables, and 1112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 592/592 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 520/528 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:29:36] [INFO ] Deduced a trap composed of 89 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/536 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1368/1904 variables, 536/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1904 variables, 497/1050 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1904 variables, 1/1051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1904 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/1960 variables, 56/1107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1960 variables, 7/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:29:36] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:29:37] [INFO ] Deduced a trap composed of 36 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:29:37] [INFO ] Deduced a trap composed of 34 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:29:37] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:29:37] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:29:38] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 2 ms to minimize.
[2025-06-02 05:29:38] [INFO ] Deduced a trap composed of 33 places in 219 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16384
[2025-06-02 05:29:38] [INFO ] Deduced a trap composed of 28 places in 221 ms of which 3 ms to minimize.
SDD size :101071 after 501083
[2025-06-02 05:29:38] [INFO ] Deduced a trap composed of 25 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:29:39] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:29:39] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:29:39] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:29:39] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:29:40] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:29:40] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:29:40] [INFO ] Deduced a trap composed of 28 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:29:40] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 4 ms to minimize.
[2025-06-02 05:29:41] [INFO ] Deduced a trap composed of 57 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:29:41] [INFO ] Deduced a trap composed of 45 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:29:41] [INFO ] Deduced a trap composed of 70 places in 198 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1960 variables, 20/1134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:29:41] [INFO ] Deduced a trap composed of 63 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:29:42] [INFO ] Deduced a trap composed of 74 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:29:42] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:29:43] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:29:43] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:29:43] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:29:43] [INFO ] Deduced a trap composed of 69 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:29:44] [INFO ] Deduced a trap composed of 34 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:29:44] [INFO ] Deduced a trap composed of 53 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:29:44] [INFO ] Deduced a trap composed of 78 places in 204 ms of which 2 ms to minimize.
[2025-06-02 05:29:44] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:29:45] [INFO ] Deduced a trap composed of 61 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:29:45] [INFO ] Deduced a trap composed of 33 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:29:45] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:29:45] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:29:46] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:29:46] [INFO ] Deduced a trap composed of 85 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:29:46] [INFO ] Deduced a trap composed of 47 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:29:46] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:29:47] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1960 variables, 20/1154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:29:47] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:29:47] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:29:48] [INFO ] Deduced a trap composed of 47 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:29:48] [INFO ] Deduced a trap composed of 57 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:29:48] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:29:48] [INFO ] Deduced a trap composed of 29 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:29:49] [INFO ] Deduced a trap composed of 22 places in 230 ms of which 3 ms to minimize.
[2025-06-02 05:29:49] [INFO ] Deduced a trap composed of 13 places in 273 ms of which 16 ms to minimize.
[2025-06-02 05:29:49] [INFO ] Deduced a trap composed of 27 places in 231 ms of which 3 ms to minimize.
[2025-06-02 05:29:50] [INFO ] Deduced a trap composed of 26 places in 307 ms of which 3 ms to minimize.
[2025-06-02 05:29:50] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:29:50] [INFO ] Deduced a trap composed of 26 places in 267 ms of which 4 ms to minimize.
[2025-06-02 05:29:51] [INFO ] Deduced a trap composed of 14 places in 359 ms of which 6 ms to minimize.
[2025-06-02 05:29:51] [INFO ] Deduced a trap composed of 51 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:29:51] [INFO ] Deduced a trap composed of 68 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:29:51] [INFO ] Deduced a trap composed of 53 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:29:52] [INFO ] Deduced a trap composed of 52 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:29:52] [INFO ] Deduced a trap composed of 29 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:29:52] [INFO ] Deduced a trap composed of 77 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:29:52] [INFO ] Deduced a trap composed of 66 places in 192 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1960 variables, 20/1174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:29:53] [INFO ] Deduced a trap composed of 62 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:29:53] [INFO ] Deduced a trap composed of 61 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:29:53] [INFO ] Deduced a trap composed of 54 places in 195 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 32768
[2025-06-02 05:29:53] [INFO ] Deduced a trap composed of 101 places in 203 ms of which 3 ms to minimize.
SDD size :501083 after 2.12762e+06
[2025-06-02 05:29:53] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:29:54] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:29:54] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:29:54] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:29:55] [INFO ] Deduced a trap composed of 20 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:29:55] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:29:55] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 3 ms to minimize.
[2025-06-02 05:29:55] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 3 ms to minimize.
[2025-06-02 05:29:56] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:29:56] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 3 ms to minimize.
[2025-06-02 05:29:56] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 3 ms to minimize.
[2025-06-02 05:29:56] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 3 ms to minimize.
[2025-06-02 05:29:57] [INFO ] Deduced a trap composed of 71 places in 192 ms of which 3 ms to minimize.
[2025-06-02 05:29:57] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:29:57] [INFO ] Deduced a trap composed of 30 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:29:57] [INFO ] Deduced a trap composed of 87 places in 196 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1960 variables, 20/1194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:29:58] [INFO ] Deduced a trap composed of 63 places in 187 ms of which 3 ms to minimize.
[2025-06-02 05:29:58] [INFO ] Deduced a trap composed of 78 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:29:58] [INFO ] Deduced a trap composed of 66 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:29:58] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 3 ms to minimize.
[2025-06-02 05:29:58] [INFO ] Deduced a trap composed of 41 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:29:59] [INFO ] Deduced a trap composed of 30 places in 189 ms of which 3 ms to minimize.
[2025-06-02 05:29:59] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:29:59] [INFO ] Deduced a trap composed of 56 places in 198 ms of which 3 ms to minimize.
[2025-06-02 05:30:00] [INFO ] Deduced a trap composed of 31 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:30:00] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 3 ms to minimize.
[2025-06-02 05:30:01] [INFO ] Deduced a trap composed of 51 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:30:01] [INFO ] Deduced a trap composed of 41 places in 186 ms of which 2 ms to minimize.
[2025-06-02 05:30:01] [INFO ] Deduced a trap composed of 54 places in 183 ms of which 3 ms to minimize.
[2025-06-02 05:30:02] [INFO ] Deduced a trap composed of 33 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:30:02] [INFO ] Deduced a trap composed of 47 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:30:02] [INFO ] Deduced a trap composed of 74 places in 186 ms of which 2 ms to minimize.
[2025-06-02 05:30:02] [INFO ] Deduced a trap composed of 108 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:30:03] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:30:03] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 3 ms to minimize.
[2025-06-02 05:30:05] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1960 variables, 20/1214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:30:06] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 2 ms to minimize.
[2025-06-02 05:30:06] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 2 ms to minimize.
[2025-06-02 05:30:07] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 3 ms to minimize.
[2025-06-02 05:30:07] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:30:07] [INFO ] Deduced a trap composed of 59 places in 186 ms of which 3 ms to minimize.
[2025-06-02 05:30:07] [INFO ] Deduced a trap composed of 33 places in 190 ms of which 2 ms to minimize.
[2025-06-02 05:30:08] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:30:08] [INFO ] Deduced a trap composed of 60 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:30:08] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 3 ms to minimize.
[2025-06-02 05:30:09] [INFO ] Deduced a trap composed of 59 places in 191 ms of which 2 ms to minimize.
[2025-06-02 05:30:09] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 3 ms to minimize.
[2025-06-02 05:30:09] [INFO ] Deduced a trap composed of 66 places in 173 ms of which 2 ms to minimize.
[2025-06-02 05:30:09] [INFO ] Deduced a trap composed of 82 places in 165 ms of which 2 ms to minimize.
[2025-06-02 05:30:10] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 3 ms to minimize.
[2025-06-02 05:30:10] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 2 ms to minimize.
[2025-06-02 05:30:10] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 2 ms to minimize.
[2025-06-02 05:30:11] [INFO ] Deduced a trap composed of 48 places in 178 ms of which 3 ms to minimize.
[2025-06-02 05:30:11] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 3 ms to minimize.
[2025-06-02 05:30:11] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 3 ms to minimize.
[2025-06-02 05:30:12] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1960 variables, 20/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:30:12] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 3 ms to minimize.
[2025-06-02 05:30:12] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 3 ms to minimize.
[2025-06-02 05:30:13] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 2 ms to minimize.
[2025-06-02 05:30:13] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 3 ms to minimize.
[2025-06-02 05:30:13] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 3 ms to minimize.
[2025-06-02 05:30:14] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 3 ms to minimize.
[2025-06-02 05:30:14] [INFO ] Deduced a trap composed of 63 places in 181 ms of which 3 ms to minimize.
[2025-06-02 05:30:14] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 3 ms to minimize.
[2025-06-02 05:30:14] [INFO ] Deduced a trap composed of 52 places in 167 ms of which 3 ms to minimize.
[2025-06-02 05:30:15] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 3 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 05:30:15] [INFO ] Deduced a trap composed of 47 places in 184 ms of which 3 ms to minimize.
[2025-06-02 05:30:15] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 2 ms to minimize.
[2025-06-02 05:30:16] [INFO ] Deduced a trap composed of 56 places in 189 ms of which 2 ms to minimize.
[2025-06-02 05:30:16] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 3 ms to minimize.
[2025-06-02 05:30:18] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:30:18] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 3 ms to minimize.
[2025-06-02 05:30:18] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 2 ms to minimize.
[2025-06-02 05:30:18] [INFO ] Deduced a trap composed of 73 places in 170 ms of which 3 ms to minimize.
[2025-06-02 05:30:18] [INFO ] Deduced a trap composed of 22 places in 196 ms of which 3 ms to minimize.
[2025-06-02 05:30:19] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1960 variables, 20/1254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:30:19] [INFO ] Deduced a trap composed of 55 places in 167 ms of which 2 ms to minimize.
[2025-06-02 05:30:19] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 3 ms to minimize.
[2025-06-02 05:30:20] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:30:20] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:30:20] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 3 ms to minimize.
[2025-06-02 05:30:21] [INFO ] Deduced a trap composed of 34 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:30:21] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 4 ms to minimize.
[2025-06-02 05:30:22] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:30:22] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 3 ms to minimize.
[2025-06-02 05:30:23] [INFO ] Deduced a trap composed of 25 places in 227 ms of which 3 ms to minimize.
[2025-06-02 05:30:24] [INFO ] Deduced a trap composed of 50 places in 200 ms of which 4 ms to minimize.
[2025-06-02 05:30:24] [INFO ] Deduced a trap composed of 24 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:30:24] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:30:25] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 3 ms to minimize.
[2025-06-02 05:30:25] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 2 ms to minimize.
[2025-06-02 05:30:25] [INFO ] Deduced a trap composed of 49 places in 155 ms of which 2 ms to minimize.
[2025-06-02 05:30:26] [INFO ] Deduced a trap composed of 58 places in 155 ms of which 2 ms to minimize.
[2025-06-02 05:30:26] [INFO ] Deduced a trap composed of 67 places in 157 ms of which 2 ms to minimize.
[2025-06-02 05:30:26] [INFO ] Deduced a trap composed of 79 places in 158 ms of which 2 ms to minimize.
[2025-06-02 05:30:26] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1960 variables, 20/1274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:30:26] [INFO ] Deduced a trap composed of 86 places in 158 ms of which 3 ms to minimize.
[2025-06-02 05:30:27] [INFO ] Deduced a trap composed of 64 places in 154 ms of which 3 ms to minimize.
[2025-06-02 05:30:27] [INFO ] Deduced a trap composed of 56 places in 168 ms of which 3 ms to minimize.
[2025-06-02 05:30:27] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 2 ms to minimize.
[2025-06-02 05:30:28] [INFO ] Deduced a trap composed of 56 places in 158 ms of which 2 ms to minimize.
[2025-06-02 05:30:28] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 3 ms to minimize.
[2025-06-02 05:30:28] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 3 ms to minimize.
[2025-06-02 05:30:28] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 3 ms to minimize.
[2025-06-02 05:30:29] [INFO ] Deduced a trap composed of 56 places in 159 ms of which 3 ms to minimize.
[2025-06-02 05:30:29] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 2 ms to minimize.
[2025-06-02 05:30:30] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 2 ms to minimize.
[2025-06-02 05:30:31] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 3 ms to minimize.
[2025-06-02 05:30:31] [INFO ] Deduced a trap composed of 63 places in 168 ms of which 2 ms to minimize.
[2025-06-02 05:30:32] [INFO ] Deduced a trap composed of 62 places in 169 ms of which 3 ms to minimize.
[2025-06-02 05:30:32] [INFO ] Deduced a trap composed of 58 places in 161 ms of which 2 ms to minimize.
[2025-06-02 05:30:33] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 3 ms to minimize.
[2025-06-02 05:30:33] [INFO ] Deduced a trap composed of 67 places in 167 ms of which 2 ms to minimize.
[2025-06-02 05:30:33] [INFO ] Deduced a trap composed of 66 places in 155 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1960/1960 variables, and 1292 constraints, problems are : Problem set: 0 solved, 1 unsolved in 67896 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 592/592 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 179/179 constraints]
After SMT, in 68380ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 96 ms.
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 20 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 592/592 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 19 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2025-06-02 05:30:44] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:30:44] [INFO ] Invariant cache hit.
[2025-06-02 05:30:44] [INFO ] Implicit Places using invariants in 374 ms returned []
[2025-06-02 05:30:44] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:30:44] [INFO ] Invariant cache hit.
[2025-06-02 05:30:44] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 05:30:47] [INFO ] Implicit Places using invariants and state equation in 2680 ms returned []
Implicit Place search using SMT with State Equation took 3056 ms to find 0 implicit places.
[2025-06-02 05:30:47] [INFO ] Redundant transitions in 32 ms returned []
Running 1696 sub problems to find dead transitions.
[2025-06-02 05:30:47] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2025-06-02 05:30:47] [INFO ] Invariant cache hit.
[2025-06-02 05:30:47] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:31:02] [INFO ] Deduced a trap composed of 79 places in 241 ms of which 3 ms to minimize.
[2025-06-02 05:31:02] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 3 ms to minimize.
[2025-06-02 05:31:03] [INFO ] Deduced a trap composed of 53 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:31:03] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:31:03] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 4 ms to minimize.
[2025-06-02 05:31:03] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:31:03] [INFO ] Deduced a trap composed of 81 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:31:04] [INFO ] Deduced a trap composed of 65 places in 195 ms of which 3 ms to minimize.
[2025-06-02 05:31:04] [INFO ] Deduced a trap composed of 61 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:31:04] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:31:04] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 4 ms to minimize.
[2025-06-02 05:31:05] [INFO ] Deduced a trap composed of 68 places in 217 ms of which 4 ms to minimize.
[2025-06-02 05:31:05] [INFO ] Deduced a trap composed of 81 places in 207 ms of which 5 ms to minimize.
[2025-06-02 05:31:05] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:31:05] [INFO ] Deduced a trap composed of 109 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:31:05] [INFO ] Deduced a trap composed of 59 places in 208 ms of which 4 ms to minimize.
[2025-06-02 05:31:06] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:31:06] [INFO ] Deduced a trap composed of 43 places in 239 ms of which 3 ms to minimize.
[2025-06-02 05:31:06] [INFO ] Deduced a trap composed of 54 places in 234 ms of which 3 ms to minimize.
[2025-06-02 05:31:06] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:31:07] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 4 ms to minimize.
[2025-06-02 05:31:07] [INFO ] Deduced a trap composed of 49 places in 235 ms of which 3 ms to minimize.
[2025-06-02 05:31:07] [INFO ] Deduced a trap composed of 41 places in 263 ms of which 3 ms to minimize.
[2025-06-02 05:31:08] [INFO ] Deduced a trap composed of 14 places in 231 ms of which 3 ms to minimize.
[2025-06-02 05:31:08] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 4 ms to minimize.
[2025-06-02 05:31:08] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 4 ms to minimize.
[2025-06-02 05:31:08] [INFO ] Deduced a trap composed of 55 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:31:09] [INFO ] Deduced a trap composed of 59 places in 231 ms of which 3 ms to minimize.
[2025-06-02 05:31:09] [INFO ] Deduced a trap composed of 29 places in 233 ms of which 4 ms to minimize.
[2025-06-02 05:31:09] [INFO ] Deduced a trap composed of 44 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:31:09] [INFO ] Deduced a trap composed of 50 places in 226 ms of which 4 ms to minimize.
[2025-06-02 05:31:10] [INFO ] Deduced a trap composed of 53 places in 227 ms of which 3 ms to minimize.
[2025-06-02 05:31:10] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 4 ms to minimize.
[2025-06-02 05:31:10] [INFO ] Deduced a trap composed of 14 places in 223 ms of which 4 ms to minimize.
[2025-06-02 05:31:10] [INFO ] Deduced a trap composed of 64 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:31:11] [INFO ] Deduced a trap composed of 67 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:31:11] [INFO ] Deduced a trap composed of 68 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:31:11] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:31:11] [INFO ] Deduced a trap composed of 66 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:31:11] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:31:12] [INFO ] Deduced a trap composed of 33 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:31:12] [INFO ] Deduced a trap composed of 95 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:31:12] [INFO ] Deduced a trap composed of 51 places in 214 ms of which 4 ms to minimize.
[2025-06-02 05:31:13] [INFO ] Deduced a trap composed of 74 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:31:13] [INFO ] Deduced a trap composed of 84 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:31:13] [INFO ] Deduced a trap composed of 53 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:31:13] [INFO ] Deduced a trap composed of 63 places in 230 ms of which 4 ms to minimize.
[2025-06-02 05:31:14] [INFO ] Deduced a trap composed of 43 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:31:14] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:31:14] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:31:14] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:31:14] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:31:15] [INFO ] Deduced a trap composed of 46 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:31:15] [INFO ] Deduced a trap composed of 66 places in 227 ms of which 3 ms to minimize.
[2025-06-02 05:31:15] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:31:15] [INFO ] Deduced a trap composed of 53 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:31:16] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:31:16] [INFO ] Deduced a trap composed of 45 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:31:16] [INFO ] Deduced a trap composed of 56 places in 172 ms of which 3 ms to minimize.
[2025-06-02 05:31:16] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.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 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.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 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.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 1.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.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 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 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 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 timeout
0.0)
(s478 0.0)
(s479 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/1960 variables, and 83 constraints, problems are : Problem set: 0 solved, 1696 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/592 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1696/1696 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1696 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 60/83 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:31:19] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:31:19] [INFO ] Deduced a trap composed of 52 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:31:19] [INFO ] Deduced a trap composed of 34 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:31:19] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:31:19] [INFO ] Deduced a trap composed of 22 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:31:20] [INFO ] Deduced a trap composed of 54 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:31:20] [INFO ] Deduced a trap composed of 38 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:31:20] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:31:20] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:31:21] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:31:21] [INFO ] Deduced a trap composed of 22 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:31:21] [INFO ] Deduced a trap composed of 61 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:31:21] [INFO ] Deduced a trap composed of 74 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:31:21] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:31:22] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:31:22] [INFO ] Deduced a trap composed of 43 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:31:22] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:31:22] [INFO ] Deduced a trap composed of 36 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:31:23] [INFO ] Deduced a trap composed of 102 places in 226 ms of which 3 ms to minimize.
[2025-06-02 05:31:23] [INFO ] Deduced a trap composed of 47 places in 206 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:31:23] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 3 ms to minimize.
[2025-06-02 05:31:24] [INFO ] Deduced a trap composed of 64 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:31:24] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:31:24] [INFO ] Deduced a trap composed of 68 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:31:24] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:31:24] [INFO ] Deduced a trap composed of 39 places in 218 ms of which 4 ms to minimize.
[2025-06-02 05:31:25] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:31:25] [INFO ] Deduced a trap composed of 68 places in 241 ms of which 3 ms to minimize.
[2025-06-02 05:31:25] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:31:25] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 3 ms to minimize.
[2025-06-02 05:31:26] [INFO ] Deduced a trap composed of 22 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:31:26] [INFO ] Deduced a trap composed of 24 places in 203 ms of which 3 ms to minimize.
[2025-06-02 05:31:26] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:31:26] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 3 ms to minimize.
[2025-06-02 05:31:27] [INFO ] Deduced a trap composed of 36 places in 236 ms of which 4 ms to minimize.
[2025-06-02 05:31:27] [INFO ] Deduced a trap composed of 39 places in 226 ms of which 3 ms to minimize.
[2025-06-02 05:31:27] [INFO ] Deduced a trap composed of 46 places in 240 ms of which 4 ms to minimize.
[2025-06-02 05:31:27] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 3 ms to minimize.
[2025-06-02 05:31:28] [INFO ] Deduced a trap composed of 70 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:31:28] [INFO ] Deduced a trap composed of 36 places in 219 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:31:28] [INFO ] Deduced a trap composed of 33 places in 233 ms of which 3 ms to minimize.
[2025-06-02 05:31:29] [INFO ] Deduced a trap composed of 36 places in 228 ms of which 3 ms to minimize.
[2025-06-02 05:31:29] [INFO ] Deduced a trap composed of 36 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:31:29] [INFO ] Deduced a trap composed of 78 places in 244 ms of which 4 ms to minimize.
[2025-06-02 05:31:29] [INFO ] Deduced a trap composed of 31 places in 230 ms of which 3 ms to minimize.
[2025-06-02 05:31:30] [INFO ] Deduced a trap composed of 54 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:31:30] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:31:30] [INFO ] Deduced a trap composed of 53 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:31:30] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:31:30] [INFO ] Deduced a trap composed of 46 places in 207 ms of which 3 ms to minimize.
[2025-06-02 05:31:31] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:31:31] [INFO ] Deduced a trap composed of 88 places in 239 ms of which 3 ms to minimize.
[2025-06-02 05:31:31] [INFO ] Deduced a trap composed of 28 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:31:31] [INFO ] Deduced a trap composed of 44 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:31:32] [INFO ] Deduced a trap composed of 40 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:31:32] [INFO ] Deduced a trap composed of 83 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:31:32] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:31:32] [INFO ] Deduced a trap composed of 102 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:31:33] [INFO ] Deduced a trap composed of 56 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:31:33] [INFO ] Deduced a trap composed of 63 places in 210 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:31:33] [INFO ] Deduced a trap composed of 109 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:31:34] [INFO ] Deduced a trap composed of 111 places in 221 ms of which 3 ms to minimize.
[2025-06-02 05:31:34] [INFO ] Deduced a trap composed of 85 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:31:34] [INFO ] Deduced a trap composed of 67 places in 229 ms of which 3 ms to minimize.
[2025-06-02 05:31:34] [INFO ] Deduced a trap composed of 60 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:31:35] [INFO ] Deduced a trap composed of 76 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:31:35] [INFO ] Deduced a trap composed of 97 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:31:35] [INFO ] Deduced a trap composed of 38 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:31:35] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:31:36] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 3 ms to minimize.
[2025-06-02 05:31:36] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:31:36] [INFO ] Deduced a trap composed of 29 places in 222 ms of which 3 ms to minimize.
[2025-06-02 05:31:36] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:31:36] [INFO ] Deduced a trap composed of 54 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:31:37] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 6 ms to minimize.
[2025-06-02 05:31:37] [INFO ] Deduced a trap composed of 36 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:31:37] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:31:37] [INFO ] Deduced a trap composed of 53 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:31:38] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 3 ms to minimize.
[2025-06-02 05:31:38] [INFO ] Deduced a trap composed of 48 places in 222 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:31:39] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 4 ms to minimize.
[2025-06-02 05:31:39] [INFO ] Deduced a trap composed of 42 places in 241 ms of which 3 ms to minimize.
[2025-06-02 05:31:39] [INFO ] Deduced a trap composed of 26 places in 238 ms of which 3 ms to minimize.
[2025-06-02 05:31:39] [INFO ] Deduced a trap composed of 33 places in 229 ms of which 4 ms to minimize.
[2025-06-02 05:31:40] [INFO ] Deduced a trap composed of 54 places in 218 ms of which 3 ms to minimize.
[2025-06-02 05:31:40] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 3 ms to minimize.
[2025-06-02 05:31:40] [INFO ] Deduced a trap composed of 40 places in 223 ms of which 3 ms to minimize.
[2025-06-02 05:31:40] [INFO ] Deduced a trap composed of 57 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:31:40] [INFO ] Deduced a trap composed of 42 places in 227 ms of which 3 ms to minimize.
[2025-06-02 05:31:41] [INFO ] Deduced a trap composed of 50 places in 230 ms of which 3 ms to minimize.
[2025-06-02 05:31:41] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 3 ms to minimize.
[2025-06-02 05:31:41] [INFO ] Deduced a trap composed of 51 places in 204 ms of which 3 ms to minimize.
[2025-06-02 05:31:41] [INFO ] Deduced a trap composed of 38 places in 219 ms of which 3 ms to minimize.
[2025-06-02 05:31:42] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 3 ms to minimize.
[2025-06-02 05:31:42] [INFO ] Deduced a trap composed of 111 places in 235 ms of which 3 ms to minimize.
[2025-06-02 05:31:42] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 3 ms to minimize.
[2025-06-02 05:31:42] [INFO ] Deduced a trap composed of 81 places in 215 ms of which 3 ms to minimize.
[2025-06-02 05:31:43] [INFO ] Deduced a trap composed of 84 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:31:43] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 3 ms to minimize.
[2025-06-02 05:31:43] [INFO ] Deduced a trap composed of 44 places in 219 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/592 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 1696 unsolved
[2025-06-02 05:31:44] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 3 ms to minimize.
[2025-06-02 05:31:44] [INFO ] Deduced a trap composed of 36 places in 218 ms of which 4 ms to minimize.
[2025-06-02 05:31:44] [INFO ] Deduced a trap composed of 56 places in 214 ms of which 3 ms to minimize.
[2025-06-02 05:31:44] [INFO ] Deduced a trap composed of 57 places in 212 ms of which 3 ms to minimize.
[2025-06-02 05:31:45] [INFO ] Deduced a trap composed of 63 places in 213 ms of which 3 ms to minimize.
[2025-06-02 05:31:45] [INFO ] Deduced a trap composed of 85 places in 217 ms of which 3 ms to minimize.
[2025-06-02 05:31:45] [INFO ] Deduced a trap composed of 61 places in 211 ms of which 3 ms to minimize.
[2025-06-02 05:31:45] [INFO ] Deduced a trap composed of 51 places in 199 ms of which 3 ms to minimize.
[2025-06-02 05:31:45] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 3 ms to minimize.
[2025-06-02 05:31:46] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:31:46] [INFO ] Deduced a trap composed of 58 places in 202 ms of which 3 ms to minimize.
[2025-06-02 05:31:46] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 3 ms to minimize.
[2025-06-02 05:31:46] [INFO ] Deduced a trap composed of 52 places in 197 ms of which 3 ms to minimize.
[2025-06-02 05:31:47] [INFO ] Deduced a trap composed of 54 places in 224 ms of which 4 ms to minimize.
[2025-06-02 05:31:47] [INFO ] Deduced a trap composed of 83 places in 208 ms of which 3 ms to minimize.
[2025-06-02 05:31:47] [INFO ] Deduced a trap composed of 92 places in 193 ms of which 3 ms to minimize.
[2025-06-02 05:31:47] [INFO ] Deduced a trap composed of 83 places in 209 ms of which 3 ms to minimize.
[2025-06-02 05:31:48] [INFO ] Deduced a trap composed of 103 places in 209 ms of which 3 ms to minimize.
SMT process timed out in 60876ms, After SMT, problems are : Problem set: 0 solved, 1696 unsolved
Search for dead transitions found 0 dead transitions in 60890ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64012 ms. Remains : 592/592 places, 1704/1704 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[8]
Ending property specific reduction for Peterson-COL-7-UpperBounds-05 in 312247 ms.
Starting property specific reduction for Peterson-COL-7-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
[2025-06-02 05:31:48] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2025-06-02 05:31:48] [INFO ] Computed 23 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (2 resets) in 75 ms. (131 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 59 ms. (166 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[8]
[2025-06-02 05:31:48] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2025-06-02 05:31:48] [INFO ] Invariant cache hit.
[2025-06-02 05:31:48] [INFO ] [Real]Absence check using 23 positive place invariants in 15 ms returned sat
[2025-06-02 05:31:48] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2025-06-02 05:31:48] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 05:31:48] [INFO ] [Real]Added 497 Read/Feed constraints in 47 ms returned sat
[2025-06-02 05:31:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:31:48] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2025-06-02 05:31:49] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2025-06-02 05:31:49] [INFO ] [Nat]Added 497 Read/Feed constraints in 144 ms returned sat
[2025-06-02 05:31:50] [INFO ] Deduced a trap composed of 32 places in 456 ms of which 6 ms to minimize.
[2025-06-02 05:31:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 584 ms
[2025-06-02 05:31:50] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 111 ms.
[2025-06-02 05:31:52] [INFO ] Added : 70 causal constraints over 15 iterations in 1906 ms. Result :sat
Minimization took 503 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[8]
Support contains 448 out of 1096 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 1096 transition count 2200
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1088 transition count 2200
Applied a total of 16 rules in 57 ms. Remains 1088 /1096 variables (removed 8) and now considering 2200/2208 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 1088/1096 places, 2200/2208 transitions.
[2025-06-02 05:31:52] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2025-06-02 05:31:52] [INFO ] Computed 23 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 7540 ms. (132 steps per ms)
BEST_FIRST walk for 862922 steps (2 resets) in 5001 ms. (172 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[8]
[2025-06-02 05:32:05] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2025-06-02 05:32:05] [INFO ] Invariant cache hit.
[2025-06-02 05:32:05] [INFO ] [Real]Absence check using 23 positive place invariants in 15 ms returned sat
[2025-06-02 05:32:05] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2025-06-02 05:32:05] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 05:32:05] [INFO ] [Real]Added 497 Read/Feed constraints in 76 ms returned sat
[2025-06-02 05:32:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:32:06] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2025-06-02 05:32:06] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2025-06-02 05:32:06] [INFO ] [Nat]Added 497 Read/Feed constraints in 171 ms returned sat
[2025-06-02 05:32:07] [INFO ] Deduced a trap composed of 32 places in 396 ms of which 6 ms to minimize.
[2025-06-02 05:32:07] [INFO ] Deduced a trap composed of 52 places in 393 ms of which 5 ms to minimize.
[2025-06-02 05:32:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 974 ms
[2025-06-02 05:32:07] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 107 ms.
[2025-06-02 05:32:09] [INFO ] Deduced a trap composed of 35 places in 468 ms of which 7 ms to minimize.
[2025-06-02 05:32:09] [INFO ] Deduced a trap composed of 42 places in 412 ms of which 6 ms to minimize.
[2025-06-02 05:32:10] [INFO ] Deduced a trap composed of 24 places in 386 ms of which 6 ms to minimize.
[2025-06-02 05:32:11] [INFO ] Deduced a trap composed of 45 places in 369 ms of which 6 ms to minimize.
[2025-06-02 05:32:11] [INFO ] Deduced a trap composed of 42 places in 355 ms of which 6 ms to minimize.
[2025-06-02 05:32:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2947 ms
[2025-06-02 05:32:12] [INFO ] Deduced a trap composed of 57 places in 356 ms of which 5 ms to minimize.
[2025-06-02 05:32:13] [INFO ] Deduced a trap composed of 55 places in 339 ms of which 5 ms to minimize.
[2025-06-02 05:32:13] [INFO ] Deduced a trap composed of 99 places in 267 ms of which 5 ms to minimize.
[2025-06-02 05:32:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1441 ms
[2025-06-02 05:32:14] [INFO ] Added : 69 causal constraints over 15 iterations in 6698 ms. Result :sat
Minimization took 990 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[8]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 35 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 35 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2025-06-02 05:32:16] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2025-06-02 05:32:16] [INFO ] Invariant cache hit.
[2025-06-02 05:32:16] [INFO ] Implicit Places using invariants in 394 ms returned []
[2025-06-02 05:32:16] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2025-06-02 05:32:16] [INFO ] Invariant cache hit.
[2025-06-02 05:32:17] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 05:32:21] [INFO ] Implicit Places using invariants and state equation in 4880 ms returned []
Implicit Place search using SMT with State Equation took 5277 ms to find 0 implicit places.
[2025-06-02 05:32:21] [INFO ] Redundant transitions in 45 ms returned []
Running 2192 sub problems to find dead transitions.
[2025-06-02 05:32:21] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2025-06-02 05:32:21] [INFO ] Invariant cache hit.
[2025-06-02 05:32:21] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1088 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/2952 variables, and 23 constraints, problems are : Problem set: 0 solved, 2192 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/1088 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 2192/2192 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1088 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2192 unsolved
[2025-06-02 05:32:53] [INFO ] Deduced a trap composed of 17 places in 409 ms of which 6 ms to minimize.
[2025-06-02 05:32:54] [INFO ] Deduced a trap composed of 19 places in 429 ms of which 6 ms to minimize.
[2025-06-02 05:32:54] [INFO ] Deduced a trap composed of 97 places in 409 ms of which 5 ms to minimize.
[2025-06-02 05:32:54] [INFO ] Deduced a trap composed of 28 places in 424 ms of which 6 ms to minimize.
[2025-06-02 05:32:55] [INFO ] Deduced a trap composed of 24 places in 408 ms of which 6 ms to minimize.
[2025-06-02 05:32:55] [INFO ] Deduced a trap composed of 137 places in 430 ms of which 6 ms to minimize.
[2025-06-02 05:32:56] [INFO ] Deduced a trap composed of 60 places in 425 ms of which 6 ms to minimize.
[2025-06-02 05:32:56] [INFO ] Deduced a trap composed of 75 places in 409 ms of which 6 ms to minimize.
[2025-06-02 05:32:57] [INFO ] Deduced a trap composed of 75 places in 384 ms of which 5 ms to minimize.
[2025-06-02 05:32:57] [INFO ] Deduced a trap composed of 114 places in 397 ms of which 5 ms to minimize.
[2025-06-02 05:32:58] [INFO ] Deduced a trap composed of 28 places in 410 ms of which 5 ms to minimize.
[2025-06-02 05:32:58] [INFO ] Deduced a trap composed of 79 places in 365 ms of which 5 ms to minimize.
[2025-06-02 05:32:58] [INFO ] Deduced a trap composed of 122 places in 350 ms of which 5 ms to minimize.
[2025-06-02 05:32:59] [INFO ] Deduced a trap composed of 65 places in 325 ms of which 4 ms to minimize.
[2025-06-02 05:32:59] [INFO ] Deduced a trap composed of 39 places in 299 ms of which 4 ms to minimize.
[2025-06-02 05:32:59] [INFO ] Deduced a trap composed of 33 places in 325 ms of which 5 ms to minimize.
[2025-06-02 05:33:00] [INFO ] Deduced a trap composed of 44 places in 335 ms of which 5 ms to minimize.
[2025-06-02 05:33:00] [INFO ] Deduced a trap composed of 44 places in 322 ms of which 4 ms to minimize.
[2025-06-02 05:33:00] [INFO ] Deduced a trap composed of 31 places in 413 ms of which 5 ms to minimize.
[2025-06-02 05:33:01] [INFO ] Deduced a trap composed of 17 places in 420 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1088 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 2192 unsolved
[2025-06-02 05:33:02] [INFO ] Deduced a trap composed of 28 places in 392 ms of which 6 ms to minimize.
[2025-06-02 05:33:02] [INFO ] Deduced a trap composed of 28 places in 406 ms of which 5 ms to minimize.
[2025-06-02 05:33:03] [INFO ] Deduced a trap composed of 23 places in 356 ms of which 5 ms to minimize.
[2025-06-02 05:33:03] [INFO ] Deduced a trap composed of 43 places in 389 ms of which 5 ms to minimize.
[2025-06-02 05:33:03] [INFO ] Deduced a trap composed of 47 places in 386 ms of which 6 ms to minimize.
[2025-06-02 05:33:04] [INFO ] Deduced a trap composed of 25 places in 401 ms of which 5 ms to minimize.
[2025-06-02 05:33:04] [INFO ] Deduced a trap composed of 78 places in 405 ms of which 5 ms to minimize.
[2025-06-02 05:33:05] [INFO ] Deduced a trap composed of 49 places in 408 ms of which 5 ms to minimize.
[2025-06-02 05:33:05] [INFO ] Deduced a trap composed of 28 places in 396 ms of which 5 ms to minimize.
[2025-06-02 05:33:05] [INFO ] Deduced a trap composed of 46 places in 404 ms of which 5 ms to minimize.
[2025-06-02 05:33:06] [INFO ] Deduced a trap composed of 47 places in 398 ms of which 6 ms to minimize.
[2025-06-02 05:33:06] [INFO ] Deduced a trap composed of 39 places in 401 ms of which 5 ms to minimize.
[2025-06-02 05:33:07] [INFO ] Deduced a trap composed of 29 places in 397 ms of which 6 ms to minimize.
[2025-06-02 05:33:07] [INFO ] Deduced a trap composed of 28 places in 396 ms of which 6 ms to minimize.
[2025-06-02 05:33:08] [INFO ] Deduced a trap composed of 68 places in 396 ms of which 5 ms to minimize.
[2025-06-02 05:33:08] [INFO ] Deduced a trap composed of 53 places in 387 ms of which 6 ms to minimize.
[2025-06-02 05:33:08] [INFO ] Deduced a trap composed of 28 places in 395 ms of which 6 ms to minimize.
[2025-06-02 05:33:09] [INFO ] Deduced a trap composed of 42 places in 396 ms of which 5 ms to minimize.
[2025-06-02 05:33:09] [INFO ] Deduced a trap composed of 123 places in 397 ms of which 6 ms to minimize.
[2025-06-02 05:33:10] [INFO ] Deduced a trap composed of 53 places in 403 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1088 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 2192 unsolved
[2025-06-02 05:33:10] [INFO ] Deduced a trap composed of 54 places in 382 ms of which 6 ms to minimize.
[2025-06-02 05:33:11] [INFO ] Deduced a trap composed of 48 places in 397 ms of which 5 ms to minimize.
[2025-06-02 05:33:11] [INFO ] Deduced a trap composed of 62 places in 395 ms of which 6 ms to minimize.
[2025-06-02 05:33:12] [INFO ] Deduced a trap composed of 28 places in 393 ms of which 6 ms to minimize.
[2025-06-02 05:33:12] [INFO ] Deduced a trap composed of 13 places in 389 ms of which 5 ms to minimize.
[2025-06-02 05:33:13] [INFO ] Deduced a trap composed of 28 places in 409 ms of which 5 ms to minimize.
[2025-06-02 05:33:13] [INFO ] Deduced a trap composed of 28 places in 398 ms of which 6 ms to minimize.
[2025-06-02 05:33:13] [INFO ] Deduced a trap composed of 15 places in 398 ms of which 6 ms to minimize.
[2025-06-02 05:33:14] [INFO ] Deduced a trap composed of 39 places in 380 ms of which 5 ms to minimize.
[2025-06-02 05:33:14] [INFO ] Deduced a trap composed of 64 places in 405 ms of which 6 ms to minimize.
[2025-06-02 05:33:15] [INFO ] Deduced a trap composed of 21 places in 394 ms of which 6 ms to minimize.
[2025-06-02 05:33:15] [INFO ] Deduced a trap composed of 46 places in 442 ms of which 6 ms to minimize.
[2025-06-02 05:33:16] [INFO ] Deduced a trap composed of 97 places in 454 ms of which 6 ms to minimize.
[2025-06-02 05:33:16] [INFO ] Deduced a trap composed of 135 places in 467 ms of which 6 ms to minimize.
[2025-06-02 05:33:17] [INFO ] Deduced a trap composed of 75 places in 458 ms of which 6 ms to minimize.
[2025-06-02 05:33:17] [INFO ] Deduced a trap composed of 51 places in 469 ms of which 6 ms to minimize.
[2025-06-02 05:33:17] [INFO ] Deduced a trap composed of 117 places in 461 ms of which 5 ms to minimize.
[2025-06-02 05:33:18] [INFO ] Deduced a trap composed of 56 places in 479 ms of which 6 ms to minimize.
[2025-06-02 05:33:18] [INFO ] Deduced a trap composed of 56 places in 471 ms of which 6 ms to minimize.
[2025-06-02 05:33:19] [INFO ] Deduced a trap composed of 38 places in 465 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1088 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 2192 unsolved
[2025-06-02 05:33:20] [INFO ] Deduced a trap composed of 77 places in 483 ms of which 6 ms to minimize.
[2025-06-02 05:33:20] [INFO ] Deduced a trap composed of 111 places in 447 ms of which 6 ms to minimize.
[2025-06-02 05:33:21] [INFO ] Deduced a trap composed of 89 places in 444 ms of which 6 ms to minimize.
[2025-06-02 05:33:21] [INFO ] Deduced a trap composed of 80 places in 465 ms of which 6 ms to minimize.
[2025-06-02 05:33:22] [INFO ] Deduced a trap composed of 86 places in 460 ms of which 6 ms to minimize.
SMT process timed out in 60975ms, After SMT, problems are : Problem set: 0 solved, 2192 unsolved
Search for dead transitions found 0 dead transitions in 60994ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66364 ms. Remains : 1088/1088 places, 2200/2200 transitions.
[2025-06-02 05:33:22] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2025-06-02 05:33:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[8]
RANDOM walk for 1000000 steps (2 resets) in 7889 ms. (126 steps per ms)
BEST_FIRST walk for 868763 steps (2 resets) in 5001 ms. (173 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[8]
[2025-06-02 05:33:35] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2025-06-02 05:33:35] [INFO ] Invariant cache hit.
[2025-06-02 05:33:35] [INFO ] [Real]Absence check using 23 positive place invariants in 16 ms returned sat
[2025-06-02 05:33:35] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2025-06-02 05:33:35] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 05:33:36] [INFO ] [Real]Added 497 Read/Feed constraints in 114 ms returned sat
[2025-06-02 05:33:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:33:36] [INFO ] [Nat]Absence check using 23 positive place invariants in 16 ms returned sat
[2025-06-02 05:33:36] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2025-06-02 05:33:36] [INFO ] [Nat]Added 497 Read/Feed constraints in 174 ms returned sat
[2025-06-02 05:33:37] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 113 ms.
[2025-06-02 05:33:41] [INFO ] Deduced a trap composed of 53 places in 382 ms of which 5 ms to minimize.
[2025-06-02 05:33:41] [INFO ] Deduced a trap composed of 88 places in 378 ms of which 6 ms to minimize.
[2025-06-02 05:33:42] [INFO ] Deduced a trap composed of 56 places in 397 ms of which 6 ms to minimize.
[2025-06-02 05:33:42] [INFO ] Deduced a trap composed of 72 places in 459 ms of which 6 ms to minimize.
[2025-06-02 05:33:43] [INFO ] Deduced a trap composed of 15 places in 453 ms of which 6 ms to minimize.
[2025-06-02 05:33:43] [INFO ] Deduced a trap composed of 28 places in 430 ms of which 6 ms to minimize.
[2025-06-02 05:33:44] [INFO ] Deduced a trap composed of 24 places in 446 ms of which 6 ms to minimize.
[2025-06-02 05:33:44] [INFO ] Deduced a trap composed of 11 places in 436 ms of which 6 ms to minimize.
[2025-06-02 05:33:45] [INFO ] Deduced a trap composed of 55 places in 341 ms of which 5 ms to minimize.
[2025-06-02 05:33:45] [INFO ] Deduced a trap composed of 49 places in 351 ms of which 5 ms to minimize.
[2025-06-02 05:33:46] [INFO ] Deduced a trap composed of 58 places in 358 ms of which 5 ms to minimize.
[2025-06-02 05:33:46] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5705 ms
[2025-06-02 05:33:46] [INFO ] Added : 206 causal constraints over 42 iterations in 9974 ms. Result :sat
Minimization took 602 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[8]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 31 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 24 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2025-06-02 05:33:48] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2025-06-02 05:33:48] [INFO ] Invariant cache hit.
[2025-06-02 05:33:48] [INFO ] Implicit Places using invariants in 401 ms returned []
[2025-06-02 05:33:48] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2025-06-02 05:33:48] [INFO ] Invariant cache hit.
[2025-06-02 05:33:49] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-02 05:33:53] [INFO ] Implicit Places using invariants and state equation in 4757 ms returned []
Implicit Place search using SMT with State Equation took 5159 ms to find 0 implicit places.
[2025-06-02 05:33:53] [INFO ] Redundant transitions in 38 ms returned []
Running 2192 sub problems to find dead transitions.
[2025-06-02 05:33:53] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2025-06-02 05:33:53] [INFO ] Invariant cache hit.
[2025-06-02 05:33:53] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1088 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/2952 variables, and 23 constraints, problems are : Problem set: 0 solved, 2192 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/1088 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 2192/2192 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1088 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2192 unsolved
[2025-06-02 05:34:25] [INFO ] Deduced a trap composed of 17 places in 409 ms of which 8 ms to minimize.
[2025-06-02 05:34:26] [INFO ] Deduced a trap composed of 19 places in 387 ms of which 6 ms to minimize.
[2025-06-02 05:34:26] [INFO ] Deduced a trap composed of 97 places in 393 ms of which 6 ms to minimize.
[2025-06-02 05:34:26] [INFO ] Deduced a trap composed of 28 places in 412 ms of which 6 ms to minimize.
[2025-06-02 05:34:27] [INFO ] Deduced a trap composed of 24 places in 402 ms of which 5 ms to minimize.
[2025-06-02 05:34:27] [INFO ] Deduced a trap composed of 137 places in 420 ms of which 6 ms to minimize.
[2025-06-02 05:34:28] [INFO ] Deduced a trap composed of 60 places in 404 ms of which 6 ms to minimize.
[2025-06-02 05:34:28] [INFO ] Deduced a trap composed of 75 places in 383 ms of which 5 ms to minimize.
[2025-06-02 05:34:28] [INFO ] Deduced a trap composed of 75 places in 380 ms of which 6 ms to minimize.
[2025-06-02 05:34:29] [INFO ] Deduced a trap composed of 114 places in 383 ms of which 5 ms to minimize.
[2025-06-02 05:34:29] [INFO ] Deduced a trap composed of 28 places in 385 ms of which 6 ms to minimize.
[2025-06-02 05:34:30] [INFO ] Deduced a trap composed of 79 places in 376 ms of which 6 ms to minimize.
[2025-06-02 05:34:30] [INFO ] Deduced a trap composed of 122 places in 347 ms of which 5 ms to minimize.
[2025-06-02 05:34:30] [INFO ] Deduced a trap composed of 65 places in 311 ms of which 5 ms to minimize.
[2025-06-02 05:34:31] [INFO ] Deduced a trap composed of 39 places in 318 ms of which 5 ms to minimize.
[2025-06-02 05:34:31] [INFO ] Deduced a trap composed of 33 places in 322 ms of which 5 ms to minimize.
[2025-06-02 05:34:31] [INFO ] Deduced a trap composed of 44 places in 337 ms of which 5 ms to minimize.
[2025-06-02 05:34:32] [INFO ] Deduced a trap composed of 44 places in 325 ms of which 4 ms to minimize.
[2025-06-02 05:34:32] [INFO ] Deduced a trap composed of 31 places in 427 ms of which 5 ms to minimize.
[2025-06-02 05:34:33] [INFO ] Deduced a trap composed of 17 places in 402 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1088 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 2192 unsolved
[2025-06-02 05:34:33] [INFO ] Deduced a trap composed of 28 places in 380 ms of which 6 ms to minimize.
[2025-06-02 05:34:34] [INFO ] Deduced a trap composed of 28 places in 407 ms of which 5 ms to minimize.
[2025-06-02 05:34:34] [INFO ] Deduced a trap composed of 23 places in 375 ms of which 5 ms to minimize.
[2025-06-02 05:34:35] [INFO ] Deduced a trap composed of 43 places in 389 ms of which 6 ms to minimize.
[2025-06-02 05:34:35] [INFO ] Deduced a trap composed of 47 places in 406 ms of which 6 ms to minimize.
[2025-06-02 05:34:36] [INFO ] Deduced a trap composed of 25 places in 408 ms of which 6 ms to minimize.
[2025-06-02 05:34:36] [INFO ] Deduced a trap composed of 78 places in 431 ms of which 6 ms to minimize.
[2025-06-02 05:34:36] [INFO ] Deduced a trap composed of 49 places in 415 ms of which 6 ms to minimize.
[2025-06-02 05:34:37] [INFO ] Deduced a trap composed of 28 places in 420 ms of which 6 ms to minimize.
[2025-06-02 05:34:37] [INFO ] Deduced a trap composed of 46 places in 416 ms of which 6 ms to minimize.
[2025-06-02 05:34:38] [INFO ] Deduced a trap composed of 47 places in 406 ms of which 6 ms to minimize.
[2025-06-02 05:34:38] [INFO ] Deduced a trap composed of 39 places in 424 ms of which 6 ms to minimize.
[2025-06-02 05:34:39] [INFO ] Deduced a trap composed of 29 places in 402 ms of which 5 ms to minimize.
[2025-06-02 05:34:39] [INFO ] Deduced a trap composed of 28 places in 399 ms of which 5 ms to minimize.
[2025-06-02 05:34:39] [INFO ] Deduced a trap composed of 68 places in 403 ms of which 5 ms to minimize.
[2025-06-02 05:34:40] [INFO ] Deduced a trap composed of 53 places in 401 ms of which 5 ms to minimize.
[2025-06-02 05:34:40] [INFO ] Deduced a trap composed of 28 places in 412 ms of which 5 ms to minimize.
[2025-06-02 05:34:41] [INFO ] Deduced a trap composed of 42 places in 403 ms of which 5 ms to minimize.
[2025-06-02 05:34:41] [INFO ] Deduced a trap composed of 123 places in 380 ms of which 5 ms to minimize.
[2025-06-02 05:34:41] [INFO ] Deduced a trap composed of 53 places in 389 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1088 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 2192 unsolved
[2025-06-02 05:34:42] [INFO ] Deduced a trap composed of 54 places in 374 ms of which 5 ms to minimize.
[2025-06-02 05:34:43] [INFO ] Deduced a trap composed of 48 places in 371 ms of which 6 ms to minimize.
[2025-06-02 05:34:43] [INFO ] Deduced a trap composed of 62 places in 401 ms of which 5 ms to minimize.
[2025-06-02 05:34:44] [INFO ] Deduced a trap composed of 28 places in 402 ms of which 6 ms to minimize.
[2025-06-02 05:34:44] [INFO ] Deduced a trap composed of 13 places in 386 ms of which 6 ms to minimize.
[2025-06-02 05:34:44] [INFO ] Deduced a trap composed of 28 places in 381 ms of which 6 ms to minimize.
[2025-06-02 05:34:45] [INFO ] Deduced a trap composed of 28 places in 381 ms of which 5 ms to minimize.
[2025-06-02 05:34:45] [INFO ] Deduced a trap composed of 15 places in 375 ms of which 5 ms to minimize.
[2025-06-02 05:34:46] [INFO ] Deduced a trap composed of 39 places in 388 ms of which 5 ms to minimize.
[2025-06-02 05:34:46] [INFO ] Deduced a trap composed of 64 places in 407 ms of which 5 ms to minimize.
[2025-06-02 05:34:46] [INFO ] Deduced a trap composed of 21 places in 400 ms of which 6 ms to minimize.
[2025-06-02 05:34:47] [INFO ] Deduced a trap composed of 46 places in 451 ms of which 5 ms to minimize.
[2025-06-02 05:34:47] [INFO ] Deduced a trap composed of 97 places in 436 ms of which 6 ms to minimize.
[2025-06-02 05:34:48] [INFO ] Deduced a trap composed of 135 places in 445 ms of which 6 ms to minimize.
[2025-06-02 05:34:48] [INFO ] Deduced a trap composed of 75 places in 431 ms of which 7 ms to minimize.
[2025-06-02 05:34:49] [INFO ] Deduced a trap composed of 51 places in 452 ms of which 6 ms to minimize.
[2025-06-02 05:34:49] [INFO ] Deduced a trap composed of 117 places in 423 ms of which 6 ms to minimize.
[2025-06-02 05:34:50] [INFO ] Deduced a trap composed of 56 places in 415 ms of which 6 ms to minimize.
[2025-06-02 05:34:50] [INFO ] Deduced a trap composed of 56 places in 442 ms of which 6 ms to minimize.
[2025-06-02 05:34:51] [INFO ] Deduced a trap composed of 38 places in 444 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1088 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 2192 unsolved
[2025-06-02 05:34:52] [INFO ] Deduced a trap composed of 77 places in 429 ms of which 7 ms to minimize.
[2025-06-02 05:34:52] [INFO ] Deduced a trap composed of 111 places in 441 ms of which 6 ms to minimize.
[2025-06-02 05:34:52] [INFO ] Deduced a trap composed of 89 places in 442 ms of which 6 ms to minimize.
[2025-06-02 05:34:53] [INFO ] Deduced a trap composed of 80 places in 435 ms of which 6 ms to minimize.
[2025-06-02 05:34:53] [INFO ] Deduced a trap composed of 86 places in 448 ms of which 6 ms to minimize.
[2025-06-02 05:34:54] [INFO ] Deduced a trap composed of 133 places in 481 ms of which 6 ms to minimize.
SMT process timed out in 61097ms, After SMT, problems are : Problem set: 0 solved, 2192 unsolved
Search for dead transitions found 0 dead transitions in 61119ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66359 ms. Remains : 1088/1088 places, 2200/2200 transitions.
[2025-06-02 05:34:54] [INFO ] Flatten gal took : 100 ms
[2025-06-02 05:34:54] [INFO ] Flatten gal took : 183 ms
[2025-06-02 05:34:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16658371392676886685.gal : 66 ms
[2025-06-02 05:34:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1671030063037618772.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/ReachabilityCardinality16658371392676886685.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1671030063037618772.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (8 resets) in 2199 ms. (18 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality1671030063037618772.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 995 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 787 ms. (50 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 24
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :24 after 30
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30 after 48
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :48 after 66
Interrupted probabilistic random walk after 127017 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 2
Probabilistic random walk after 127017 steps, saw 57375 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
[2025-06-02 05:34:58] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
SDD proceeding with computation,2 properties remain. new max is 512
[2025-06-02 05:34:58] [INFO ] Invariant cache hit.
SDD size :66 after 303
[2025-06-02 05:34:58] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 576/1024 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :303 after 746
[2025-06-02 05:35:00] [INFO ] Deduced a trap composed of 60 places in 810 ms of which 12 ms to minimize.
[2025-06-02 05:35:00] [INFO ] Deduced a trap composed of 88 places in 690 ms of which 10 ms to minimize.
[2025-06-02 05:35:01] [INFO ] Deduced a trap composed of 239 places in 689 ms of which 12 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :746 after 2956
[2025-06-02 05:35:02] [INFO ] Deduced a trap composed of 144 places in 585 ms of which 10 ms to minimize.
[2025-06-02 05:35:02] [INFO ] Deduced a trap composed of 221 places in 462 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 8/1032 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1032 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2896/2952 variables, and 1053 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5005 ms.
Refiners :[Positive P Invariants (semi-flows): 16/23 constraints, State Equation: 1032/1088 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 576/1024 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:35:05] [INFO ] Deduced a trap composed of 200 places in 632 ms of which 11 ms to minimize.
[2025-06-02 05:35:05] [INFO ] Deduced a trap composed of 214 places in 609 ms of which 9 ms to minimize.
[2025-06-02 05:35:06] [INFO ] Deduced a trap composed of 130 places in 542 ms of which 9 ms to minimize.
[2025-06-02 05:35:06] [INFO ] Deduced a trap composed of 102 places in 538 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1024 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/1032 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1032 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2956 after 8799
At refinement iteration 7 (OVERLAPS) 1864/2896 variables, 1032/1057 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2896 variables, 497/1554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2896/2952 variables, and 1556 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/23 constraints, State Equation: 1032/1088 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 10438ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 33 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 1088/1088 places, 2200/2200 transitions.
RANDOM walk for 40000 steps (8 resets) in 2659 ms. (15 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 855 ms. (46 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 874 ms. (45 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 119997 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 2
Probabilistic random walk after 119997 steps, saw 55553 distinct states, run finished after 3015 ms. (steps per millisecond=39 ) properties seen :0
[2025-06-02 05:35:13] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2025-06-02 05:35:13] [INFO ] Invariant cache hit.
[2025-06-02 05:35:13] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 576/1024 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:35:14] [INFO ] Deduced a trap composed of 60 places in 784 ms of which 12 ms to minimize.
[2025-06-02 05:35:15] [INFO ] Deduced a trap composed of 88 places in 687 ms of which 14 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :8799 after 16280
[2025-06-02 05:35:16] [INFO ] Deduced a trap composed of 239 places in 619 ms of which 12 ms to minimize.
[2025-06-02 05:35:16] [INFO ] Deduced a trap composed of 144 places in 637 ms of which 10 ms to minimize.
[2025-06-02 05:35:17] [INFO ] Deduced a trap composed of 221 places in 442 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 8/1032 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1032 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1864/2896 variables, 1032/1053 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2896 variables, 497/1550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2896 variables, 0/1550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 56/2952 variables, 56/1606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2952 variables, 7/1613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2952 variables, 0/1613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2952 variables, 0/1613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2952/2952 variables, and 1613 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6012 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 1088/1088 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 576/1024 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:35:20] [INFO ] Deduced a trap composed of 200 places in 583 ms of which 14 ms to minimize.
[2025-06-02 05:35:21] [INFO ] Deduced a trap composed of 214 places in 562 ms of which 8 ms to minimize.
[2025-06-02 05:35:21] [INFO ] Deduced a trap composed of 130 places in 591 ms of which 10 ms to minimize.
[2025-06-02 05:35:22] [INFO ] Deduced a trap composed of 102 places in 573 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1024 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/1032 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1032 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1864/2896 variables, 1032/1057 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2896 variables, 497/1554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :16280 after 36471
At refinement iteration 9 (INCLUDED_ONLY) 0/2896 variables, 2/1556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2896 variables, 0/1556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 56/2952 variables, 56/1612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2952 variables, 7/1619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:35:29] [INFO ] Deduced a trap composed of 13 places in 875 ms of which 14 ms to minimize.
[2025-06-02 05:35:30] [INFO ] Deduced a trap composed of 13 places in 884 ms of which 12 ms to minimize.
[2025-06-02 05:35:31] [INFO ] Deduced a trap composed of 33 places in 885 ms of which 13 ms to minimize.
[2025-06-02 05:35:32] [INFO ] Deduced a trap composed of 15 places in 865 ms of which 13 ms to minimize.
[2025-06-02 05:35:33] [INFO ] Deduced a trap composed of 61 places in 769 ms of which 11 ms to minimize.
[2025-06-02 05:35:34] [INFO ] Deduced a trap composed of 58 places in 795 ms of which 13 ms to minimize.
[2025-06-02 05:35:35] [INFO ] Deduced a trap composed of 137 places in 816 ms of which 11 ms to minimize.
[2025-06-02 05:35:36] [INFO ] Deduced a trap composed of 129 places in 739 ms of which 11 ms to minimize.
[2025-06-02 05:35:37] [INFO ] Deduced a trap composed of 77 places in 759 ms of which 10 ms to minimize.
[2025-06-02 05:35:38] [INFO ] Deduced a trap composed of 79 places in 760 ms of which 12 ms to minimize.
[2025-06-02 05:35:39] [INFO ] Deduced a trap composed of 80 places in 824 ms of which 13 ms to minimize.
[2025-06-02 05:35:40] [INFO ] Deduced a trap composed of 99 places in 765 ms of which 13 ms to minimize.
[2025-06-02 05:35:41] [INFO ] Deduced a trap composed of 75 places in 759 ms of which 10 ms to minimize.
[2025-06-02 05:35:42] [INFO ] Deduced a trap composed of 70 places in 756 ms of which 11 ms to minimize.
[2025-06-02 05:35:43] [INFO ] Deduced a trap composed of 53 places in 757 ms of which 10 ms to minimize.
[2025-06-02 05:35:44] [INFO ] Deduced a trap composed of 80 places in 750 ms of which 12 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 05:35:45] [INFO ] Flatten gal took : 62 ms
[2025-06-02 05:35:45] [INFO ] Applying decomposition
[2025-06-02 05:35:45] [INFO ] Flatten gal took : 74 ms
[2025-06-02 05:35:45] [INFO ] Deduced a trap composed of 175 places in 1139 ms of which 5 ms to minimize.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11566504057941021105.txt' '-o' '/tmp/graph11566504057941021105.bin' '-w' '/tmp/graph11566504057941021105.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11566504057941021105.bin' '-l' '-1' '-v' '-w' '/tmp/graph11566504057941021105.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:35:46] [INFO ] Decomposing Gal with order
[2025-06-02 05:35:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:35:46] [INFO ] Removed a total of 2492 redundant transitions.
[2025-06-02 05:35:46] [INFO ] Flatten gal took : 828 ms
[2025-06-02 05:35:47] [INFO ] Deduced a trap composed of 67 places in 1112 ms of which 6 ms to minimize.
[2025-06-02 05:35:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 346 labels/synchronizations in 97 ms.
[2025-06-02 05:35:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15751044539315464093.gal : 60 ms
[2025-06-02 05:35:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13464001171037960840.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/ReachabilityCardinality15751044539315464093.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13464001171037960840.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13464001171037960840.prop.
[2025-06-02 05:35:48] [INFO ] Deduced a trap composed of 62 places in 671 ms of which 11 ms to minimize.
[2025-06-02 05:35:49] [INFO ] Deduced a trap composed of 40 places in 776 ms of which 13 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 6
At refinement iteration 13 (INCLUDED_ONLY) 0/2952 variables, 20/1639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 30
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :30 after 41
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :41 after 60
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :60 after 63
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :63 after 70
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :70 after 114
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :114 after 142
[2025-06-02 05:35:51] [INFO ] Deduced a trap composed of 216 places in 778 ms of which 12 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :142 after 1485
[2025-06-02 05:35:52] [INFO ] Deduced a trap composed of 34 places in 782 ms of which 11 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1485 after 3026
[2025-06-02 05:35:53] [INFO ] Deduced a trap composed of 61 places in 826 ms of which 12 ms to minimize.
[2025-06-02 05:35:54] [INFO ] Deduced a trap composed of 154 places in 776 ms of which 11 ms to minimize.
[2025-06-02 05:35:55] [INFO ] Deduced a trap composed of 53 places in 735 ms of which 11 ms to minimize.
[2025-06-02 05:35:56] [INFO ] Deduced a trap composed of 41 places in 776 ms of which 11 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3026 after 5151
[2025-06-02 05:35:57] [INFO ] Deduced a trap composed of 33 places in 772 ms of which 11 ms to minimize.
[2025-06-02 05:35:58] [INFO ] Deduced a trap composed of 69 places in 700 ms of which 11 ms to minimize.
[2025-06-02 05:35:59] [INFO ] Deduced a trap composed of 51 places in 718 ms of which 11 ms to minimize.
[2025-06-02 05:36:00] [INFO ] Deduced a trap composed of 71 places in 727 ms of which 16 ms to minimize.
[2025-06-02 05:36:01] [INFO ] Deduced a trap composed of 53 places in 792 ms of which 12 ms to minimize.
[2025-06-02 05:36:02] [INFO ] Deduced a trap composed of 57 places in 810 ms of which 13 ms to minimize.
[2025-06-02 05:36:03] [INFO ] Deduced a trap composed of 15 places in 805 ms of which 11 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :5151 after 61609
[2025-06-02 05:36:04] [INFO ] Deduced a trap composed of 82 places in 789 ms of which 11 ms to minimize.
[2025-06-02 05:36:05] [INFO ] Deduced a trap composed of 116 places in 841 ms of which 12 ms to minimize.
SMT process timed out in 52057ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 532 ms.
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 38 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 37 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2025-06-02 05:36:06] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2025-06-02 05:36:06] [INFO ] Invariant cache hit.
[2025-06-02 05:36:06] [INFO ] Implicit Places using invariants in 756 ms returned []
[2025-06-02 05:36:06] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2025-06-02 05:36:06] [INFO ] Invariant cache hit.
[2025-06-02 05:36:12] [INFO ] State equation strengthened by 497 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :61609 after 147255
[2025-06-02 05:36:27] [INFO ] Implicit Places using invariants and state equation in 20324 ms returned []
Implicit Place search using SMT with State Equation took 21096 ms to find 0 implicit places.
[2025-06-02 05:36:27] [INFO ] Redundant transitions in 41 ms returned []
Running 2192 sub problems to find dead transitions.
[2025-06-02 05:36:27] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2025-06-02 05:36:27] [INFO ] Invariant cache hit.
[2025-06-02 05:36:27] [INFO ] State equation strengthened by 497 read => feed constraints.
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/1088 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/2952 variables, and 23 constraints, problems are : Problem set: 0 solved, 2192 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/1088 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 2192/2192 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1088 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2192 unsolved
[2025-06-02 05:36:59] [INFO ] Deduced a trap composed of 17 places in 423 ms of which 6 ms to minimize.
[2025-06-02 05:37:00] [INFO ] Deduced a trap composed of 19 places in 410 ms of which 6 ms to minimize.
[2025-06-02 05:37:00] [INFO ] Deduced a trap composed of 97 places in 415 ms of which 6 ms to minimize.
[2025-06-02 05:37:01] [INFO ] Deduced a trap composed of 28 places in 436 ms of which 5 ms to minimize.
[2025-06-02 05:37:01] [INFO ] Deduced a trap composed of 24 places in 423 ms of which 6 ms to minimize.
[2025-06-02 05:37:02] [INFO ] Deduced a trap composed of 137 places in 429 ms of which 6 ms to minimize.
[2025-06-02 05:37:02] [INFO ] Deduced a trap composed of 60 places in 428 ms of which 6 ms to minimize.
[2025-06-02 05:37:02] [INFO ] Deduced a trap composed of 75 places in 402 ms of which 6 ms to minimize.
[2025-06-02 05:37:03] [INFO ] Deduced a trap composed of 75 places in 403 ms of which 6 ms to minimize.
[2025-06-02 05:37:03] [INFO ] Deduced a trap composed of 114 places in 423 ms of which 6 ms to minimize.
[2025-06-02 05:37:04] [INFO ] Deduced a trap composed of 28 places in 421 ms of which 6 ms to minimize.
[2025-06-02 05:37:04] [INFO ] Deduced a trap composed of 79 places in 362 ms of which 5 ms to minimize.
[2025-06-02 05:37:04] [INFO ] Deduced a trap composed of 122 places in 353 ms of which 5 ms to minimize.
[2025-06-02 05:37:05] [INFO ] Deduced a trap composed of 65 places in 329 ms of which 5 ms to minimize.
[2025-06-02 05:37:05] [INFO ] Deduced a trap composed of 39 places in 305 ms of which 5 ms to minimize.
[2025-06-02 05:37:06] [INFO ] Deduced a trap composed of 33 places in 333 ms of which 4 ms to minimize.
[2025-06-02 05:37:06] [INFO ] Deduced a trap composed of 44 places in 348 ms of which 6 ms to minimize.
[2025-06-02 05:37:06] [INFO ] Deduced a trap composed of 44 places in 331 ms of which 5 ms to minimize.
[2025-06-02 05:37:07] [INFO ] Deduced a trap composed of 31 places in 417 ms of which 5 ms to minimize.
[2025-06-02 05:37:07] [INFO ] Deduced a trap composed of 17 places in 428 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1088 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 2192 unsolved
[2025-06-02 05:37:08] [INFO ] Deduced a trap composed of 28 places in 401 ms of which 6 ms to minimize.
[2025-06-02 05:37:08] [INFO ] Deduced a trap composed of 28 places in 408 ms of which 6 ms to minimize.
[2025-06-02 05:37:09] [INFO ] Deduced a trap composed of 23 places in 364 ms of which 5 ms to minimize.
[2025-06-02 05:37:09] [INFO ] Deduced a trap composed of 43 places in 397 ms of which 6 ms to minimize.
[2025-06-02 05:37:10] [INFO ] Deduced a trap composed of 47 places in 391 ms of which 6 ms to minimize.
[2025-06-02 05:37:10] [INFO ] Deduced a trap composed of 25 places in 396 ms of which 5 ms to minimize.
[2025-06-02 05:37:10] [INFO ] Deduced a trap composed of 78 places in 407 ms of which 5 ms to minimize.
[2025-06-02 05:37:11] [INFO ] Deduced a trap composed of 49 places in 410 ms of which 6 ms to minimize.
[2025-06-02 05:37:11] [INFO ] Deduced a trap composed of 28 places in 402 ms of which 6 ms to minimize.
[2025-06-02 05:37:12] [INFO ] Deduced a trap composed of 46 places in 401 ms of which 5 ms to minimize.
[2025-06-02 05:37:12] [INFO ] Deduced a trap composed of 47 places in 382 ms of which 6 ms to minimize.
[2025-06-02 05:37:12] [INFO ] Deduced a trap composed of 39 places in 402 ms of which 6 ms to minimize.
[2025-06-02 05:37:13] [INFO ] Deduced a trap composed of 29 places in 398 ms of which 5 ms to minimize.
[2025-06-02 05:37:13] [INFO ] Deduced a trap composed of 28 places in 393 ms of which 6 ms to minimize.
[2025-06-02 05:37:14] [INFO ] Deduced a trap composed of 68 places in 394 ms of which 6 ms to minimize.
[2025-06-02 05:37:14] [INFO ] Deduced a trap composed of 53 places in 383 ms of which 6 ms to minimize.
[2025-06-02 05:37:15] [INFO ] Deduced a trap composed of 28 places in 383 ms of which 6 ms to minimize.
[2025-06-02 05:37:15] [INFO ] Deduced a trap composed of 42 places in 392 ms of which 6 ms to minimize.
[2025-06-02 05:37:15] [INFO ] Deduced a trap composed of 123 places in 428 ms of which 5 ms to minimize.
[2025-06-02 05:37:16] [INFO ] Deduced a trap composed of 53 places in 398 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1088 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 2192 unsolved
[2025-06-02 05:37:17] [INFO ] Deduced a trap composed of 54 places in 401 ms of which 5 ms to minimize.
[2025-06-02 05:37:17] [INFO ] Deduced a trap composed of 48 places in 401 ms of which 6 ms to minimize.
[2025-06-02 05:37:18] [INFO ] Deduced a trap composed of 62 places in 404 ms of which 6 ms to minimize.
[2025-06-02 05:37:18] [INFO ] Deduced a trap composed of 28 places in 400 ms of which 5 ms to minimize.
[2025-06-02 05:37:18] [INFO ] Deduced a trap composed of 13 places in 397 ms of which 6 ms to minimize.
[2025-06-02 05:37:19] [INFO ] Deduced a trap composed of 28 places in 411 ms of which 5 ms to minimize.
[2025-06-02 05:37:19] [INFO ] Deduced a trap composed of 28 places in 407 ms of which 5 ms to minimize.
[2025-06-02 05:37:20] [INFO ] Deduced a trap composed of 15 places in 409 ms of which 5 ms to minimize.
[2025-06-02 05:37:20] [INFO ] Deduced a trap composed of 39 places in 402 ms of which 5 ms to minimize.
[2025-06-02 05:37:21] [INFO ] Deduced a trap composed of 64 places in 406 ms of which 6 ms to minimize.
[2025-06-02 05:37:21] [INFO ] Deduced a trap composed of 21 places in 415 ms of which 6 ms to minimize.
[2025-06-02 05:37:21] [INFO ] Deduced a trap composed of 46 places in 420 ms of which 6 ms to minimize.
[2025-06-02 05:37:22] [INFO ] Deduced a trap composed of 97 places in 427 ms of which 6 ms to minimize.
[2025-06-02 05:37:22] [INFO ] Deduced a trap composed of 135 places in 433 ms of which 6 ms to minimize.
[2025-06-02 05:37:23] [INFO ] Deduced a trap composed of 75 places in 431 ms of which 5 ms to minimize.
[2025-06-02 05:37:23] [INFO ] Deduced a trap composed of 51 places in 436 ms of which 6 ms to minimize.
[2025-06-02 05:37:24] [INFO ] Deduced a trap composed of 117 places in 443 ms of which 6 ms to minimize.
[2025-06-02 05:37:24] [INFO ] Deduced a trap composed of 56 places in 466 ms of which 6 ms to minimize.
[2025-06-02 05:37:25] [INFO ] Deduced a trap composed of 56 places in 465 ms of which 6 ms to minimize.
[2025-06-02 05:37:25] [INFO ] Deduced a trap composed of 38 places in 460 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1088 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 2192 unsolved
[2025-06-02 05:37:26] [INFO ] Deduced a trap composed of 77 places in 448 ms of which 6 ms to minimize.
[2025-06-02 05:37:27] [INFO ] Deduced a trap composed of 111 places in 434 ms of which 6 ms to minimize.
[2025-06-02 05:37:27] [INFO ] Deduced a trap composed of 89 places in 436 ms of which 6 ms to minimize.
[2025-06-02 05:37:28] [INFO ] Deduced a trap composed of 80 places in 431 ms of which 6 ms to minimize.
[2025-06-02 05:37:28] [INFO ] Deduced a trap composed of 86 places in 462 ms of which 6 ms to minimize.
SMT process timed out in 61331ms, After SMT, problems are : Problem set: 0 solved, 2192 unsolved
Search for dead transitions found 0 dead transitions in 61350ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82549 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[7] Max Struct:[8]
Ending property specific reduction for Peterson-COL-7-UpperBounds-10 in 340533 ms.
[2025-06-02 05:37:28] [INFO ] Flatten gal took : 44 ms
[2025-06-02 05:37:28] [INFO ] Applying decomposition
[2025-06-02 05:37:28] [INFO ] Flatten gal took : 45 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/graph5186515923142241622.txt' '-o' '/tmp/graph5186515923142241622.bin' '-w' '/tmp/graph5186515923142241622.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5186515923142241622.bin' '-l' '-1' '-v' '-w' '/tmp/graph5186515923142241622.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:37:28] [INFO ] Decomposing Gal with order
[2025-06-02 05:37:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:37:28] [INFO ] Removed a total of 3174 redundant transitions.
[2025-06-02 05:37:28] [INFO ] Flatten gal took : 101 ms
[2025-06-02 05:37:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 28 ms.
[2025-06-02 05:37:29] [INFO ] Time to serialize gal into /tmp/UpperBounds3543769599200607906.gal : 11 ms
[2025-06-02 05:37:29] [INFO ] Time to serialize properties into /tmp/UpperBounds14918598637664956846.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/UpperBounds3543769599200607906.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14918598637664956846.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 ...305
Loading property file /tmp/UpperBounds14918598637664956846.prop.
ITS-tools command line returned an error code 137
[2025-06-02 05:45:40] [INFO ] Applying decomposition
[2025-06-02 05:45:40] [INFO ] Flatten gal took : 54 ms
[2025-06-02 05:45:40] [INFO ] Decomposing Gal with order
[2025-06-02 05:45:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:45:40] [INFO ] Removed a total of 3336 redundant transitions.
[2025-06-02 05:45:40] [INFO ] Flatten gal took : 87 ms
[2025-06-02 05:45:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2025-06-02 05:45:40] [INFO ] Time to serialize gal into /tmp/UpperBounds6389129930504095355.gal : 12 ms
[2025-06-02 05:45:40] [INFO ] Time to serialize properties into /tmp/UpperBounds5197098789709834555.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/UpperBounds6389129930504095355.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5197098789709834555.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds5197098789709834555.prop.
ITS-tools command line returned an error code 137
[2025-06-02 05:54:00] [INFO ] Flatten gal took : 55 ms
[2025-06-02 05:54:00] [INFO ] Input system was already deterministic with 2208 transitions.
[2025-06-02 05:54:00] [INFO ] Transformed 1096 places.
[2025-06-02 05:54:00] [INFO ] Transformed 2208 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-02 05:54:00] [INFO ] Time to serialize gal into /tmp/UpperBounds8967134101188776215.gal : 15 ms
[2025-06-02 05:54:00] [INFO ] Time to serialize properties into /tmp/UpperBounds609895170102805472.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/UpperBounds8967134101188776215.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds609895170102805472.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

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

BK_STOP 1748844151903

--------------------
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="Peterson-COL-7"
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 Peterson-COL-7, 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 r153-tall-174876824800074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-7.tgz
mv Peterson-COL-7 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 ;