Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r532-smll-171683810800101.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
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 r532-smll-171683810800101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 19:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 19:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 19:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 12 19:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 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

here is the order used to build the result vector(from text 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 1717247225342

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:07:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 13:07:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:07:08] [INFO ] Load time of PNML (sax parser for PT used): 477 ms
[2024-06-01 13:07:08] [INFO ] Transformed 2398 places.
[2024-06-01 13:07:08] [INFO ] Transformed 1954 transitions.
[2024-06-01 13:07:08] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 917 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Deduced a syphon composed of 1984 places in 32 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-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-04 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-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
[2024-06-01 13:07:08] [INFO ] Computed 6 invariants in 109 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 1]
RANDOM walk for 10000 steps (2169 resets) in 547 ms. (18 steps per ms)
BEST_FIRST walk for 30003 steps (2739 resets) in 325 ms. (92 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 1]
[2024-06-01 13:07:09] [INFO ] Invariant cache hit.
[2024-06-01 13:07:10] [INFO ] [Real]Absence check using 3 positive place invariants in 19 ms returned sat
[2024-06-01 13:07:10] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 7 ms returned sat
[2024-06-01 13:07:11] [INFO ] [Real]Absence check using state equation in 693 ms returned sat
[2024-06-01 13:07:11] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2024-06-01 13:07:12] [INFO ] [Real]Added 1674 Read/Feed constraints in 952 ms returned sat
[2024-06-01 13:07:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:07:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-06-01 13:07:12] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 13:07:13] [INFO ] [Nat]Absence check using state equation in 817 ms returned sat
[2024-06-01 13:07:14] [INFO ] [Nat]Added 1674 Read/Feed constraints in 904 ms returned sat
[2024-06-01 13:07:15] [INFO ] Deduced a trap composed of 30 places in 637 ms of which 57 ms to minimize.
[2024-06-01 13:07:15] [INFO ] Deduced a trap composed of 30 places in 501 ms of which 6 ms to minimize.
[2024-06-01 13:07:16] [INFO ] Deduced a trap composed of 118 places in 182 ms of which 4 ms to minimize.
[2024-06-01 13:07:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2060 ms
[2024-06-01 13:07:17] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 649 ms.
[2024-06-01 13:07:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 13:07:17] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-06-01 13:07:17] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2024-06-01 13:07:18] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2024-06-01 13:07:18] [INFO ] [Real]Added 1674 Read/Feed constraints in 524 ms returned sat
[2024-06-01 13:07:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:07:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-06-01 13:07:19] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 13:07:19] [INFO ] [Nat]Absence check using state equation in 621 ms returned sat
[2024-06-01 13:07:20] [INFO ] [Nat]Added 1674 Read/Feed constraints in 503 ms returned sat
[2024-06-01 13:07:20] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 263 ms.
[2024-06-01 13:07:21] [INFO ] Added : 7 causal constraints over 2 iterations in 859 ms. Result :sat
Minimization took 556 ms.
[2024-06-01 13:07:21] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2024-06-01 13:07:21] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2024-06-01 13:07:22] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2024-06-01 13:07:23] [INFO ] [Real]Added 1674 Read/Feed constraints in 880 ms returned sat
[2024-06-01 13:07:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:07:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2024-06-01 13:07:23] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 7 ms returned sat
[2024-06-01 13:07:24] [INFO ] [Nat]Absence check using state equation in 715 ms returned sat
[2024-06-01 13:07:25] [INFO ] [Nat]Added 1674 Read/Feed constraints in 1076 ms returned sat
[2024-06-01 13:07:25] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 379 ms.
[2024-06-01 13:07:26] [INFO ] Added : 5 causal constraints over 1 iterations in 1099 ms. Result :sat
Minimization took 543 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 1]
Support contains 3 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.12 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 91 places :
Symmetric choice reduction at 2 with 91 rule applications. Total rules 1170 place count 178 transition count 271
Iterating global reduction 2 with 91 rules applied. Total rules applied 1261 place count 178 transition count 271
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 1295 place count 178 transition count 237
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1334 place count 139 transition count 183
Iterating global reduction 3 with 39 rules applied. Total rules applied 1373 place count 139 transition count 183
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1397 place count 139 transition count 159
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1406 place count 130 transition count 146
Iterating global reduction 4 with 9 rules applied. Total rules applied 1415 place count 130 transition count 146
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1424 place count 121 transition count 137
Iterating global reduction 4 with 9 rules applied. Total rules applied 1433 place count 121 transition count 137
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1438 place count 116 transition count 131
Iterating global reduction 4 with 5 rules applied. Total rules applied 1443 place count 116 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1445 place count 116 transition count 129
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1450 place count 111 transition count 124
Iterating global reduction 5 with 5 rules applied. Total rules applied 1455 place count 111 transition count 124
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1458 place count 108 transition count 121
Iterating global reduction 5 with 3 rules applied. Total rules applied 1461 place count 108 transition count 121
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1462 place count 107 transition count 120
Iterating global reduction 5 with 1 rules applied. Total rules applied 1463 place count 107 transition count 120
Applied a total of 1463 rules in 265 ms. Remains 107 /414 variables (removed 307) and now considering 120/1954 (removed 1834) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 293 ms. Remains : 107/414 places, 120/1954 transitions.
// Phase 1: matrix 120 rows 107 cols
[2024-06-01 13:07:27] [INFO ] Computed 4 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[12, 1, 1]
RANDOM walk for 1000000 steps (224624 resets) in 1340 ms. (745 steps per ms)
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000002 steps (310311 resets) in 1758 ms. (1705 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[12, 1]
[2024-06-01 13:07:30] [INFO ] Invariant cache hit.
[2024-06-01 13:07:30] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 13:07:30] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 13:07:30] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-06-01 13:07:30] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 13:07:30] [INFO ] [Real]Added 45 Read/Feed constraints in 19 ms returned sat
[2024-06-01 13:07:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:07:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:07:30] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 13:07:30] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-06-01 13:07:30] [INFO ] [Nat]Added 45 Read/Feed constraints in 23 ms returned sat
[2024-06-01 13:07:31] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-06-01 13:07:31] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-06-01 13:07:31] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 3 ms to minimize.
[2024-06-01 13:07:31] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-06-01 13:07:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 374 ms
[2024-06-01 13:07:31] [INFO ] Computed and/alt/rep : 28/75/28 causal constraints (skipped 91 transitions) in 58 ms.
[2024-06-01 13:07:31] [INFO ] Added : 16 causal constraints over 4 iterations in 164 ms. Result :sat
Minimization took 104 ms.
[2024-06-01 13:07:31] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 13:07:31] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 13:07:31] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2024-06-01 13:07:31] [INFO ] [Real]Added 45 Read/Feed constraints in 16 ms returned sat
[2024-06-01 13:07:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:07:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:07:31] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 13:07:31] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-06-01 13:07:32] [INFO ] [Nat]Added 45 Read/Feed constraints in 18 ms returned sat
[2024-06-01 13:07:32] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 4 ms to minimize.
[2024-06-01 13:07:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2024-06-01 13:07:32] [INFO ] Computed and/alt/rep : 28/75/28 causal constraints (skipped 91 transitions) in 34 ms.
[2024-06-01 13:07:32] [INFO ] Added : 15 causal constraints over 5 iterations in 145 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[12, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[12, 1]
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 120/120 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 106 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 106 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 106 transition count 118
Applied a total of 3 rules in 24 ms. Remains 106 /107 variables (removed 1) and now considering 118/120 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 106/107 places, 118/120 transitions.
// Phase 1: matrix 118 rows 106 cols
[2024-06-01 13:07:32] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[12, 1]
RANDOM walk for 1000000 steps (224049 resets) in 1168 ms. (855 steps per ms)
BEST_FIRST walk for 2000000 steps (206669 resets) in 1286 ms. (1554 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[12, 1]
[2024-06-01 13:07:34] [INFO ] Invariant cache hit.
[2024-06-01 13:07:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 13:07:35] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:07:35] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-06-01 13:07:35] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 13:07:35] [INFO ] [Real]Added 44 Read/Feed constraints in 15 ms returned sat
[2024-06-01 13:07:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:07:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:07:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:07:35] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-06-01 13:07:35] [INFO ] [Nat]Added 44 Read/Feed constraints in 20 ms returned sat
[2024-06-01 13:07:35] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-06-01 13:07:35] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:07:35] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 2 ms to minimize.
[2024-06-01 13:07:35] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 2 ms to minimize.
[2024-06-01 13:07:35] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 2 ms to minimize.
[2024-06-01 13:07:35] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 3 ms to minimize.
[2024-06-01 13:07:36] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 2 ms to minimize.
[2024-06-01 13:07:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 794 ms
[2024-06-01 13:07:36] [INFO ] Computed and/alt/rep : 28/74/28 causal constraints (skipped 89 transitions) in 17 ms.
[2024-06-01 13:07:36] [INFO ] Added : 15 causal constraints over 3 iterations in 100 ms. Result :sat
Minimization took 106 ms.
[2024-06-01 13:07:36] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 13:07:36] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:07:36] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-06-01 13:07:36] [INFO ] [Real]Added 44 Read/Feed constraints in 19 ms returned sat
[2024-06-01 13:07:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:07:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 13:07:36] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:07:36] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-06-01 13:07:36] [INFO ] [Nat]Added 44 Read/Feed constraints in 14 ms returned sat
[2024-06-01 13:07:36] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-06-01 13:07:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2024-06-01 13:07:36] [INFO ] Computed and/alt/rep : 28/74/28 causal constraints (skipped 89 transitions) in 12 ms.
[2024-06-01 13:07:36] [INFO ] Added : 15 causal constraints over 5 iterations in 90 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[12, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[12, 1]
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 118/118 transitions.
Applied a total of 0 rules in 15 ms. Remains 106 /106 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 106/106 places, 118/118 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 118/118 transitions.
Applied a total of 0 rules in 13 ms. Remains 106 /106 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-06-01 13:07:36] [INFO ] Invariant cache hit.
[2024-06-01 13:07:37] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-06-01 13:07:37] [INFO ] Invariant cache hit.
[2024-06-01 13:07:37] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 13:07:37] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
[2024-06-01 13:07:37] [INFO ] Redundant transitions in 5 ms returned []
Running 117 sub problems to find dead transitions.
[2024-06-01 13:07:37] [INFO ] Invariant cache hit.
[2024-06-01 13:07:37] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-01 13:07:40] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 2 ms to minimize.
[2024-06-01 13:07:40] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 118/224 variables, 106/112 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 44/156 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-01 13:07:41] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD108 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 1/157 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/157 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 0/224 variables, 0/157 constraints. Problems are: Problem set: 3 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 157 constraints, problems are : Problem set: 3 solved, 114 unsolved in 8379 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 4/106 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 2/5 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 2/7 constraints. Problems are: Problem set: 3 solved, 114 unsolved
[2024-06-01 13:07:47] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 1/8 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 118/224 variables, 106/114 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 44/158 constraints. Problems are: Problem set: 3 solved, 114 unsolved
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 114/272 constraints. Problems are: Problem set: 15 solved, 102 unsolved
[2024-06-01 13:07:51] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:07:51] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:07:51] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 3/275 constraints. Problems are: Problem set: 15 solved, 102 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 0/275 constraints. Problems are: Problem set: 15 solved, 102 unsolved
At refinement iteration 13 (OVERLAPS) 0/224 variables, 0/275 constraints. Problems are: Problem set: 15 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 275 constraints, problems are : Problem set: 15 solved, 102 unsolved in 14981 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 114/117 constraints, Known Traps: 7/7 constraints]
After SMT, in 23842ms problems are : Problem set: 15 solved, 102 unsolved
Search for dead transitions found 15 dead transitions in 23862ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 106/106 places, 103/118 transitions.
Graph (complete) has 254 edges and 106 vertex of which 78 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.0 ms
Discarding 28 places :
Also discarding 0 output transitions
Reduce places removed 5 places and 15 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 73 transition count 76
Reduce places removed 10 places and 12 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 28 place count 63 transition count 64
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 62 transition count 63
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 62 transition count 63
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 61 transition count 62
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 61 transition count 62
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 60 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 60 transition count 61
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 59 transition count 60
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 59 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 38 place count 59 transition count 58
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 38 rules in 16 ms. Remains 59 /106 variables (removed 47) and now considering 58/103 (removed 45) transitions.
// Phase 1: matrix 58 rows 59 cols
[2024-06-01 13:08:01] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:08:01] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 13:08:01] [INFO ] Invariant cache hit.
[2024-06-01 13:08:01] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 13:08:01] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 59/106 places, 58/118 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 24796 ms. Remains : 59/106 places, 58/118 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 58 rows 58 cols
[2024-06-01 13:08:01] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[12, 1]
RANDOM walk for 1000000 steps (224094 resets) in 856 ms. (1166 steps per ms)
BEST_FIRST walk for 1000001 steps (103300 resets) in 390 ms. (2557 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[12, 1]
[2024-06-01 13:08:03] [INFO ] Invariant cache hit.
[2024-06-01 13:08:03] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 13:08:03] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 13:08:03] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-06-01 13:08:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 13:08:03] [INFO ] [Real]Added 20 Read/Feed constraints in 6 ms returned sat
[2024-06-01 13:08:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:08:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 13:08:03] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 13:08:03] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-06-01 13:08:03] [INFO ] [Nat]Added 20 Read/Feed constraints in 7 ms returned sat
[2024-06-01 13:08:03] [INFO ] Computed and/alt/rep : 15/26/15 causal constraints (skipped 42 transitions) in 9 ms.
[2024-06-01 13:08:03] [INFO ] Added : 6 causal constraints over 2 iterations in 37 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[12, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[12, 1]
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 58/58 transitions.
Applied a total of 0 rules in 6 ms. Remains 58 /58 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 58/58 places, 58/58 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 58/58 transitions.
Applied a total of 0 rules in 5 ms. Remains 58 /58 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2024-06-01 13:08:03] [INFO ] Invariant cache hit.
[2024-06-01 13:08:03] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-01 13:08:03] [INFO ] Invariant cache hit.
[2024-06-01 13:08:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 13:08:03] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-06-01 13:08:03] [INFO ] Redundant transitions in 2 ms returned []
Running 57 sub problems to find dead transitions.
[2024-06-01 13:08:03] [INFO ] Invariant cache hit.
[2024-06-01 13:08:03] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD56 is UNSAT
At refinement iteration 4 (OVERLAPS) 58/116 variables, 58/61 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 20/81 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/81 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/81 constraints. Problems are: Problem set: 3 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 81 constraints, problems are : Problem set: 3 solved, 54 unsolved in 1867 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 2/57 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 58/115 variables, 57/60 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 20/80 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 7/87 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/87 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 1/116 variables, 1/88 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 47/135 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/116 variables, 0/135 constraints. Problems are: Problem set: 3 solved, 54 unsolved
At refinement iteration 13 (OVERLAPS) 0/116 variables, 0/135 constraints. Problems are: Problem set: 3 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 135 constraints, problems are : Problem set: 3 solved, 54 unsolved in 3558 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 54/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 5531ms problems are : Problem set: 3 solved, 54 unsolved
Search for dead transitions found 3 dead transitions in 5534ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 58/58 places, 55/58 transitions.
Graph (complete) has 142 edges and 58 vertex of which 55 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 2 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 133 edges and 54 vertex of which 52 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 52 transition count 52
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 50 transition count 49
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 48 transition count 47
Reduce places removed 3 places and 3 transitions.
Graph (complete) has 107 edges and 45 vertex of which 43 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 4 rules applied. Total rules applied 13 place count 43 transition count 44
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 15 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 16 place count 41 transition count 41
Iterating global reduction 5 with 1 rules applied. Total rules applied 17 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 18 place count 40 transition count 40
Iterating global reduction 5 with 1 rules applied. Total rules applied 19 place count 40 transition count 40
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 20 place count 39 transition count 39
Iterating global reduction 5 with 1 rules applied. Total rules applied 21 place count 39 transition count 39
Applied a total of 21 rules in 20 ms. Remains 39 /58 variables (removed 19) and now considering 39/55 (removed 16) transitions.
// Phase 1: matrix 39 rows 39 cols
[2024-06-01 13:08:09] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:08:09] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 13:08:09] [INFO ] Invariant cache hit.
[2024-06-01 13:08:09] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 13:08:09] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 39/58 places, 39/58 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6090 ms. Remains : 39/58 places, 39/58 transitions.
[2024-06-01 13:08:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[12, 1]
RANDOM walk for 1000000 steps (223982 resets) in 903 ms. (1106 steps per ms)
BEST_FIRST walk for 1000000 steps (103768 resets) in 334 ms. (2985 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[12, 1]
[2024-06-01 13:08:10] [INFO ] Invariant cache hit.
[2024-06-01 13:08:10] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 13:08:10] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-06-01 13:08:10] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 13:08:10] [INFO ] [Real]Added 14 Read/Feed constraints in 3 ms returned sat
[2024-06-01 13:08:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:08:10] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 13:08:10] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 13:08:10] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2024-06-01 13:08:10] [INFO ] Computed and/alt/rep : 9/13/9 causal constraints (skipped 29 transitions) in 3 ms.
[2024-06-01 13:08:10] [INFO ] Added : 6 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[12, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[12, 1]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 39/39 places, 39/39 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2024-06-01 13:08:10] [INFO ] Invariant cache hit.
[2024-06-01 13:08:10] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 13:08:10] [INFO ] Invariant cache hit.
[2024-06-01 13:08:10] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 13:08:10] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-06-01 13:08:10] [INFO ] Redundant transitions in 0 ms returned []
Running 38 sub problems to find dead transitions.
[2024-06-01 13:08:10] [INFO ] Invariant cache hit.
[2024-06-01 13:08:10] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 39/78 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 54 constraints, problems are : Problem set: 0 solved, 38 unsolved in 958 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 39/78 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 38/92 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 92 constraints, problems are : Problem set: 0 solved, 38 unsolved in 967 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
After SMT, in 1963ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1965ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2117 ms. Remains : 39/39 places, 39/39 transitions.
RANDOM walk for 40000 steps (8927 resets) in 916 ms. (43 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4109 resets) in 435 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4109 resets) in 276 ms. (144 steps per ms) remains 2/2 properties
Probably explored full state space saw : 407 states, properties seen :1
Probabilistic random walk after 950 steps, saw 407 distinct states, run finished after 31 ms. (steps per millisecond=30 ) properties seen :1
Explored full state space saw : 407 states, properties seen :0
Exhaustive walk after 950 steps, saw 407 distinct states, run finished after 4 ms. (steps per millisecond=237 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[12, 1]
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m04-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[12]
[2024-06-01 13:08:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[12]
RANDOM walk for 10000 steps (2230 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10000 steps (1002 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[12]
[2024-06-01 13:08:13] [INFO ] Invariant cache hit.
[2024-06-01 13:08:13] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 13:08:13] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 13:08:13] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 13:08:13] [INFO ] [Real]Added 14 Read/Feed constraints in 3 ms returned sat
[2024-06-01 13:08:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:08:13] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 13:08:13] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-06-01 13:08:13] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2024-06-01 13:08:13] [INFO ] Computed and/alt/rep : 9/13/9 causal constraints (skipped 29 transitions) in 5 ms.
[2024-06-01 13:08:13] [INFO ] Added : 6 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[12]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 39/39 places, 39/39 transitions.
[2024-06-01 13:08:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[12]
RANDOM walk for 1000000 steps (224190 resets) in 999 ms. (1000 steps per ms)
BEST_FIRST walk for 1000000 steps (104021 resets) in 310 ms. (3215 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[12]
[2024-06-01 13:08:15] [INFO ] Invariant cache hit.
[2024-06-01 13:08:15] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 13:08:15] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[1]
FORMULA SieveSingleMsgMbox-PT-d2m04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m04-UpperBounds-14 in 1565 ms.
[2024-06-01 13:08:15] [INFO ] Flatten gal took : 54 ms
Total runtime 67639 ms.
ITS solved all properties within timeout

BK_STOP 1717247295428

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
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 r532-smll-171683810800101"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;