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.r167-tall-174881266100055.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 PolyORBLF-PT-S02J06T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266100055
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 15K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 133K 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 8.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 223K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 27K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 140K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 601K 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 PolyORBLF-PT-S02J06T06-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748892659149

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 19:31:00] [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 19:31:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:31:00] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2025-06-02 19:31:00] [INFO ] Transformed 536 places.
[2025-06-02 19:31:00] [INFO ] Transformed 1064 transitions.
[2025-06-02 19:31:00] [INFO ] Parsed PT model containing 536 places and 1064 transitions and 4866 arcs in 226 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 10, 5, 0, 1, 0, 0, 0, 0, 9, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 10, 5, 0, 1, 0, 0, 0, 0, 9, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 19:31:00] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2025-06-02 19:31:00] [INFO ] Computed 50 invariants in 69 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 10, 5, 0, 1, 0, 0, 0, 0, 9, 0, 0, 0, 0, 0] Max Struct:[246, 6, 10, 36, 18, 1, 12, 246, 1, 133, 10, 46, 41, 1, 1, 41]
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (3 resets) in 67 ms. (147 steps per ms)
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100006 steps (21 resets) in 314 ms. (317 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 5, 0, 2, 1, 2, 1, 1, 1] Max Struct:[246, 6, 36, 18, 12, 246, 133, 46, 41, 41]
[2025-06-02 19:31:01] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2025-06-02 19:31:01] [INFO ] Invariant cache hit.
[2025-06-02 19:31:01] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2025-06-02 19:31:01] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 17 ms returned unsat
[2025-06-02 19:31:01] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned unsat
[2025-06-02 19:31:01] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2025-06-02 19:31:01] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 18 ms returned sat
[2025-06-02 19:31:02] [INFO ] [Real]Absence check using state equation in 764 ms returned sat
[2025-06-02 19:31:02] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:31:02] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-02 19:31:02] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 17 ms returned sat
[2025-06-02 19:31:03] [INFO ] [Nat]Absence check using state equation in 716 ms returned sat
[2025-06-02 19:31:03] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 19:31:03] [INFO ] [Nat]Added 72 Read/Feed constraints in 327 ms returned sat
[2025-06-02 19:31:03] [INFO ] Deduced a trap composed of 126 places in 257 ms of which 30 ms to minimize.
[2025-06-02 19:31:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 340 ms
[2025-06-02 19:31:04] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-06-02 19:31:04] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 29 ms returned sat
[2025-06-02 19:31:04] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2025-06-02 19:31:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:31:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-06-02 19:31:04] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 19 ms returned sat
[2025-06-02 19:31:06] [INFO ] [Nat]Absence check using state equation in 1248 ms returned sat
[2025-06-02 19:31:06] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:31:06] [INFO ] [Nat]Added 72 Read/Feed constraints in 898 ms returned sat
[2025-06-02 19:31:07] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 78 ms.
[2025-06-02 19:31:08] [INFO ] Added : 90 causal constraints over 18 iterations in 1819 ms. Result :sat
Minimization took 553 ms.
[2025-06-02 19:31:09] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned unsat
[2025-06-02 19:31:09] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-06-02 19:31:09] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned unsat
[2025-06-02 19:31:09] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-06-02 19:31:09] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 19 ms returned sat
[2025-06-02 19:31:10] [INFO ] [Real]Absence check using state equation in 874 ms returned sat
[2025-06-02 19:31:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:31:10] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-02 19:31:10] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 19 ms returned sat
[2025-06-02 19:31:11] [INFO ] [Nat]Absence check using state equation in 869 ms returned sat
[2025-06-02 19:31:11] [INFO ] [Nat]Added 72 Read/Feed constraints in 345 ms returned sat
[2025-06-02 19:31:12] [INFO ] Deduced a trap composed of 73 places in 242 ms of which 4 ms to minimize.
[2025-06-02 19:31:12] [INFO ] Deduced a trap composed of 271 places in 248 ms of which 3 ms to minimize.
[2025-06-02 19:31:12] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 1 ms to minimize.
[2025-06-02 19:31:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 674 ms
[2025-06-02 19:31:12] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 69 ms.
[2025-06-02 19:31:15] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-02 19:31:15] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-06-02 19:31:15] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 25 ms returned unsat
[2025-06-02 19:31:15] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-02 19:31:15] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 11 ms returned unsat
[2025-06-02 19:31:15] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-06-02 19:31:15] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 11 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 5, 0, 2, 1, 2, 1, 1, 1] Max Struct:[1, 1, 5, 18, 2, 1, 133, 1, 1, 1]
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 2] Max Struct:[18, 133]
Support contains 7 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 534 transition count 915
Reduce places removed 53 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 481 transition count 914
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 480 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 110 place count 480 transition count 854
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 230 place count 420 transition count 854
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 324 place count 373 transition count 807
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 335 place count 373 transition count 796
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 346 place count 362 transition count 796
Applied a total of 346 rules in 186 ms. Remains 362 /536 variables (removed 174) and now considering 796/968 (removed 172) transitions.
Running 794 sub problems to find dead transitions.
[2025-06-02 19:31:16] [INFO ] Flow matrix only has 784 transitions (discarded 12 similar events)
// Phase 1: matrix 784 rows 362 cols
[2025-06-02 19:31:16] [INFO ] Computed 48 invariants in 25 ms
[2025-06-02 19:31:16] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 794 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 794 unsolved
[2025-06-02 19:31:22] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2025-06-02 19:31:22] [INFO ] Deduced a trap composed of 45 places in 32 ms of which 1 ms to minimize.
[2025-06-02 19:31:22] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 0 ms to minimize.
[2025-06-02 19:31:22] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 2 ms to minimize.
[2025-06-02 19:31:22] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2025-06-02 19:31:22] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
[2025-06-02 19:31:23] [INFO ] Deduced a trap composed of 114 places in 173 ms of which 3 ms to minimize.
[2025-06-02 19:31:23] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 2 ms to minimize.
[2025-06-02 19:31:25] [INFO ] Deduced a trap composed of 51 places in 176 ms of which 2 ms to minimize.
[2025-06-02 19:31:26] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 3 ms to minimize.
[2025-06-02 19:31:26] [INFO ] Deduced a trap composed of 214 places in 224 ms of which 2 ms to minimize.
[2025-06-02 19:31:27] [INFO ] Deduced a trap composed of 197 places in 153 ms of which 2 ms to minimize.
[2025-06-02 19:31:27] [INFO ] Deduced a trap composed of 200 places in 151 ms of which 2 ms to minimize.
[2025-06-02 19:31:28] [INFO ] Deduced a trap composed of 129 places in 168 ms of which 2 ms to minimize.
[2025-06-02 19:31:28] [INFO ] Deduced a trap composed of 129 places in 185 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 794 unsolved
[2025-06-02 19:31:31] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2025-06-02 19:31:34] [INFO ] Deduced a trap composed of 109 places in 171 ms of which 2 ms to minimize.
[2025-06-02 19:31:36] [INFO ] Deduced a trap composed of 134 places in 157 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1146 variables, and 64 constraints, problems are : Problem set: 0 solved, 794 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/362 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 794/794 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 794 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 794 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 794 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 794 unsolved
[2025-06-02 19:31:47] [INFO ] Deduced a trap composed of 129 places in 172 ms of which 3 ms to minimize.
[2025-06-02 19:31:49] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 794 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/1146 variables, and 66 constraints, problems are : Problem set: 0 solved, 794 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/362 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/794 constraints, Known Traps: 20/20 constraints]
After SMT, in 41324ms problems are : Problem set: 0 solved, 794 unsolved
Search for dead transitions found 0 dead transitions in 41349ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41557 ms. Remains : 362/536 places, 796/968 transitions.
[2025-06-02 19:31:57] [INFO ] Flow matrix only has 784 transitions (discarded 12 similar events)
[2025-06-02 19:31:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 2] Max Struct:[18, 133]
RANDOM walk for 1000000 steps (544 resets) in 4209 ms. (237 steps per ms)
BEST_FIRST walk for 2000002 steps (455 resets) in 4012 ms. (498 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 2] Max Struct:[18, 133]
[2025-06-02 19:32:05] [INFO ] Flow matrix only has 784 transitions (discarded 12 similar events)
[2025-06-02 19:32:05] [INFO ] Invariant cache hit.
[2025-06-02 19:32:05] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-06-02 19:32:05] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 18 ms returned sat
[2025-06-02 19:32:06] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2025-06-02 19:32:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:32:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-06-02 19:32:06] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 15 ms returned sat
[2025-06-02 19:32:07] [INFO ] [Nat]Absence check using state equation in 963 ms returned sat
[2025-06-02 19:32:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 19:32:07] [INFO ] [Nat]Added 72 Read/Feed constraints in 196 ms returned sat
[2025-06-02 19:32:07] [INFO ] Computed and/alt/rep : 421/1939/415 causal constraints (skipped 367 transitions) in 48 ms.
[2025-06-02 19:32:08] [INFO ] Added : 46 causal constraints over 10 iterations in 781 ms. Result :sat
Minimization took 4508 ms.
[2025-06-02 19:32:12] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-06-02 19:32:12] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 14 ms returned sat
[2025-06-02 19:32:13] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2025-06-02 19:32:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:32:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-06-02 19:32:13] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 13 ms returned sat
[2025-06-02 19:32:13] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2025-06-02 19:32:14] [INFO ] [Nat]Added 72 Read/Feed constraints in 147 ms returned sat
[2025-06-02 19:32:14] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 2 ms to minimize.
[2025-06-02 19:32:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2025-06-02 19:32:14] [INFO ] Computed and/alt/rep : 421/1939/415 causal constraints (skipped 367 transitions) in 47 ms.
[2025-06-02 19:32:16] [INFO ] Added : 126 causal constraints over 26 iterations in 2009 ms. Result :sat
Minimization took 3673 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 2] Max Struct:[18, 133]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 2] Max Struct:[18, 133]
Support contains 7 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 796/796 transitions.
Applied a total of 0 rules in 24 ms. Remains 362 /362 variables (removed 0) and now considering 796/796 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 362/362 places, 796/796 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 796/796 transitions.
Applied a total of 0 rules in 21 ms. Remains 362 /362 variables (removed 0) and now considering 796/796 (removed 0) transitions.
[2025-06-02 19:32:21] [INFO ] Flow matrix only has 784 transitions (discarded 12 similar events)
[2025-06-02 19:32:21] [INFO ] Invariant cache hit.
[2025-06-02 19:32:21] [INFO ] Implicit Places using invariants in 412 ms returned [71, 78, 160, 170, 205, 339]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 415 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 356/362 places, 796/796 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 353 transition count 793
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 353 transition count 793
Applied a total of 6 rules in 28 ms. Remains 353 /356 variables (removed 3) and now considering 793/796 (removed 3) transitions.
[2025-06-02 19:32:21] [INFO ] Flow matrix only has 781 transitions (discarded 12 similar events)
// Phase 1: matrix 781 rows 353 cols
[2025-06-02 19:32:21] [INFO ] Computed 42 invariants in 23 ms
[2025-06-02 19:32:21] [INFO ] Implicit Places using invariants in 408 ms returned []
[2025-06-02 19:32:21] [INFO ] Flow matrix only has 781 transitions (discarded 12 similar events)
[2025-06-02 19:32:21] [INFO ] Invariant cache hit.
[2025-06-02 19:32:22] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 19:32:26] [INFO ] Implicit Places using invariants and state equation in 4283 ms returned []
Implicit Place search using SMT with State Equation took 4695 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 353/362 places, 793/796 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5159 ms. Remains : 353/362 places, 793/796 transitions.
[2025-06-02 19:32:26] [INFO ] Flow matrix only has 781 transitions (discarded 12 similar events)
[2025-06-02 19:32:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 2] Max Struct:[18, 133]
RANDOM walk for 1000000 steps (599 resets) in 3967 ms. (252 steps per ms)
BEST_FIRST walk for 2000002 steps (470 resets) in 3817 ms. (523 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 2] Max Struct:[18, 133]
[2025-06-02 19:32:34] [INFO ] Flow matrix only has 781 transitions (discarded 12 similar events)
[2025-06-02 19:32:34] [INFO ] Invariant cache hit.
[2025-06-02 19:32:34] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-06-02 19:32:34] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 15 ms returned sat
[2025-06-02 19:32:34] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2025-06-02 19:32:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:32:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-06-02 19:32:34] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 16 ms returned sat
[2025-06-02 19:32:36] [INFO ] [Nat]Absence check using state equation in 1929 ms returned sat
[2025-06-02 19:32:36] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 19:32:37] [INFO ] [Nat]Added 72 Read/Feed constraints in 1021 ms returned sat
[2025-06-02 19:32:37] [INFO ] Deduced a trap composed of 129 places in 172 ms of which 2 ms to minimize.
[2025-06-02 19:32:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 345 ms
[2025-06-02 19:32:37] [INFO ] Computed and/alt/rep : 418/1935/412 causal constraints (skipped 367 transitions) in 43 ms.
[2025-06-02 19:32:38] [INFO ] Added : 38 causal constraints over 8 iterations in 663 ms. Result :sat
Minimization took 3024 ms.
[2025-06-02 19:32:41] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-06-02 19:32:41] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 13 ms returned sat
[2025-06-02 19:32:42] [INFO ] [Real]Absence check using state equation in 885 ms returned sat
[2025-06-02 19:32:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:32:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-06-02 19:32:42] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 14 ms returned sat
[2025-06-02 19:32:43] [INFO ] [Nat]Absence check using state equation in 913 ms returned sat
[2025-06-02 19:32:43] [INFO ] [Nat]Added 72 Read/Feed constraints in 241 ms returned sat
[2025-06-02 19:32:44] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 2 ms to minimize.
[2025-06-02 19:32:44] [INFO ] Deduced a trap composed of 206 places in 168 ms of which 3 ms to minimize.
[2025-06-02 19:32:45] [INFO ] Deduced a trap composed of 126 places in 175 ms of which 2 ms to minimize.
[2025-06-02 19:32:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1842 ms
[2025-06-02 19:32:45] [INFO ] Computed and/alt/rep : 418/1935/412 causal constraints (skipped 367 transitions) in 42 ms.
[2025-06-02 19:32:47] [INFO ] Added : 89 causal constraints over 18 iterations in 1699 ms. Result :sat
Minimization took 3247 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 2] Max Struct:[18, 133]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 2] Max Struct:[18, 133]
Support contains 7 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 793/793 transitions.
Applied a total of 0 rules in 17 ms. Remains 353 /353 variables (removed 0) and now considering 793/793 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 353/353 places, 793/793 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 793/793 transitions.
Applied a total of 0 rules in 17 ms. Remains 353 /353 variables (removed 0) and now considering 793/793 (removed 0) transitions.
[2025-06-02 19:32:51] [INFO ] Flow matrix only has 781 transitions (discarded 12 similar events)
[2025-06-02 19:32:51] [INFO ] Invariant cache hit.
[2025-06-02 19:32:51] [INFO ] Implicit Places using invariants in 364 ms returned []
[2025-06-02 19:32:51] [INFO ] Flow matrix only has 781 transitions (discarded 12 similar events)
[2025-06-02 19:32:51] [INFO ] Invariant cache hit.
[2025-06-02 19:32:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 19:32:56] [INFO ] Implicit Places using invariants and state equation in 4216 ms returned []
Implicit Place search using SMT with State Equation took 4582 ms to find 0 implicit places.
[2025-06-02 19:32:56] [INFO ] Redundant transitions in 46 ms returned []
Running 791 sub problems to find dead transitions.
[2025-06-02 19:32:56] [INFO ] Flow matrix only has 781 transitions (discarded 12 similar events)
[2025-06-02 19:32:56] [INFO ] Invariant cache hit.
[2025-06-02 19:32:56] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 791 unsolved
[2025-06-02 19:33:02] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 1 ms to minimize.
[2025-06-02 19:33:02] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2025-06-02 19:33:02] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 0 ms to minimize.
[2025-06-02 19:33:02] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 2 ms to minimize.
[2025-06-02 19:33:02] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2025-06-02 19:33:02] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 2 ms to minimize.
[2025-06-02 19:33:02] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2025-06-02 19:33:03] [INFO ] Deduced a trap composed of 114 places in 169 ms of which 2 ms to minimize.
[2025-06-02 19:33:03] [INFO ] Deduced a trap composed of 52 places in 167 ms of which 2 ms to minimize.
[2025-06-02 19:33:06] [INFO ] Deduced a trap composed of 120 places in 167 ms of which 3 ms to minimize.
[2025-06-02 19:33:06] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 2 ms to minimize.
[2025-06-02 19:33:06] [INFO ] Deduced a trap composed of 121 places in 160 ms of which 3 ms to minimize.
[2025-06-02 19:33:08] [INFO ] Deduced a trap composed of 150 places in 162 ms of which 2 ms to minimize.
[2025-06-02 19:33:08] [INFO ] Deduced a trap composed of 111 places in 159 ms of which 2 ms to minimize.
[2025-06-02 19:33:08] [INFO ] Deduced a trap composed of 134 places in 158 ms of which 2 ms to minimize.
[2025-06-02 19:33:09] [INFO ] Deduced a trap composed of 180 places in 176 ms of which 2 ms to minimize.
[2025-06-02 19:33:09] [INFO ] Deduced a trap composed of 151 places in 169 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/351 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 791 unsolved
Problem TDEAD690 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/353 variables, 2/59 constraints. Problems are: Problem set: 66 solved, 725 unsolved
[2025-06-02 19:33:27] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 2 ms to minimize.
SMT process timed out in 31173ms, After SMT, problems are : Problem set: 66 solved, 725 unsolved
Search for dead transitions found 66 dead transitions in 31182ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 353/353 places, 727/793 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 351 transition count 715
Reduce places removed 6 places and 12 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 8 place count 345 transition count 703
Deduced a syphon composed of 6 places in 1 ms
Applied a total of 8 rules in 19 ms. Remains 345 /353 variables (removed 8) and now considering 703/727 (removed 24) transitions.
[2025-06-02 19:33:27] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
// Phase 1: matrix 691 rows 345 cols
[2025-06-02 19:33:27] [INFO ] Computed 48 invariants in 8 ms
[2025-06-02 19:33:27] [INFO ] Implicit Places using invariants in 334 ms returned []
[2025-06-02 19:33:27] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
[2025-06-02 19:33:27] [INFO ] Invariant cache hit.
[2025-06-02 19:33:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 19:33:31] [INFO ] Implicit Places using invariants and state equation in 3335 ms returned []
Implicit Place search using SMT with State Equation took 3672 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 345/353 places, 703/793 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 39537 ms. Remains : 345/353 places, 703/793 transitions.
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 19:33:31] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
// Phase 1: matrix 691 rows 339 cols
[2025-06-02 19:33:31] [INFO ] Computed 42 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 2] Max Struct:[4, 133]
RANDOM walk for 1000000 steps (529 resets) in 3078 ms. (324 steps per ms)
BEST_FIRST walk for 1000001 steps (256 resets) in 1476 ms. (677 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2] Max Struct:[4, 133]
[2025-06-02 19:33:35] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
[2025-06-02 19:33:35] [INFO ] Invariant cache hit.
[2025-06-02 19:33:35] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2025-06-02 19:33:35] [INFO ] [Real]Absence check using 16 positive and 26 generalized place invariants in 5 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2] Max Struct:[2, 133]
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[133]
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 )
[2025-06-02 19:33:36] [INFO ] Flatten gal took : 98 ms
[2025-06-02 19:33:36] [INFO ] Flatten gal took : 54 ms
[2025-06-02 19:33:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10051179882381123288.gal : 25 ms
[2025-06-02 19:33:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10921415756788332297.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/ReachabilityCardinality10051179882381123288.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10921415756788332297.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[133]
All properties solved without resorting to model-checking.
Total runtime 155834 ms.

BK_STOP 1748892816284

--------------------
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="PolyORBLF-PT-S02J06T06"
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 PolyORBLF-PT-S02J06T06, 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 r167-tall-174881266100055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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