About the Execution of 2024-gold for BugTracking-PT-q3m016
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15686.550 | 299751.00 | 371325.00 | 903.30 | 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 | normal |
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.r027-smll-174853774300064.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 BugTracking-PT-q3m016, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r027-smll-174853774300064
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q3m016-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748550505642
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m016
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 20:28:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 20:28:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:28:30] [INFO ] Load time of PNML (sax parser for PT used): 1610 ms
[2025-05-29 20:28:30] [INFO ] Transformed 754 places.
[2025-05-29 20:28:30] [INFO ] Transformed 27370 transitions.
[2025-05-29 20:28:30] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1960 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Deduced a syphon composed of 514 places in 142 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m016-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-29 20:28:30] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2025-05-29 20:28:30] [INFO ] Computed 10 invariants in 92 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, 1, +inf]
RANDOM walk for 10000 steps (39 resets) in 203 ms. (49 steps per ms)
FORMULA BugTracking-PT-q3m016-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (43 resets) in 305 ms. (228 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
[2025-05-29 20:28:31] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2025-05-29 20:28:31] [INFO ] Invariant cache hit.
[2025-05-29 20:28:31] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-05-29 20:28:32] [INFO ] [Real]Absence check using state equation in 1077 ms returned sat
[2025-05-29 20:28:33] [INFO ] State equation strengthened by 255 read => feed constraints.
[2025-05-29 20:28:33] [INFO ] [Real]Added 255 Read/Feed constraints in 92 ms returned sat
[2025-05-29 20:28:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:28:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 20:28:34] [INFO ] [Nat]Absence check using state equation in 952 ms returned sat
[2025-05-29 20:28:34] [INFO ] [Nat]Added 255 Read/Feed constraints in 247 ms returned sat
[2025-05-29 20:28:35] [INFO ] Deduced a trap composed of 12 places in 580 ms of which 23 ms to minimize.
[2025-05-29 20:28:35] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 2 ms to minimize.
[2025-05-29 20:28:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1037 ms
[2025-05-29 20:28:36] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 327 ms.
[2025-05-29 20:28:36] [INFO ] Added : 6 causal constraints over 2 iterations in 800 ms. Result :sat
Minimization took 753 ms.
[2025-05-29 20:28:37] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:28:38] [INFO ] [Real]Absence check using state equation in 922 ms returned sat
[2025-05-29 20:28:38] [INFO ] [Real]Added 255 Read/Feed constraints in 90 ms returned sat
[2025-05-29 20:28:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:28:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:28:39] [INFO ] [Nat]Absence check using state equation in 911 ms returned sat
[2025-05-29 20:28:39] [INFO ] [Nat]Added 255 Read/Feed constraints in 285 ms returned sat
[2025-05-29 20:28:41] [INFO ] Deduced a trap composed of 42 places in 1052 ms of which 5 ms to minimize.
[2025-05-29 20:28:42] [INFO ] Deduced a trap composed of 74 places in 924 ms of which 3 ms to minimize.
[2025-05-29 20:28:43] [INFO ] Deduced a trap composed of 31 places in 805 ms of which 5 ms to minimize.
[2025-05-29 20:28:44] [INFO ] Deduced a trap composed of 53 places in 943 ms of which 5 ms to minimize.
[2025-05-29 20:28:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 20:28:44] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:28:45] [INFO ] [Real]Absence check using state equation in 893 ms returned sat
[2025-05-29 20:28:45] [INFO ] [Real]Added 255 Read/Feed constraints in 51 ms returned sat
[2025-05-29 20:28:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:28:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 20:28:45] [INFO ] [Nat]Absence check using state equation in 653 ms returned sat
[2025-05-29 20:28:46] [INFO ] [Nat]Added 255 Read/Feed constraints in 91 ms returned sat
[2025-05-29 20:28:46] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 281 ms.
[2025-05-29 20:28:46] [INFO ] Added : 2 causal constraints over 1 iterations in 615 ms. Result :sat
Minimization took 671 ms.
[2025-05-29 20:28:47] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 20:28:48] [INFO ] [Real]Absence check using state equation in 551 ms returned sat
[2025-05-29 20:28:48] [INFO ] [Real]Added 255 Read/Feed constraints in 57 ms returned sat
[2025-05-29 20:28:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:28:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 20:28:48] [INFO ] [Nat]Absence check using state equation in 669 ms returned sat
[2025-05-29 20:28:49] [INFO ] [Nat]Added 255 Read/Feed constraints in 145 ms returned sat
[2025-05-29 20:28:50] [INFO ] Deduced a trap composed of 41 places in 909 ms of which 9 ms to minimize.
[2025-05-29 20:28:51] [INFO ] Deduced a trap composed of 74 places in 1027 ms of which 4 ms to minimize.
[2025-05-29 20:28:52] [INFO ] Deduced a trap composed of 38 places in 823 ms of which 4 ms to minimize.
[2025-05-29 20:28:53] [INFO ] Deduced a trap composed of 50 places in 805 ms of which 4 ms to minimize.
[2025-05-29 20:28:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 20:28:53] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 20:28:54] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2025-05-29 20:28:54] [INFO ] [Real]Added 255 Read/Feed constraints in 45 ms returned sat
[2025-05-29 20:28:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:28:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:28:55] [INFO ] [Nat]Absence check using state equation in 867 ms returned sat
[2025-05-29 20:28:55] [INFO ] [Nat]Added 255 Read/Feed constraints in 196 ms returned sat
[2025-05-29 20:28:56] [INFO ] Deduced a trap composed of 17 places in 508 ms of which 3 ms to minimize.
[2025-05-29 20:28:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 712 ms
[2025-05-29 20:28:56] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 374 ms.
[2025-05-29 20:28:56] [INFO ] Added : 4 causal constraints over 1 iterations in 826 ms. Result :sat
Minimization took 900 ms.
[2025-05-29 20:28:57] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:28:58] [INFO ] [Real]Absence check using state equation in 600 ms returned sat
[2025-05-29 20:28:58] [INFO ] [Real]Added 255 Read/Feed constraints in 51 ms returned sat
[2025-05-29 20:28:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:28:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 20:28:59] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2025-05-29 20:28:59] [INFO ] [Nat]Added 255 Read/Feed constraints in 119 ms returned sat
[2025-05-29 20:28:59] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 324 ms.
[2025-05-29 20:29:00] [INFO ] Added : 11 causal constraints over 3 iterations in 1081 ms. Result :sat
Minimization took 902 ms.
[2025-05-29 20:29:01] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 20:29:02] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2025-05-29 20:29:02] [INFO ] [Real]Added 255 Read/Feed constraints in 45 ms returned sat
[2025-05-29 20:29:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:29:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 20:29:03] [INFO ] [Nat]Absence check using state equation in 751 ms returned sat
[2025-05-29 20:29:03] [INFO ] [Nat]Added 255 Read/Feed constraints in 114 ms returned sat
[2025-05-29 20:29:03] [INFO ] Deduced a trap composed of 40 places in 477 ms of which 3 ms to minimize.
[2025-05-29 20:29:04] [INFO ] Deduced a trap composed of 27 places in 523 ms of which 5 ms to minimize.
[2025-05-29 20:29:05] [INFO ] Deduced a trap composed of 23 places in 530 ms of which 2 ms to minimize.
[2025-05-29 20:29:05] [INFO ] Deduced a trap composed of 50 places in 527 ms of which 2 ms to minimize.
[2025-05-29 20:29:06] [INFO ] Deduced a trap composed of 74 places in 568 ms of which 3 ms to minimize.
[2025-05-29 20:29:06] [INFO ] Deduced a trap composed of 60 places in 529 ms of which 3 ms to minimize.
[2025-05-29 20:29:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3857 ms
[2025-05-29 20:29:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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:954)
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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
Support contains 7 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 229 transition count 2747
Applied a total of 19 rules in 505 ms. Remains 229 /240 variables (removed 11) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 527 ms. Remains : 229/240 places, 2747/2769 transitions.
[2025-05-29 20:29:07] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
Found an invariant !
This invariant on transitions {4=1, 1722=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 1722=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 7) seen :[0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
[2025-05-29 20:29:09] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2025-05-29 20:29:09] [INFO ] Computed 8 invariants in 27 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
RANDOM walk for 1000004 steps (2 resets) in 5365 ms. (186 steps per ms)
BEST_FIRST walk for 7000007 steps (14 resets) in 20762 ms. (337 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
[2025-05-29 20:29:35] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-05-29 20:29:35] [INFO ] Invariant cache hit.
[2025-05-29 20:29:35] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:29:36] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2025-05-29 20:29:36] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-05-29 20:29:36] [INFO ] [Real]Added 241 Read/Feed constraints in 54 ms returned sat
[2025-05-29 20:29:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:29:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:29:37] [INFO ] [Nat]Absence check using state equation in 618 ms returned sat
[2025-05-29 20:29:37] [INFO ] [Nat]Added 241 Read/Feed constraints in 105 ms returned sat
[2025-05-29 20:29:37] [INFO ] Deduced a trap composed of 32 places in 497 ms of which 3 ms to minimize.
[2025-05-29 20:29:38] [INFO ] Deduced a trap composed of 12 places in 620 ms of which 3 ms to minimize.
[2025-05-29 20:29:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1367 ms
[2025-05-29 20:29:39] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 348 ms.
[2025-05-29 20:29:39] [INFO ] Added : 2 causal constraints over 1 iterations in 793 ms. Result :sat
Minimization took 2386 ms.
[2025-05-29 20:29:42] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:29:42] [INFO ] [Real]Absence check using state equation in 790 ms returned sat
[2025-05-29 20:29:43] [INFO ] [Real]Added 241 Read/Feed constraints in 71 ms returned sat
[2025-05-29 20:29:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:29:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:29:44] [INFO ] [Nat]Absence check using state equation in 931 ms returned sat
[2025-05-29 20:29:44] [INFO ] [Nat]Added 241 Read/Feed constraints in 202 ms returned sat
[2025-05-29 20:29:45] [INFO ] Deduced a trap composed of 58 places in 646 ms of which 3 ms to minimize.
[2025-05-29 20:29:45] [INFO ] Deduced a trap composed of 19 places in 433 ms of which 3 ms to minimize.
[2025-05-29 20:29:46] [INFO ] Deduced a trap composed of 31 places in 425 ms of which 3 ms to minimize.
[2025-05-29 20:29:46] [INFO ] Deduced a trap composed of 48 places in 513 ms of which 2 ms to minimize.
[2025-05-29 20:29:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2495 ms
[2025-05-29 20:29:47] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 310 ms.
[2025-05-29 20:29:47] [INFO ] Added : 3 causal constraints over 1 iterations in 744 ms. Result :sat
Minimization took 2481 ms.
[2025-05-29 20:29:50] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 20:29:50] [INFO ] [Real]Absence check using state equation in 652 ms returned sat
[2025-05-29 20:29:51] [INFO ] [Real]Added 241 Read/Feed constraints in 56 ms returned sat
[2025-05-29 20:29:51] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:29:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:29:51] [INFO ] [Nat]Absence check using state equation in 696 ms returned sat
[2025-05-29 20:29:51] [INFO ] [Nat]Added 241 Read/Feed constraints in 78 ms returned sat
[2025-05-29 20:29:52] [INFO ] Deduced a trap composed of 11 places in 603 ms of which 3 ms to minimize.
[2025-05-29 20:29:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 783 ms
[2025-05-29 20:29:53] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 325 ms.
[2025-05-29 20:29:53] [INFO ] Added : 2 causal constraints over 1 iterations in 587 ms. Result :sat
Minimization took 2342 ms.
[2025-05-29 20:29:55] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:29:56] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2025-05-29 20:29:56] [INFO ] [Real]Added 241 Read/Feed constraints in 45 ms returned sat
[2025-05-29 20:29:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:29:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:29:57] [INFO ] [Nat]Absence check using state equation in 874 ms returned sat
[2025-05-29 20:29:57] [INFO ] [Nat]Added 241 Read/Feed constraints in 123 ms returned sat
[2025-05-29 20:29:58] [INFO ] Deduced a trap composed of 39 places in 779 ms of which 4 ms to minimize.
[2025-05-29 20:29:59] [INFO ] Deduced a trap composed of 75 places in 902 ms of which 4 ms to minimize.
[2025-05-29 20:30:00] [INFO ] Deduced a trap composed of 74 places in 595 ms of which 4 ms to minimize.
[2025-05-29 20:30:01] [INFO ] Deduced a trap composed of 78 places in 598 ms of which 3 ms to minimize.
[2025-05-29 20:30:01] [INFO ] Deduced a trap composed of 73 places in 405 ms of which 2 ms to minimize.
[2025-05-29 20:30:02] [INFO ] Deduced a trap composed of 47 places in 451 ms of which 4 ms to minimize.
[2025-05-29 20:30:02] [INFO ] Deduced a trap composed of 68 places in 472 ms of which 3 ms to minimize.
[2025-05-29 20:30:03] [INFO ] Deduced a trap composed of 68 places in 603 ms of which 3 ms to minimize.
[2025-05-29 20:30:05] [INFO ] Deduced a trap composed of 68 places in 593 ms of which 4 ms to minimize.
[2025-05-29 20:30:06] [INFO ] Deduced a trap composed of 77 places in 560 ms of which 3 ms to minimize.
[2025-05-29 20:30:06] [INFO ] Deduced a trap composed of 58 places in 317 ms of which 2 ms to minimize.
[2025-05-29 20:30:06] [INFO ] Deduced a trap composed of 59 places in 314 ms of which 2 ms to minimize.
[2025-05-29 20:30:07] [INFO ] Deduced a trap composed of 16 places in 246 ms of which 2 ms to minimize.
[2025-05-29 20:30:07] [INFO ] Deduced a trap composed of 37 places in 453 ms of which 3 ms to minimize.
[2025-05-29 20:30:08] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 10474 ms
[2025-05-29 20:30:08] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 346 ms.
[2025-05-29 20:30:08] [INFO ] Added : 7 causal constraints over 2 iterations in 894 ms. Result :sat
Minimization took 2343 ms.
[2025-05-29 20:30:11] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 20:30:12] [INFO ] [Real]Absence check using state equation in 724 ms returned sat
[2025-05-29 20:30:12] [INFO ] [Real]Added 241 Read/Feed constraints in 44 ms returned sat
[2025-05-29 20:30:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:30:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:30:13] [INFO ] [Nat]Absence check using state equation in 749 ms returned sat
[2025-05-29 20:30:13] [INFO ] [Nat]Added 241 Read/Feed constraints in 152 ms returned sat
[2025-05-29 20:30:13] [INFO ] Deduced a trap composed of 10 places in 539 ms of which 3 ms to minimize.
[2025-05-29 20:30:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 652 ms
[2025-05-29 20:30:14] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 211 ms.
[2025-05-29 20:30:14] [INFO ] Added : 3 causal constraints over 1 iterations in 465 ms. Result :sat
Minimization took 2423 ms.
[2025-05-29 20:30:16] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 20:30:17] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2025-05-29 20:30:17] [INFO ] [Real]Added 241 Read/Feed constraints in 50 ms returned sat
[2025-05-29 20:30:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:30:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:30:18] [INFO ] [Nat]Absence check using state equation in 638 ms returned sat
[2025-05-29 20:30:18] [INFO ] [Nat]Added 241 Read/Feed constraints in 146 ms returned sat
[2025-05-29 20:30:19] [INFO ] Deduced a trap composed of 51 places in 708 ms of which 3 ms to minimize.
[2025-05-29 20:30:20] [INFO ] Deduced a trap composed of 76 places in 858 ms of which 4 ms to minimize.
[2025-05-29 20:30:21] [INFO ] Deduced a trap composed of 49 places in 850 ms of which 3 ms to minimize.
[2025-05-29 20:30:22] [INFO ] Deduced a trap composed of 14 places in 721 ms of which 3 ms to minimize.
[2025-05-29 20:30:23] [INFO ] Deduced a trap composed of 47 places in 856 ms of which 4 ms to minimize.
[2025-05-29 20:30:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4706 ms
[2025-05-29 20:30:23] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 366 ms.
[2025-05-29 20:30:24] [INFO ] Added : 7 causal constraints over 3 iterations in 926 ms. Result :sat
Minimization took 2450 ms.
[2025-05-29 20:30:26] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:30:27] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2025-05-29 20:30:27] [INFO ] [Real]Added 241 Read/Feed constraints in 45 ms returned sat
[2025-05-29 20:30:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:30:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:30:28] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2025-05-29 20:30:28] [INFO ] [Nat]Added 241 Read/Feed constraints in 138 ms returned sat
[2025-05-29 20:30:28] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 325 ms.
[2025-05-29 20:30:29] [INFO ] Added : 4 causal constraints over 1 iterations in 649 ms. Result :sat
Minimization took 2152 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
Support contains 7 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 77 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 71 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2025-05-29 20:30:32] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-05-29 20:30:32] [INFO ] Invariant cache hit.
[2025-05-29 20:30:33] [INFO ] Implicit Places using invariants in 645 ms returned []
[2025-05-29 20:30:33] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-05-29 20:30:33] [INFO ] Invariant cache hit.
[2025-05-29 20:30:33] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-05-29 20:30:35] [INFO ] Implicit Places using invariants and state equation in 2757 ms returned []
Implicit Place search using SMT with State Equation took 3405 ms to find 0 implicit places.
[2025-05-29 20:30:36] [INFO ] Redundant transitions in 260 ms returned []
Running 2746 sub problems to find dead transitions.
[2025-05-29 20:30:36] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-05-29 20:30:36] [INFO ] Invariant cache hit.
[2025-05-29 20:30:36] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 229/2847 variables, and 8 constraints, problems are : Problem set: 0 solved, 2746 unsolved in 30151 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 2746/2746 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2746 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
[2025-05-29 20:31:52] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 2 ms to minimize.
[2025-05-29 20:31:57] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 2 ms to minimize.
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
[2025-05-29 20:31:57] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
[2025-05-29 20:31:57] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 1 ms to minimize.
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
[2025-05-29 20:31:57] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 1 ms to minimize.
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
[2025-05-29 20:31:57] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1725 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1755 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
[2025-05-29 20:32:06] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 1 ms to minimize.
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 7/15 constraints. Problems are: Problem set: 474 solved, 2272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 229/2847 variables, and 15 constraints, problems are : Problem set: 474 solved, 2272 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 0/2746 constraints, Known Traps: 7/7 constraints]
After SMT, in 93168ms problems are : Problem set: 474 solved, 2272 unsolved
Search for dead transitions found 474 dead transitions in 93288ms
Found 474 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 474 transitions
Dead transitions reduction (with SMT) removed 474 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 229/229 places, 2273/2747 transitions.
Reduce places removed 26 places and 563 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 203 transition count 1710
Reduce places removed 20 places and 260 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 46 place count 183 transition count 1450
Reduce places removed 8 places and 156 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 54 place count 175 transition count 1294
Reduce places removed 8 places and 88 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 62 place count 167 transition count 1206
Reduce places removed 3 places and 66 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 65 place count 164 transition count 1140
Reduce places removed 3 places and 52 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 68 place count 161 transition count 1088
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 80 place count 149 transition count 1027
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 14 places and 231 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 106 place count 135 transition count 796
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 112 place count 129 transition count 742
Deduced a syphon composed of 5 places in 2 ms
Iterating global reduction 6 with 6 rules applied. Total rules applied 118 place count 129 transition count 742
Deduced a syphon composed of 5 places in 1 ms
Applied a total of 118 rules in 71 ms. Remains 129 /229 variables (removed 100) and now considering 742/2273 (removed 1531) transitions.
[2025-05-29 20:32:09] [INFO ] Flow matrix only has 679 transitions (discarded 63 similar events)
// Phase 1: matrix 679 rows 129 cols
[2025-05-29 20:32:09] [INFO ] Computed 13 invariants in 5 ms
[2025-05-29 20:32:09] [INFO ] Implicit Places using invariants in 236 ms returned []
[2025-05-29 20:32:09] [INFO ] Flow matrix only has 679 transitions (discarded 63 similar events)
[2025-05-29 20:32:09] [INFO ] Invariant cache hit.
[2025-05-29 20:32:09] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 20:32:10] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 837 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 129/229 places, 742/2747 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 97986 ms. Remains : 129/229 places, 742/2747 transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
FORMULA BugTracking-PT-q3m016-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 20:32:10] [INFO ] Flow matrix only has 679 transitions (discarded 63 similar events)
Found an invariant !
This invariant on transitions {4=1, 380=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 380=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :[0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
[2025-05-29 20:32:10] [INFO ] Flow matrix only has 679 transitions (discarded 63 similar events)
// Phase 1: matrix 679 rows 124 cols
[2025-05-29 20:32:10] [INFO ] Computed 8 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
RANDOM walk for 1000007 steps (2 resets) in 2098 ms. (476 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 3050 ms. (655 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
[2025-05-29 20:32:15] [INFO ] Flow matrix only has 679 transitions (discarded 63 similar events)
[2025-05-29 20:32:15] [INFO ] Invariant cache hit.
[2025-05-29 20:32:15] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 20:32:16] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2025-05-29 20:32:16] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 20:32:16] [INFO ] [Real]Added 90 Read/Feed constraints in 14 ms returned sat
[2025-05-29 20:32:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:32:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-29 20:32:16] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2025-05-29 20:32:16] [INFO ] [Nat]Added 90 Read/Feed constraints in 22 ms returned sat
[2025-05-29 20:32:16] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 2 ms to minimize.
[2025-05-29 20:32:16] [INFO ] Deduced a trap composed of 24 places in 271 ms of which 3 ms to minimize.
[2025-05-29 20:32:17] [INFO ] Deduced a trap composed of 27 places in 291 ms of which 2 ms to minimize.
[2025-05-29 20:32:17] [INFO ] Deduced a trap composed of 31 places in 289 ms of which 3 ms to minimize.
[2025-05-29 20:32:17] [INFO ] Deduced a trap composed of 27 places in 265 ms of which 3 ms to minimize.
[2025-05-29 20:32:18] [INFO ] Deduced a trap composed of 32 places in 273 ms of which 5 ms to minimize.
[2025-05-29 20:32:18] [INFO ] Deduced a trap composed of 26 places in 261 ms of which 3 ms to minimize.
[2025-05-29 20:32:18] [INFO ] Deduced a trap composed of 31 places in 279 ms of which 2 ms to minimize.
[2025-05-29 20:32:18] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2459 ms
[2025-05-29 20:32:18] [INFO ] Computed and/alt/rep : 189/588/187 causal constraints (skipped 491 transitions) in 76 ms.
[2025-05-29 20:32:18] [INFO ] Added : 4 causal constraints over 1 iterations in 200 ms. Result :sat
Minimization took 503 ms.
[2025-05-29 20:32:19] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:32:19] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2025-05-29 20:32:19] [INFO ] [Real]Added 90 Read/Feed constraints in 23 ms returned sat
[2025-05-29 20:32:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:32:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:32:20] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2025-05-29 20:32:20] [INFO ] [Nat]Added 90 Read/Feed constraints in 31 ms returned sat
[2025-05-29 20:32:20] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 2 ms to minimize.
[2025-05-29 20:32:20] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 2 ms to minimize.
[2025-05-29 20:32:20] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 2 ms to minimize.
[2025-05-29 20:32:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 576 ms
[2025-05-29 20:32:20] [INFO ] Computed and/alt/rep : 189/588/187 causal constraints (skipped 491 transitions) in 88 ms.
[2025-05-29 20:32:21] [INFO ] Added : 3 causal constraints over 1 iterations in 215 ms. Result :sat
Minimization took 513 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 742/742 transitions.
Applied a total of 0 rules in 16 ms. Remains 124 /124 variables (removed 0) and now considering 742/742 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 124/124 places, 742/742 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 742/742 transitions.
Applied a total of 0 rules in 10 ms. Remains 124 /124 variables (removed 0) and now considering 742/742 (removed 0) transitions.
[2025-05-29 20:32:21] [INFO ] Flow matrix only has 679 transitions (discarded 63 similar events)
[2025-05-29 20:32:21] [INFO ] Invariant cache hit.
[2025-05-29 20:32:21] [INFO ] Implicit Places using invariants in 266 ms returned []
[2025-05-29 20:32:21] [INFO ] Flow matrix only has 679 transitions (discarded 63 similar events)
[2025-05-29 20:32:21] [INFO ] Invariant cache hit.
[2025-05-29 20:32:22] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 20:32:22] [INFO ] Implicit Places using invariants and state equation in 766 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
[2025-05-29 20:32:22] [INFO ] Redundant transitions in 41 ms returned []
Running 741 sub problems to find dead transitions.
[2025-05-29 20:32:22] [INFO ] Flow matrix only has 679 transitions (discarded 63 similar events)
[2025-05-29 20:32:22] [INFO ] Invariant cache hit.
[2025-05-29 20:32:22] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2025-05-29 20:32:29] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2025-05-29 20:32:31] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
Problem TDEAD423 is UNSAT
[2025-05-29 20:32:31] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 3/11 constraints. Problems are: Problem set: 7 solved, 734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/11 constraints. Problems are: Problem set: 7 solved, 734 unsolved
Problem TDEAD422 is UNSAT
At refinement iteration 3 (OVERLAPS) 679/803 variables, 124/135 constraints. Problems are: Problem set: 8 solved, 733 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/803 variables, 90/225 constraints. Problems are: Problem set: 8 solved, 733 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 803/803 variables, and 225 constraints, problems are : Problem set: 8 solved, 733 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 741/741 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 8 solved, 733 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 7/7 constraints. Problems are: Problem set: 8 solved, 733 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 3/10 constraints. Problems are: Problem set: 8 solved, 733 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/10 constraints. Problems are: Problem set: 8 solved, 733 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/11 constraints. Problems are: Problem set: 8 solved, 733 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/11 constraints. Problems are: Problem set: 8 solved, 733 unsolved
At refinement iteration 5 (OVERLAPS) 679/803 variables, 124/135 constraints. Problems are: Problem set: 8 solved, 733 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/803 variables, 90/225 constraints. Problems are: Problem set: 8 solved, 733 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD734 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/803 variables, 733/958 constraints. Problems are: Problem set: 84 solved, 657 unsolved
[2025-05-29 20:33:21] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2025-05-29 20:33:21] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 803/803 variables, and 960 constraints, problems are : Problem set: 84 solved, 657 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 733/741 constraints, Known Traps: 5/5 constraints]
After SMT, in 62487ms problems are : Problem set: 84 solved, 657 unsolved
Search for dead transitions found 84 dead transitions in 62503ms
Found 84 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 84 transitions
Dead transitions reduction (with SMT) removed 84 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 124/124 places, 658/742 transitions.
Graph (complete) has 915 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 14 places and 198 transitions.
Graph (complete) has 710 edges and 109 vertex of which 2 are kept as prefixes of interest. Removing 107 places using SCC suffix rule.0 ms
Discarding 107 places :
Also discarding 460 output transitions
Drop transitions (Output transitions of discarded places.) removed 460 transitions
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 2 transition count 0
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 16 rules in 9 ms. Remains 2 /124 variables (removed 122) and now considering 0/658 (removed 658) transitions.
[2025-05-29 20:33:25] [INFO ] Computed 0 invariants in 0 ms
[2025-05-29 20:33:25] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-05-29 20:33:25] [INFO ] Invariant cache hit.
[2025-05-29 20:33:25] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2/124 places, 0/742 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63671 ms. Remains : 2/124 places, 0/742 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q3m016-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 297033 ms.
BK_STOP 1748550805393
--------------------
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="BugTracking-PT-q3m016"
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 BugTracking-PT-q3m016, 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 r027-smll-174853774300064"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m016.tgz
mv BugTracking-PT-q3m016 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 '
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 ;