Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r207-tall-177969919800090.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is Peterson-PT-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r207-tall-177969919800090
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 83K Mar 8 07:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 377K Mar 8 07:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 43K Mar 8 07:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 197K Mar 8 07:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 49K Mar 16 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 157K Mar 16 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Mar 16 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 93K Mar 16 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 237K Mar 8 07:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Mar 8 07:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 86K Mar 8 07:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 398K Mar 8 07:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.6K Mar 16 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Mar 16 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 298K Mar 3 18:30 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-PT-4-UpperBounds-00
FORMULA_NAME Peterson-PT-4-UpperBounds-01
FORMULA_NAME Peterson-PT-4-UpperBounds-02
FORMULA_NAME Peterson-PT-4-UpperBounds-03
FORMULA_NAME Peterson-PT-4-UpperBounds-04
FORMULA_NAME Peterson-PT-4-UpperBounds-05
FORMULA_NAME Peterson-PT-4-UpperBounds-06
FORMULA_NAME Peterson-PT-4-UpperBounds-07
FORMULA_NAME Peterson-PT-4-UpperBounds-08
FORMULA_NAME Peterson-PT-4-UpperBounds-09
FORMULA_NAME Peterson-PT-4-UpperBounds-10
FORMULA_NAME Peterson-PT-4-UpperBounds-11
FORMULA_NAME Peterson-PT-4-UpperBounds-12
FORMULA_NAME Peterson-PT-4-UpperBounds-13
FORMULA_NAME Peterson-PT-4-UpperBounds-14
FORMULA_NAME Peterson-PT-4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779720281251

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-25 14:44:42] [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]
[2026-05-25 14:44:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 14:44:42] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2026-05-25 14:44:42] [INFO ] Transformed 480 places.
[2026-05-25 14:44:42] [INFO ] Transformed 690 transitions.
[2026-05-25 14:44:42] [INFO ] Found NUPN structural information;
[2026-05-25 14:44:42] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 15
FORMULA Peterson-PT-4-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 5, 0, 0, 1, 0, 0, 0, 0, 0] Max Struct:[5, 20, 20, 20, 80, 5, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Peterson-PT-4-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[5, 20, 20, 20, 80, 1, 1, 1, 1, 1, 1, 1]
[2026-05-25 14:44:42] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2026-05-25 14:44:42] [INFO ] Computed 19 invariants in 33 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[5, 20, 20, 20, 80, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 84 ms. (117 steps per ms)
FORMULA Peterson-PT-4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-4-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-4-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-4-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80008 steps (16 resets) in 112 ms. (708 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 5, 4, 5, 5, 0, 0, 0] Max Struct:[5, 20, 20, 20, 80, 1, 1, 1]
[2026-05-25 14:44:43] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2026-05-25 14:44:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:44:43] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2026-05-25 14:44:43] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2026-05-25 14:44:43] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2026-05-25 14:44:43] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-25 14:44:43] [INFO ] [Real]Added 116 Read/Feed constraints in 29 ms returned sat
[2026-05-25 14:44:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:44:43] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2026-05-25 14:44:43] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 14:44:43] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2026-05-25 14:44:44] [INFO ] [Nat]Added 116 Read/Feed constraints in 93 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:44] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:44] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:44] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:44] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:45] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:45] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:45] [INFO ] Deduced a trap composed of 47 places in 151 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:45] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:46] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:46] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:46] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:46] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:47] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:47] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:47] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:47] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:48] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:48] [INFO ] Deduced a trap composed of 57 places in 128 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:48] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:48] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:48] [INFO ] Deduced a trap composed of 45 places in 138 ms of which 22 ms to minimize.
[2026-05-25 14:44:48] [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:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:44:48] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:44:49] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2026-05-25 14:44:49] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 14:44:49] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2026-05-25 14:44:49] [INFO ] [Real]Added 116 Read/Feed constraints in 64 ms returned sat
[2026-05-25 14:44:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:44:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2026-05-25 14:44:49] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-25 14:44:49] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2026-05-25 14:44:49] [INFO ] [Nat]Added 116 Read/Feed constraints in 79 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:49] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:50] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:50] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:50] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:50] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 9 ms to minimize.
[2026-05-25 14:44:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 900 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:44:50] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:44:50] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:44:50] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2026-05-25 14:44:50] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 14:44:51] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2026-05-25 14:44:51] [INFO ] [Real]Added 116 Read/Feed constraints in 18 ms returned sat
[2026-05-25 14:44:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:44:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2026-05-25 14:44:51] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 14:44:51] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2026-05-25 14:44:51] [INFO ] [Nat]Added 116 Read/Feed constraints in 19 ms returned sat
[2026-05-25 14:44:51] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 35 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:53] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 12 ms to minimize.
[2026-05-25 14:44:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2026-05-25 14:44:53] [INFO ] Added : 174 causal constraints over 35 iterations in 2187 ms. Result :sat
Minimization took 237 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:44:54] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2026-05-25 14:44:54] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 14:44:54] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2026-05-25 14:44:54] [INFO ] [Real]Added 116 Read/Feed constraints in 42 ms returned sat
[2026-05-25 14:44:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:44:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2026-05-25 14:44:54] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-25 14:44:54] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2026-05-25 14:44:54] [INFO ] [Nat]Added 116 Read/Feed constraints in 18 ms returned sat
[2026-05-25 14:44:54] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 33 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:58] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:58] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:59] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:44:59] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 23 ms to minimize.
[2026-05-25 14:44:59] [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 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1131)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:44:59] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2026-05-25 14:44:59] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 14:44:59] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2026-05-25 14:44:59] [INFO ] [Real]Added 116 Read/Feed constraints in 13 ms returned sat
[2026-05-25 14:44:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:44:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2026-05-25 14:44:59] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 14:44:59] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2026-05-25 14:44:59] [INFO ] [Nat]Added 116 Read/Feed constraints in 12 ms returned sat
[2026-05-25 14:44:59] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 33 ms.
[2026-05-25 14:45:00] [INFO ] Added : 17 causal constraints over 4 iterations in 208 ms. Result :sat
Minimization took 164 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 5, 4, 5, 5, 0, 0, 0] Max Struct:[5, 5, 4, 5, 5, 1, 1, 1]
FORMULA Peterson-PT-4-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[5, 1, 1]
Support contains 7 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 480 transition count 493
Reduce places removed 197 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 198 rules applied. Total rules applied 395 place count 283 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 396 place count 282 transition count 492
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 396 place count 282 transition count 398
Deduced a syphon composed of 94 places in 1 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 584 place count 188 transition count 398
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 624 place count 168 transition count 378
Applied a total of 624 rules in 80 ms. Remains 168 /480 variables (removed 312) and now considering 378/690 (removed 312) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 168/480 places, 378/690 transitions.
[2026-05-25 14:45:00] [INFO ] Flow matrix only has 318 transitions (discarded 60 similar events)
// Phase 1: matrix 318 rows 168 cols
[2026-05-25 14:45:00] [INFO ] Computed 19 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[5, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1354 ms. (738 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 1413 ms. (2121 steps per ms)
FORMULA Peterson-PT-4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0] Max Struct:[5, 1]
[2026-05-25 14:45:03] [INFO ] Flow matrix only has 318 transitions (discarded 60 similar events)
[2026-05-25 14:45:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 14:45:03] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2026-05-25 14:45:03] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2026-05-25 14:45:03] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2026-05-25 14:45:03] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-25 14:45:03] [INFO ] [Real]Added 116 Read/Feed constraints in 12 ms returned sat
[2026-05-25 14:45:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 14:45:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2026-05-25 14:45:03] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2026-05-25 14:45:03] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2026-05-25 14:45:03] [INFO ] [Nat]Added 116 Read/Feed constraints in 20 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:03] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:03] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:04] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:04] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:04] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:04] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:04] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:04] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:04] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:04] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:04] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:04] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:04] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:05] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:05] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:05] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:05] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:05] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:05] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:05] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:05] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:05] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:05] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:06] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:06] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:06] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:06] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:06] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:06] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:06] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:06] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:06] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:06] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:07] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:07] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:07] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:07] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:07] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:07] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:08] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:08] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:08] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:08] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:08] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:08] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:08] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:08] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:08] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:08] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:09] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:09] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:09] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:09] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:09] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:09] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:09] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:09] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:09] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:09] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:10] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:10] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:10] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:10] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:10] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:10] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:10] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:11] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:11] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:11] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:11] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 5 ms to minimize.
[2026-05-25 14:45:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 70 trap constraints in 9129 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 14:45:12] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2026-05-25 14:45:12] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-25 14:45:12] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2026-05-25 14:45:13] [INFO ] [Real]Added 116 Read/Feed constraints in 9 ms returned sat
[2026-05-25 14:45:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 14:45:13] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2026-05-25 14:45:13] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2026-05-25 14:45:13] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2026-05-25 14:45:13] [INFO ] [Nat]Added 116 Read/Feed constraints in 11 ms returned sat
[2026-05-25 14:45:13] [INFO ] Computed and/alt/rep : 277/794/277 causal constraints (skipped 36 transitions) in 24 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:13] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:13] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:13] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:13] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:13] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:14] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:14] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:14] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 7 ms to minimize.
[2026-05-25 14:45:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 796 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:14] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:14] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:14] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:45:14] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 4 ms to minimize.
[2026-05-25 14:45:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 377 ms
[2026-05-25 14:45:14] [INFO ] Added : 92 causal constraints over 22 iterations in 1674 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0] Max Struct:[1, 1]
FORMULA Peterson-PT-4-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 168 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place BeginLoop_4_3_2) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 377/377 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 167 transition count 375
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 166 transition count 373
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 166 transition count 367
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 160 transition count 367
Applied a total of 14 rules in 19 ms. Remains 160 /168 variables (removed 8) and now considering 367/377 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 160/168 places, 367/377 transitions.
[2026-05-25 14:45:15] [INFO ] Flow matrix only has 307 transitions (discarded 60 similar events)
// Phase 1: matrix 307 rows 160 cols
[2026-05-25 14:45:15] [INFO ] Computed 19 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1272 ms. (785 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 422 ms. (2364 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 14:45:16] [INFO ] Flow matrix only has 307 transitions (discarded 60 similar events)
[2026-05-25 14:45:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 14:45:16] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2026-05-25 14:45:16] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 14:45:16] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2026-05-25 14:45:16] [INFO ] State equation strengthened by 114 read => feed constraints.
[2026-05-25 14:45:16] [INFO ] [Real]Added 114 Read/Feed constraints in 10 ms returned sat
[2026-05-25 14:45:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 14:45:16] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2026-05-25 14:45:16] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2026-05-25 14:45:16] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2026-05-25 14:45:16] [INFO ] [Nat]Added 114 Read/Feed constraints in 10 ms returned sat
[2026-05-25 14:45:16] [INFO ] Computed and/alt/rep : 266/780/266 causal constraints (skipped 36 transitions) in 17 ms.
[2026-05-25 14:45:17] [INFO ] Added : 15 causal constraints over 4 iterations in 111 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 367/367 transitions.
Applied a total of 0 rules in 17 ms. Remains 160 /160 variables (removed 0) and now considering 367/367 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 160/160 places, 367/367 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 367/367 transitions.
Applied a total of 0 rules in 9 ms. Remains 160 /160 variables (removed 0) and now considering 367/367 (removed 0) transitions.
[2026-05-25 14:45:17] [INFO ] Flow matrix only has 307 transitions (discarded 60 similar events)
[2026-05-25 14:45:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 14:45:17] [INFO ] Implicit Places using invariants in 158 ms returned [150, 151, 152, 153, 154]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 160 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 155/160 places, 367/367 transitions.
Applied a total of 0 rules in 8 ms. Remains 155 /155 variables (removed 0) and now considering 367/367 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 181 ms. Remains : 155/160 places, 367/367 transitions.
[2026-05-25 14:45:17] [INFO ] Flow matrix only has 307 transitions (discarded 60 similar events)
// Phase 1: matrix 307 rows 155 cols
[2026-05-25 14:45:17] [INFO ] Computed 14 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA Peterson-PT-4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 1211 ms. (825 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-25 14:45:18] [INFO ] Flatten gal took : 54 ms
[2026-05-25 14:45:18] [INFO ] Flatten gal took : 26 ms
[2026-05-25 14:45:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1886049749952701672.gal : 13 ms
[2026-05-25 14:45:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1933824074852496801.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1886049749952701672.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1933824074852496801.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 36325 ms.

BK_STOP 1779720318942

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-4"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is Peterson-PT-4, 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 r207-tall-177969919800090"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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