Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994400453.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 itstools
Input is SieveSingleMsgMbox-PT-d2m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994400453
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.1M May 29 14:33 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 SieveSingleMsgMbox-PT-d2m04-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749176297888

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-06 02:18:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 02:18:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 02:18:19] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2025-06-06 02:18:19] [INFO ] Transformed 2398 places.
[2025-06-06 02:18:19] [INFO ] Transformed 1954 transitions.
[2025-06-06 02:18:19] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 292 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 1984 places in 28 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
// Phase 1: matrix 1954 rows 414 cols
[2025-06-06 02:18:19] [INFO ] Computed 6 invariants in 76 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 10000 steps (2223 resets) in 395 ms. (25 steps per ms)
BEST_FIRST walk for 30001 steps (2831 resets) in 225 ms. (132 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-06-06 02:18:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 02:18:20] [INFO ] [Real]Absence check using 3 positive place invariants in 16 ms returned sat
[2025-06-06 02:18:20] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 7 ms returned sat
[2025-06-06 02:18:20] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2025-06-06 02:18:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 02:18:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 02:18:21] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2025-06-06 02:18:21] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2025-06-06 02:18:21] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2025-06-06 02:18:22] [INFO ] [Nat]Added 1674 Read/Feed constraints in 637 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:22] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:23] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:23] [INFO ] Deduced a trap composed of 28 places in 300 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:24] [INFO ] Deduced a trap composed of 28 places in 265 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:24] [INFO ] Deduced a trap composed of 28 places in 264 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:24] [INFO ] Deduced a trap composed of 28 places in 277 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:25] [INFO ] Deduced a trap composed of 28 places in 270 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:25] [INFO ] Deduced a trap composed of 28 places in 243 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:26] [INFO ] Deduced a trap composed of 28 places in 255 ms of which 26 ms to minimize.
[2025-06-06 02:18:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 02:18:26] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 02:18:26] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2025-06-06 02:18:26] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2025-06-06 02:18:27] [INFO ] [Real]Added 1674 Read/Feed constraints in 356 ms returned sat
[2025-06-06 02:18:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 02:18:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 02:18:27] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2025-06-06 02:18:27] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2025-06-06 02:18:27] [INFO ] [Nat]Added 1674 Read/Feed constraints in 375 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:28] [INFO ] Deduced a trap composed of 29 places in 261 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:28] [INFO ] Deduced a trap composed of 29 places in 273 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:28] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 3 ms to minimize.
[2025-06-06 02:18:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 918 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 02:18:28] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 02:18:28] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2025-06-06 02:18:29] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2025-06-06 02:18:29] [INFO ] [Real]Added 1674 Read/Feed constraints in 332 ms returned sat
[2025-06-06 02:18:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 02:18:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 02:18:29] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2025-06-06 02:18:30] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2025-06-06 02:18:30] [INFO ] [Nat]Added 1674 Read/Feed constraints in 482 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:30] [INFO ] Deduced a trap composed of 22 places in 251 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:31] [INFO ] Deduced a trap composed of 22 places in 251 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:32] [INFO ] Deduced a trap composed of 27 places in 258 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:32] [INFO ] Deduced a trap composed of 27 places in 277 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:32] [INFO ] Deduced a trap composed of 27 places in 244 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:33] [INFO ] Deduced a trap composed of 27 places in 273 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:33] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:34] [INFO ] Deduced a trap composed of 27 places in 244 ms of which 27 ms to minimize.
[2025-06-06 02:18:34] [INFO ] Trap strengthening (SAT) tested/added 8/8 trap constraints in 4141 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 0, 1]
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.5 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 119 places :
Symmetric choice reduction at 1 with 119 rule applications. Total rules 950 place count 269 transition count 372
Iterating global reduction 1 with 119 rules applied. Total rules applied 1069 place count 269 transition count 372
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1079 place count 269 transition count 362
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 1171 place count 177 transition count 270
Iterating global reduction 2 with 92 rules applied. Total rules applied 1263 place count 177 transition count 270
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 1298 place count 177 transition count 235
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1337 place count 138 transition count 181
Iterating global reduction 3 with 39 rules applied. Total rules applied 1376 place count 138 transition count 181
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1400 place count 138 transition count 157
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1408 place count 130 transition count 146
Iterating global reduction 4 with 8 rules applied. Total rules applied 1416 place count 130 transition count 146
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1424 place count 122 transition count 138
Iterating global reduction 4 with 8 rules applied. Total rules applied 1432 place count 122 transition count 138
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1436 place count 118 transition count 133
Iterating global reduction 4 with 4 rules applied. Total rules applied 1440 place count 118 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1442 place count 118 transition count 131
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1446 place count 114 transition count 127
Iterating global reduction 5 with 4 rules applied. Total rules applied 1450 place count 114 transition count 127
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1452 place count 112 transition count 125
Iterating global reduction 5 with 2 rules applied. Total rules applied 1454 place count 112 transition count 125
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1455 place count 111 transition count 124
Iterating global reduction 5 with 1 rules applied. Total rules applied 1456 place count 111 transition count 124
Applied a total of 1456 rules in 108 ms. Remains 111 /414 variables (removed 303) and now considering 124/1954 (removed 1830) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 111/414 places, 124/1954 transitions.
// Phase 1: matrix 124 rows 111 cols
[2025-06-06 02:18:35] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (224782 resets) in 1189 ms. (840 steps per ms)
BEST_FIRST walk for 2000001 steps (206202 resets) in 1155 ms. (1730 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-06 02:18:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 02:18:37] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-06 02:18:37] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 02:18:37] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-06-06 02:18:37] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-06 02:18:37] [INFO ] [Real]Added 47 Read/Feed constraints in 14 ms returned sat
[2025-06-06 02:18:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 02:18:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 02:18:37] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 02:18:37] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2025-06-06 02:18:37] [INFO ] [Nat]Added 47 Read/Feed constraints in 12 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:37] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 8 ms to minimize.
[2025-06-06 02:18:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2025-06-06 02:18:37] [INFO ] Computed and/alt/rep : 30/79/30 causal constraints (skipped 93 transitions) in 17 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:37] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:38] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:38] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 4 ms to minimize.
[2025-06-06 02:18:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 254 ms
[2025-06-06 02:18:38] [INFO ] Added : 21 causal constraints over 5 iterations in 424 ms. Result :sat
Minimization took 58 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 02:18:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-06 02:18:38] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 02:18:38] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-06 02:18:38] [INFO ] [Real]Added 47 Read/Feed constraints in 16 ms returned sat
[2025-06-06 02:18:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 02:18:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-06 02:18:38] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 02:18:38] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-06 02:18:38] [INFO ] [Nat]Added 47 Read/Feed constraints in 10 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:38] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 8 ms to minimize.
[2025-06-06 02:18:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2025-06-06 02:18:38] [INFO ] Computed and/alt/rep : 30/79/30 causal constraints (skipped 93 transitions) in 15 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:38] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 8 ms to minimize.
[2025-06-06 02:18:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2025-06-06 02:18:38] [INFO ] Added : 19 causal constraints over 4 iterations in 223 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 124/124 transitions.
Applied a total of 0 rules in 7 ms. Remains 111 /111 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 111/111 places, 124/124 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 124/124 transitions.
Applied a total of 0 rules in 7 ms. Remains 111 /111 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2025-06-06 02:18:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:18:38] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-06 02:18:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:18:38] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-06 02:18:39] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:18:39] [INFO ] Redundant transitions in 2 ms returned []
Running 123 sub problems to find dead transitions.
[2025-06-06 02:18:39] [INFO ] Invariant cache hit.
[2025-06-06 02:18:39] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 1/111 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:40] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:40] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:41] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:41] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 124/235 variables, 111/119 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 47/166 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:45] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:45] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 8 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 2/168 constraints. Problems are: Problem set: 10 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:18:46] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 3 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD55 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 1/169 constraints. Problems are: Problem set: 12 solved, 111 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/169 constraints. Problems are: Problem set: 12 solved, 111 unsolved
At refinement iteration 13 (OVERLAPS) 0/235 variables, 0/169 constraints. Problems are: Problem set: 12 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 169 constraints, problems are : Problem set: 12 solved, 111 unsolved in 14412 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 111 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 12 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 2/3 constraints. Problems are: Problem set: 12 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 12 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 7/100 variables, 3/6 constraints. Problems are: Problem set: 12 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 4/10 constraints. Problems are: Problem set: 12 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 12 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 124/224 variables, 100/110 constraints. Problems are: Problem set: 12 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 47/157 constraints. Problems are: Problem set: 12 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 8/165 constraints. Problems are: Problem set: 12 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/165 constraints. Problems are: Problem set: 12 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 11/235 variables, 11/176 constraints. Problems are: Problem set: 12 solved, 111 unsolved
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 103/279 constraints. Problems are: Problem set: 18 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 1/280 constraints. Problems are: Problem set: 18 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:19:05] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:19:06] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 2/282 constraints. Problems are: Problem set: 18 solved, 105 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/282 constraints. Problems are: Problem set: 18 solved, 105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/235 variables, and 282 constraints, problems are : Problem set: 18 solved, 105 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 111/123 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44569ms problems are : Problem set: 18 solved, 105 unsolved
Search for dead transitions found 18 dead transitions in 44576ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 111/111 places, 106/124 transitions.
Graph (complete) has 259 edges and 111 vertex of which 77 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.1 ms
Discarding 34 places :
Also discarding 0 output transitions
Reduce places removed 7 places and 21 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 70 transition count 70
Reduce places removed 9 places and 11 transitions.
Graph (complete) has 151 edges and 61 vertex of which 2 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.0 ms
Discarding 59 places :
Also discarding 59 output transitions
Drop transitions (Output transitions of discarded places.) removed 59 transitions
Iterating post reduction 1 with 10 rules applied. Total rules applied 33 place count 2 transition count 0
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 33 rules in 2 ms. Remains 2 /111 variables (removed 109) and now considering 0/106 (removed 106) transitions.
[2025-06-06 02:19:23] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:19:23] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-06 02:19:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:19:23] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2/111 places, 0/124 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 45084 ms. Remains : 2/111 places, 0/124 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 64799 ms.

BK_STOP 1749176363953

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d2m04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is SieveSingleMsgMbox-PT-d2m04, 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 r212-tall-174901994400453"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m04.tgz
mv SieveSingleMsgMbox-PT-d2m04 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;