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.r395-smll-171683823900066.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 gold2023
Input is SieveSingleMsgMbox-PT-d2m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-smll-171683823900066
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 19:29 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-d2m06-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716934552100

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m06
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-28 22:15:54] [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]
[2024-05-28 22:15:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 22:15:54] [INFO ] Load time of PNML (sax parser for PT used): 310 ms
[2024-05-28 22:15:54] [INFO ] Transformed 2398 places.
[2024-05-28 22:15:54] [INFO ] Transformed 1954 transitions.
[2024-05-28 22:15:54] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 421 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 1984 places in 26 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1954 rows 414 cols
[2024-05-28 22:15:55] [INFO ] Computed 6 invariants in 90 ms
Incomplete random walk after 10000 steps, including 2212 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 943 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 875 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
[2024-05-28 22:15:55] [INFO ] Invariant cache hit.
[2024-05-28 22:15:56] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2024-05-28 22:15:56] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 22:15:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 22:15:56] [INFO ] [Real]Absence check using state equation in 713 ms returned sat
[2024-05-28 22:15:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:15:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 28 ms returned sat
[2024-05-28 22:15:57] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 23 ms returned sat
[2024-05-28 22:15:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 22:15:58] [INFO ] [Nat]Absence check using state equation in 1183 ms returned sat
[2024-05-28 22:15:58] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2024-05-28 22:15:59] [INFO ] [Nat]Added 1674 Read/Feed constraints in 650 ms returned sat
[2024-05-28 22:15:59] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 410 ms.
[2024-05-28 22:16:00] [INFO ] Added : 12 causal constraints over 3 iterations in 1064 ms. Result :sat
Minimization took 815 ms.
[2024-05-28 22:16:01] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-28 22:16:01] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 22:16:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 22:16:01] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2024-05-28 22:16:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:16:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-28 22:16:01] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-28 22:16:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 22:16:02] [INFO ] [Nat]Absence check using state equation in 579 ms returned sat
[2024-05-28 22:16:02] [INFO ] [Nat]Added 1674 Read/Feed constraints in 481 ms returned sat
[2024-05-28 22:16:03] [INFO ] Deduced a trap composed of 45 places in 401 ms of which 7 ms to minimize.
[2024-05-28 22:16:03] [INFO ] Deduced a trap composed of 44 places in 384 ms of which 1 ms to minimize.
[2024-05-28 22:16:04] [INFO ] Deduced a trap composed of 151 places in 343 ms of which 2 ms to minimize.
[2024-05-28 22:16:04] [INFO ] Deduced a trap composed of 165 places in 345 ms of which 2 ms to minimize.
[2024-05-28 22:16:05] [INFO ] Deduced a trap composed of 170 places in 342 ms of which 1 ms to minimize.
[2024-05-28 22:16:05] [INFO ] Deduced a trap composed of 171 places in 319 ms of which 1 ms to minimize.
[2024-05-28 22:16:06] [INFO ] Deduced a trap composed of 224 places in 304 ms of which 0 ms to minimize.
[2024-05-28 22:16:06] [INFO ] Deduced a trap composed of 103 places in 315 ms of which 2 ms to minimize.
[2024-05-28 22:16:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-28 22:16:07] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-28 22:16:07] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 22:16:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 22:16:07] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2024-05-28 22:16:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:16:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-28 22:16:07] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 22:16:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 22:16:08] [INFO ] [Nat]Absence check using state equation in 713 ms returned sat
[2024-05-28 22:16:09] [INFO ] [Nat]Added 1674 Read/Feed constraints in 846 ms returned sat
[2024-05-28 22:16:09] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 220 ms.
[2024-05-28 22:16:10] [INFO ] Deduced a trap composed of 30 places in 364 ms of which 1 ms to minimize.
[2024-05-28 22:16:11] [INFO ] Deduced a trap composed of 38 places in 364 ms of which 0 ms to minimize.
[2024-05-28 22:16:11] [INFO ] Deduced a trap composed of 38 places in 373 ms of which 1 ms to minimize.
[2024-05-28 22:16:12] [INFO ] Deduced a trap composed of 38 places in 323 ms of which 1 ms to minimize.
[2024-05-28 22:16:12] [INFO ] Deduced a trap composed of 38 places in 329 ms of which 1 ms to minimize.
[2024-05-28 22:16:12] [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 2
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [42, 1, 42] Max seen :[0, 0, 0]
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.8 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions 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 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 1169 place count 179 transition count 272
Iterating global reduction 2 with 90 rules applied. Total rules applied 1259 place count 179 transition count 272
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 1293 place count 179 transition count 238
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1330 place count 142 transition count 188
Iterating global reduction 3 with 37 rules applied. Total rules applied 1367 place count 142 transition count 188
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 1389 place count 142 transition count 166
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1397 place count 134 transition count 154
Iterating global reduction 4 with 8 rules applied. Total rules applied 1405 place count 134 transition count 154
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1413 place count 126 transition count 146
Iterating global reduction 4 with 8 rules applied. Total rules applied 1421 place count 126 transition count 146
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1425 place count 122 transition count 141
Iterating global reduction 4 with 4 rules applied. Total rules applied 1429 place count 122 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1430 place count 122 transition count 140
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1434 place count 118 transition count 136
Iterating global reduction 5 with 4 rules applied. Total rules applied 1438 place count 118 transition count 136
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1441 place count 115 transition count 133
Iterating global reduction 5 with 3 rules applied. Total rules applied 1444 place count 115 transition count 133
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1445 place count 114 transition count 132
Iterating global reduction 5 with 1 rules applied. Total rules applied 1446 place count 114 transition count 132
Applied a total of 1446 rules in 166 ms. Remains 114 /414 variables (removed 300) and now considering 132/1954 (removed 1822) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 114/414 places, 132/1954 transitions.
// Phase 1: matrix 132 rows 114 cols
[2024-05-28 22:16:13] [INFO ] Computed 4 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 224240 resets, run finished after 1228 ms. (steps per millisecond=814 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103252 resets, run finished after 640 ms. (steps per millisecond=1562 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103625 resets, run finished after 569 ms. (steps per millisecond=1757 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103404 resets, run finished after 573 ms. (steps per millisecond=1745 ) properties (out of 3) seen :0
[2024-05-28 22:16:16] [INFO ] Invariant cache hit.
[2024-05-28 22:16:16] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-28 22:16:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 22:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 22:16:16] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-28 22:16:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:16:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 22:16:16] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 22:16:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 22:16:16] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-28 22:16:16] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 22:16:16] [INFO ] [Nat]Added 49 Read/Feed constraints in 19 ms returned sat
[2024-05-28 22:16:16] [INFO ] Computed and/alt/rep : 31/86/31 causal constraints (skipped 100 transitions) in 11 ms.
[2024-05-28 22:16:16] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2024-05-28 22:16:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-05-28 22:16:16] [INFO ] Added : 15 causal constraints over 4 iterations in 162 ms. Result :sat
Minimization took 49 ms.
[2024-05-28 22:16:16] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:16:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 22:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 22:16:16] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-28 22:16:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:16:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:16:16] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 22:16:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 22:16:16] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-28 22:16:16] [INFO ] [Nat]Added 49 Read/Feed constraints in 10 ms returned sat
[2024-05-28 22:16:16] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-28 22:16:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-28 22:16:16] [INFO ] Computed and/alt/rep : 31/86/31 causal constraints (skipped 100 transitions) in 8 ms.
[2024-05-28 22:16:16] [INFO ] Added : 12 causal constraints over 4 iterations in 66 ms. Result :sat
Minimization took 31 ms.
[2024-05-28 22:16:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:16:17] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 22:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 22:16:17] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-28 22:16:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:16:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:16:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 22:16:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 22:16:17] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-28 22:16:17] [INFO ] [Nat]Added 49 Read/Feed constraints in 19 ms returned sat
[2024-05-28 22:16:17] [INFO ] Computed and/alt/rep : 31/86/31 causal constraints (skipped 100 transitions) in 10 ms.
[2024-05-28 22:16:17] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2024-05-28 22:16:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-28 22:16:17] [INFO ] Added : 17 causal constraints over 5 iterations in 168 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [42, 1, 42] Max seen :[0, 0, 0]
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 132/132 transitions.
Applied a total of 0 rules in 12 ms. Remains 114 /114 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 114/114 places, 132/132 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 132/132 transitions.
Applied a total of 0 rules in 12 ms. Remains 114 /114 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-05-28 22:16:17] [INFO ] Invariant cache hit.
[2024-05-28 22:16:17] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-28 22:16:17] [INFO ] Invariant cache hit.
[2024-05-28 22:16:17] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 22:16:17] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
[2024-05-28 22:16:17] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-28 22:16:17] [INFO ] Invariant cache hit.
[2024-05-28 22:16:18] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 567 ms. Remains : 114/114 places, 132/132 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-00
[2024-05-28 22:16:18] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2239 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1033 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2024-05-28 22:16:18] [INFO ] Invariant cache hit.
[2024-05-28 22:16:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:16:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 22:16:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 22:16:18] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-28 22:16:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:16:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:16:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 22:16:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 22:16:18] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-28 22:16:18] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 22:16:18] [INFO ] [Nat]Added 49 Read/Feed constraints in 19 ms returned sat
[2024-05-28 22:16:18] [INFO ] Computed and/alt/rep : 31/86/31 causal constraints (skipped 100 transitions) in 10 ms.
[2024-05-28 22:16:18] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2024-05-28 22:16:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-05-28 22:16:18] [INFO ] Added : 15 causal constraints over 4 iterations in 159 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 132/132 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 112 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 112 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 112 transition count 128
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 110 transition count 124
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 110 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 110 transition count 123
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 108 transition count 121
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 108 transition count 121
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 106 transition count 119
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 106 transition count 119
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 104 transition count 117
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 104 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 104 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 26 place count 102 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 102 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 101 transition count 111
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 101 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 100 transition count 110
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 100 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 99 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 99 transition count 109
Applied a total of 34 rules in 56 ms. Remains 99 /114 variables (removed 15) and now considering 109/132 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 99/114 places, 109/132 transitions.
// Phase 1: matrix 109 rows 99 cols
[2024-05-28 22:16:18] [INFO ] Computed 4 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224765 resets, run finished after 1030 ms. (steps per millisecond=970 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103525 resets, run finished after 537 ms. (steps per millisecond=1862 ) properties (out of 1) seen :0
[2024-05-28 22:16:20] [INFO ] Invariant cache hit.
[2024-05-28 22:16:20] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:16:20] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 22:16:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 22:16:20] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-28 22:16:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:16:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 22:16:20] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 22:16:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 22:16:20] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-28 22:16:20] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-28 22:16:20] [INFO ] [Nat]Added 40 Read/Feed constraints in 10 ms returned sat
[2024-05-28 22:16:20] [INFO ] Computed and/alt/rep : 26/68/26 causal constraints (skipped 82 transitions) in 8 ms.
[2024-05-28 22:16:20] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 22:16:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-28 22:16:20] [INFO ] Added : 16 causal constraints over 4 iterations in 133 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 109/109 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 99/99 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 109/109 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-28 22:16:20] [INFO ] Invariant cache hit.
[2024-05-28 22:16:20] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-28 22:16:20] [INFO ] Invariant cache hit.
[2024-05-28 22:16:20] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-28 22:16:20] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-05-28 22:16:20] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-28 22:16:20] [INFO ] Invariant cache hit.
[2024-05-28 22:16:21] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 436 ms. Remains : 99/99 places, 109/109 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-00 in 2943 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-03
// Phase 1: matrix 132 rows 114 cols
[2024-05-28 22:16:21] [INFO ] Computed 4 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2261 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1027 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2024-05-28 22:16:21] [INFO ] Invariant cache hit.
[2024-05-28 22:16:21] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:16:21] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 22:16:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 22:16:21] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-28 22:16:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:16:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 22:16:21] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 22:16:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 22:16:21] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-28 22:16:21] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 22:16:21] [INFO ] [Nat]Added 49 Read/Feed constraints in 10 ms returned sat
[2024-05-28 22:16:21] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-28 22:16:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-28 22:16:21] [INFO ] Computed and/alt/rep : 31/86/31 causal constraints (skipped 100 transitions) in 9 ms.
[2024-05-28 22:16:21] [INFO ] Added : 12 causal constraints over 4 iterations in 66 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[0]
Support contains 1 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 132/132 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 112 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 112 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 112 transition count 129
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 110 transition count 125
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 110 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 110 transition count 123
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 109 transition count 122
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 109 transition count 122
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 108 transition count 121
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 108 transition count 121
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 107 transition count 120
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 107 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 107 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 106 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 106 transition count 118
Applied a total of 20 rules in 46 ms. Remains 106 /114 variables (removed 8) and now considering 118/132 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 106/114 places, 118/132 transitions.
// Phase 1: matrix 118 rows 106 cols
[2024-05-28 22:16:21] [INFO ] Computed 4 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224365 resets, run finished after 1061 ms. (steps per millisecond=942 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103267 resets, run finished after 522 ms. (steps per millisecond=1915 ) properties (out of 1) seen :0
[2024-05-28 22:16:23] [INFO ] Invariant cache hit.
[2024-05-28 22:16:23] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:16:23] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 22:16:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 22:16:23] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-28 22:16:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:16:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:16:23] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 22:16:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 22:16:23] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-28 22:16:23] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 22:16:23] [INFO ] [Nat]Added 44 Read/Feed constraints in 8 ms returned sat
[2024-05-28 22:16:23] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-28 22:16:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-28 22:16:23] [INFO ] Computed and/alt/rep : 28/74/28 causal constraints (skipped 89 transitions) in 8 ms.
[2024-05-28 22:16:23] [INFO ] Added : 16 causal constraints over 4 iterations in 58 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[0]
Support contains 1 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 5 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 6 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 5 ms. Remains 106 /106 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-05-28 22:16:23] [INFO ] Invariant cache hit.
[2024-05-28 22:16:23] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-28 22:16:23] [INFO ] Invariant cache hit.
[2024-05-28 22:16:23] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 22:16:23] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2024-05-28 22:16:23] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-28 22:16:23] [INFO ] Invariant cache hit.
[2024-05-28 22:16:23] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 485 ms. Remains : 106/106 places, 118/118 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-03 in 2867 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-14
// Phase 1: matrix 132 rows 114 cols
[2024-05-28 22:16:23] [INFO ] Computed 4 invariants in 1 ms
Incomplete random walk after 10000 steps, including 2220 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1045 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2024-05-28 22:16:23] [INFO ] Invariant cache hit.
[2024-05-28 22:16:23] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:16:23] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 22:16:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 22:16:24] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-28 22:16:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:16:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 22:16:24] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 22:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 22:16:24] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-28 22:16:24] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 22:16:24] [INFO ] [Nat]Added 49 Read/Feed constraints in 25 ms returned sat
[2024-05-28 22:16:24] [INFO ] Computed and/alt/rep : 31/86/31 causal constraints (skipped 100 transitions) in 10 ms.
[2024-05-28 22:16:24] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2024-05-28 22:16:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-28 22:16:24] [INFO ] Added : 17 causal constraints over 5 iterations in 168 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 132/132 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 112 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 112 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 112 transition count 129
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 110 transition count 125
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 110 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 110 transition count 124
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 109 transition count 123
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 109 transition count 123
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 108 transition count 122
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 108 transition count 122
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 107 transition count 121
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 107 transition count 121
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 106 transition count 120
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 106 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 105 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 105 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 104 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 104 transition count 116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 103 transition count 115
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 103 transition count 115
Applied a total of 24 rules in 28 ms. Remains 103 /114 variables (removed 11) and now considering 115/132 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 103/114 places, 115/132 transitions.
// Phase 1: matrix 115 rows 103 cols
[2024-05-28 22:16:24] [INFO ] Computed 4 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 224593 resets, run finished after 996 ms. (steps per millisecond=1004 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103539 resets, run finished after 510 ms. (steps per millisecond=1960 ) properties (out of 1) seen :0
[2024-05-28 22:16:25] [INFO ] Invariant cache hit.
[2024-05-28 22:16:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 22:16:25] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 22:16:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 22:16:25] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-28 22:16:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 22:16:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 22:16:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 22:16:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 22:16:26] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-28 22:16:26] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 22:16:26] [INFO ] [Nat]Added 43 Read/Feed constraints in 19 ms returned sat
[2024-05-28 22:16:26] [INFO ] Computed and/alt/rep : 27/74/27 causal constraints (skipped 87 transitions) in 10 ms.
[2024-05-28 22:16:26] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-28 22:16:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-05-28 22:16:26] [INFO ] Added : 15 causal constraints over 3 iterations in 144 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 115/115 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 103/103 places, 115/115 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 115/115 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2024-05-28 22:16:26] [INFO ] Invariant cache hit.
[2024-05-28 22:16:26] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-28 22:16:26] [INFO ] Invariant cache hit.
[2024-05-28 22:16:26] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 22:16:26] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2024-05-28 22:16:26] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-28 22:16:26] [INFO ] Invariant cache hit.
[2024-05-28 22:16:26] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 622 ms. Remains : 103/103 places, 115/115 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-14 in 3043 ms.
[2024-05-28 22:16:27] [INFO ] Flatten gal took : 84 ms
[2024-05-28 22:16:27] [INFO ] Applying decomposition
[2024-05-28 22:16:27] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9032577401664158782.txt' '-o' '/tmp/graph9032577401664158782.bin' '-w' '/tmp/graph9032577401664158782.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9032577401664158782.bin' '-l' '-1' '-v' '-w' '/tmp/graph9032577401664158782.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:16:27] [INFO ] Decomposing Gal with order
[2024-05-28 22:16:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:16:27] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-28 22:16:27] [INFO ] Flatten gal took : 96 ms
[2024-05-28 22:16:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 24 ms.
[2024-05-28 22:16:27] [INFO ] Time to serialize gal into /tmp/UpperBounds11180289667796882130.gal : 18 ms
[2024-05-28 22:16:27] [INFO ] Time to serialize properties into /tmp/UpperBounds6957709983883984286.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11180289667796882130.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6957709983883984286.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds6957709983883984286.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,120031,0.654642,16328,925,596,20160,7387,388,42182,132,26349,0
Total reachable state count : 120031

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d2m06-UpperBounds-00 :0 <= i9.u9.p138 <= 1
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d2m06-UpperBounds-00,0,0.698136,16328,1,0,20160,7387,508,42182,161,26349,880
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property SieveSingleMsgMbox-PT-d2m06-UpperBounds-03 :0 <= i3.u10.l163 <= 0
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-03 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d2m06-UpperBounds-03,0,0.701665,16328,1,0,20160,7387,540,42182,169,26349,950
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d2m06-UpperBounds-14 :0 <= i2.u0.p110 <= 1
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d2m06-UpperBounds-14,0,0.705226,16328,1,0,20160,7387,562,42182,188,26349,1219
Total runtime 34219 ms.

BK_STOP 1716934589626

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-d2m06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is SieveSingleMsgMbox-PT-d2m06, 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 r395-smll-171683823900066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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