Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r323-tall-165472293000340.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is SieveSingleMsgMbox-PT-d1m18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472293000340
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 7.0K Jun 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Jun 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 7 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 7 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Jun 6 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.4K Jun 7 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Jun 7 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Jun 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 450K Jun 6 12:11 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-d1m18-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654794502677

Running Version 0
[2022-06-09 17:08:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 17:08:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 17:08:24] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2022-06-09 17:08:24] [INFO ] Transformed 1295 places.
[2022-06-09 17:08:24] [INFO ] Transformed 749 transitions.
[2022-06-09 17:08:24] [INFO ] Parsed PT model containing 1295 places and 749 transitions in 138 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1036 places in 10 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 749 rows 259 cols
[2022-06-09 17:08:24] [INFO ] Computed 6 place invariants in 24 ms
Incomplete random walk after 10000 steps, including 2214 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 6) seen :1
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 988 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :1
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 958 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 973 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 970 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
// Phase 1: matrix 749 rows 259 cols
[2022-06-09 17:08:25] [INFO ] Computed 6 place invariants in 14 ms
[2022-06-09 17:08:25] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 17:08:25] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:08:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:25] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2022-06-09 17:08:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:08:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 17:08:25] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:08:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:25] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2022-06-09 17:08:25] [INFO ] State equation strengthened by 587 read => feed constraints.
[2022-06-09 17:08:26] [INFO ] [Nat]Added 587 Read/Feed constraints in 587 ms returned sat
[2022-06-09 17:08:26] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 4 ms to minimize.
[2022-06-09 17:08:26] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2022-06-09 17:08:26] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2022-06-09 17:08:26] [INFO ] Deduced a trap composed of 155 places in 92 ms of which 1 ms to minimize.
[2022-06-09 17:08:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 626 ms
[2022-06-09 17:08:27] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 112 ms.
[2022-06-09 17:08:27] [INFO ] Added : 66 causal constraints over 14 iterations in 797 ms. Result :sat
Minimization took 380 ms.
[2022-06-09 17:08:28] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:08:28] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2022-06-09 17:08:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:28] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2022-06-09 17:08:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:08:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 17:08:28] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:08:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:28] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2022-06-09 17:08:29] [INFO ] [Nat]Added 587 Read/Feed constraints in 511 ms returned sat
[2022-06-09 17:08:29] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 1 ms to minimize.
[2022-06-09 17:08:29] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2022-06-09 17:08:29] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 1 ms to minimize.
[2022-06-09 17:08:29] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 1 ms to minimize.
[2022-06-09 17:08:29] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 0 ms to minimize.
[2022-06-09 17:08:29] [INFO ] Deduced a trap composed of 171 places in 76 ms of which 0 ms to minimize.
[2022-06-09 17:08:29] [INFO ] Deduced a trap composed of 168 places in 77 ms of which 0 ms to minimize.
[2022-06-09 17:08:30] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 989 ms
[2022-06-09 17:08:30] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 74 ms.
[2022-06-09 17:08:30] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 0 ms to minimize.
[2022-06-09 17:08:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2022-06-09 17:08:30] [INFO ] Added : 63 causal constraints over 13 iterations in 840 ms. Result :sat
Minimization took 548 ms.
[2022-06-09 17:08:31] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 17:08:31] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:08:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:31] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2022-06-09 17:08:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:08:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 17:08:31] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:08:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:31] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2022-06-09 17:08:32] [INFO ] [Nat]Added 587 Read/Feed constraints in 510 ms returned sat
[2022-06-09 17:08:32] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 0 ms to minimize.
[2022-06-09 17:08:32] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2022-06-09 17:08:32] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 0 ms to minimize.
[2022-06-09 17:08:32] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2022-06-09 17:08:32] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 0 ms to minimize.
[2022-06-09 17:08:33] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 1 ms to minimize.
[2022-06-09 17:08:33] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 0 ms to minimize.
[2022-06-09 17:08:33] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 1 ms to minimize.
[2022-06-09 17:08:33] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 1 ms to minimize.
[2022-06-09 17:08:33] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 1 ms to minimize.
[2022-06-09 17:08:33] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 1 ms to minimize.
[2022-06-09 17:08:34] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
[2022-06-09 17:08:34] [INFO ] Deduced a trap composed of 157 places in 73 ms of which 1 ms to minimize.
[2022-06-09 17:08:34] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1876 ms
[2022-06-09 17:08:34] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 59 ms.
[2022-06-09 17:08:34] [INFO ] Added : 65 causal constraints over 13 iterations in 705 ms. Result :sat
Minimization took 401 ms.
[2022-06-09 17:08:35] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 17:08:35] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:35] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2022-06-09 17:08:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:08:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 17:08:35] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:08:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:35] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2022-06-09 17:08:35] [INFO ] [Nat]Added 587 Read/Feed constraints in 350 ms returned sat
[2022-06-09 17:08:36] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2022-06-09 17:08:36] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 0 ms to minimize.
[2022-06-09 17:08:36] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 0 ms to minimize.
[2022-06-09 17:08:36] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2022-06-09 17:08:36] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2022-06-09 17:08:36] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2022-06-09 17:08:36] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 0 ms to minimize.
[2022-06-09 17:08:37] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 1 ms to minimize.
[2022-06-09 17:08:37] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 1 ms to minimize.
[2022-06-09 17:08:37] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 6 ms to minimize.
[2022-06-09 17:08:37] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 0 ms to minimize.
[2022-06-09 17:08:37] [INFO ] Deduced a trap composed of 79 places in 83 ms of which 0 ms to minimize.
[2022-06-09 17:08:37] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 0 ms to minimize.
[2022-06-09 17:08:37] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 0 ms to minimize.
[2022-06-09 17:08:38] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 0 ms to minimize.
[2022-06-09 17:08:38] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 0 ms to minimize.
[2022-06-09 17:08:38] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 0 ms to minimize.
[2022-06-09 17:08:38] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 1 ms to minimize.
[2022-06-09 17:08:38] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 0 ms to minimize.
[2022-06-09 17:08:38] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 0 ms to minimize.
[2022-06-09 17:08:38] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 1 ms to minimize.
[2022-06-09 17:08:38] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 1 ms to minimize.
[2022-06-09 17:08:39] [INFO ] Deduced a trap composed of 99 places in 83 ms of which 0 ms to minimize.
[2022-06-09 17:08:39] [INFO ] Deduced a trap composed of 98 places in 81 ms of which 1 ms to minimize.
[2022-06-09 17:08:39] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 1 ms to minimize.
[2022-06-09 17:08:39] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 0 ms to minimize.
[2022-06-09 17:08:39] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2022-06-09 17:08:39] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 0 ms to minimize.
[2022-06-09 17:08:39] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 0 ms to minimize.
[2022-06-09 17:08:39] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 0 ms to minimize.
[2022-06-09 17:08:40] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 0 ms to minimize.
[2022-06-09 17:08:40] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 11 ms to minimize.
[2022-06-09 17:08:40] [INFO ] Deduced a trap composed of 112 places in 80 ms of which 1 ms to minimize.
[2022-06-09 17:08:40] [INFO ] Deduced a trap composed of 111 places in 87 ms of which 0 ms to minimize.
[2022-06-09 17:08:40] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 0 ms to minimize.
[2022-06-09 17:08:40] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 0 ms to minimize.
[2022-06-09 17:08:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 37500 steps, including 6106 resets, run finished after 191 ms. (steps per millisecond=196 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 65900 steps, including 13557 resets, run finished after 314 ms. (steps per millisecond=209 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 75300 steps, including 14398 resets, run finished after 334 ms. (steps per millisecond=225 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.7 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 302 place count 182 transition count 232
Iterating global reduction 1 with 59 rules applied. Total rules applied 361 place count 182 transition count 232
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 367 place count 182 transition count 226
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 409 place count 140 transition count 184
Iterating global reduction 2 with 42 rules applied. Total rules applied 451 place count 140 transition count 184
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 465 place count 140 transition count 170
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 491 place count 114 transition count 142
Iterating global reduction 3 with 26 rules applied. Total rules applied 517 place count 114 transition count 142
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 533 place count 114 transition count 126
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 538 place count 109 transition count 120
Iterating global reduction 4 with 5 rules applied. Total rules applied 543 place count 109 transition count 120
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 548 place count 104 transition count 115
Iterating global reduction 4 with 5 rules applied. Total rules applied 553 place count 104 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 555 place count 102 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 557 place count 102 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 559 place count 102 transition count 111
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 561 place count 100 transition count 109
Iterating global reduction 5 with 2 rules applied. Total rules applied 563 place count 100 transition count 109
Applied a total of 563 rules in 89 ms. Remains 100 /259 variables (removed 159) and now considering 109/749 (removed 640) transitions.
Finished structural reductions, in 1 iterations. Remains : 100/259 places, 109/749 transitions.
// Phase 1: matrix 109 rows 100 cols
[2022-06-09 17:08:43] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224440 resets, run finished after 879 ms. (steps per millisecond=1137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103421 resets, run finished after 459 ms. (steps per millisecond=2178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103537 resets, run finished after 413 ms. (steps per millisecond=2421 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103585 resets, run finished after 407 ms. (steps per millisecond=2457 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103844 resets, run finished after 408 ms. (steps per millisecond=2450 ) properties (out of 4) seen :0
// Phase 1: matrix 109 rows 100 cols
[2022-06-09 17:08:45] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 17:08:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:45] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:08:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:45] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-09 17:08:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:08:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:08:45] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:45] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2022-06-09 17:08:45] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:08:45] [INFO ] [Nat]Added 43 Read/Feed constraints in 11 ms returned sat
[2022-06-09 17:08:45] [INFO ] Computed and/alt/rep : 28/63/28 causal constraints (skipped 80 transitions) in 6 ms.
[2022-06-09 17:08:45] [INFO ] Added : 25 causal constraints over 5 iterations in 49 ms. Result :sat
Minimization took 23 ms.
[2022-06-09 17:08:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:46] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:46] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-09 17:08:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:08:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:08:46] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:46] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-09 17:08:46] [INFO ] [Nat]Added 43 Read/Feed constraints in 9 ms returned sat
[2022-06-09 17:08:46] [INFO ] Computed and/alt/rep : 28/63/28 causal constraints (skipped 80 transitions) in 6 ms.
[2022-06-09 17:08:46] [INFO ] Added : 24 causal constraints over 5 iterations in 53 ms. Result :sat
Minimization took 25 ms.
[2022-06-09 17:08:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:46] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:46] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-09 17:08:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:08:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:46] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:08:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:46] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-06-09 17:08:46] [INFO ] [Nat]Added 43 Read/Feed constraints in 7 ms returned sat
[2022-06-09 17:08:46] [INFO ] Computed and/alt/rep : 28/63/28 causal constraints (skipped 80 transitions) in 5 ms.
[2022-06-09 17:08:46] [INFO ] Added : 27 causal constraints over 6 iterations in 58 ms. Result :sat
Minimization took 23 ms.
[2022-06-09 17:08:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:08:46] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:46] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-09 17:08:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:08:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:46] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:46] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-09 17:08:46] [INFO ] [Nat]Added 43 Read/Feed constraints in 7 ms returned sat
[2022-06-09 17:08:46] [INFO ] Computed and/alt/rep : 28/63/28 causal constraints (skipped 80 transitions) in 5 ms.
[2022-06-09 17:08:46] [INFO ] Added : 24 causal constraints over 5 iterations in 55 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 20400 steps, including 3310 resets, run finished after 26 ms. (steps per millisecond=784 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 24400 steps, including 4238 resets, run finished after 27 ms. (steps per millisecond=903 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 20700 steps, including 3543 resets, run finished after 24 ms. (steps per millisecond=862 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 31900 steps, including 5546 resets, run finished after 34 ms. (steps per millisecond=938 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 109/109 transitions.
Applied a total of 0 rules in 8 ms. Remains 100 /100 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 109/109 transitions.
Starting structural reductions, iteration 0 : 100/100 places, 109/109 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 109/109 (removed 0) transitions.
// Phase 1: matrix 109 rows 100 cols
[2022-06-09 17:08:46] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 17:08:46] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 109 rows 100 cols
[2022-06-09 17:08:46] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:08:46] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:08:46] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2022-06-09 17:08:46] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 109 rows 100 cols
[2022-06-09 17:08:46] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:08:46] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 109/109 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m18-UpperBounds-00
// Phase 1: matrix 109 rows 100 cols
[2022-06-09 17:08:46] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2262 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1097 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 109 rows 100 cols
[2022-06-09 17:08:47] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:08:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:47] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:47] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-09 17:08:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:08:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:47] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:08:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:47] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-09 17:08:47] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:08:47] [INFO ] [Nat]Added 43 Read/Feed constraints in 7 ms returned sat
[2022-06-09 17:08:47] [INFO ] Computed and/alt/rep : 28/63/28 causal constraints (skipped 80 transitions) in 7 ms.
[2022-06-09 17:08:47] [INFO ] Added : 25 causal constraints over 5 iterations in 53 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [17] Max seen :[0]
Incomplete Parikh walk after 31900 steps, including 5566 resets, run finished after 37 ms. (steps per millisecond=862 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 109/109 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 97 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 97 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 97 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 95 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 95 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 93 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 93 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 91 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 91 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 89 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 89 transition count 95
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 87 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 87 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 86 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 86 transition count 92
Applied a total of 29 rules in 20 ms. Remains 86 /100 variables (removed 14) and now considering 92/109 (removed 17) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/100 places, 92/109 transitions.
// Phase 1: matrix 92 rows 86 cols
[2022-06-09 17:08:47] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 224350 resets, run finished after 686 ms. (steps per millisecond=1457 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103593 resets, run finished after 352 ms. (steps per millisecond=2840 ) properties (out of 1) seen :0
// Phase 1: matrix 92 rows 86 cols
[2022-06-09 17:08:48] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 17:08:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:48] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:08:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:48] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-09 17:08:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:08:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:48] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:48] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-06-09 17:08:48] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 17:08:48] [INFO ] [Nat]Added 35 Read/Feed constraints in 5 ms returned sat
[2022-06-09 17:08:48] [INFO ] Computed and/alt/rep : 24/52/24 causal constraints (skipped 67 transitions) in 4 ms.
[2022-06-09 17:08:48] [INFO ] Added : 24 causal constraints over 5 iterations in 42 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 25300 steps, including 4358 resets, run finished after 30 ms. (steps per millisecond=843 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 86/86 places, 92/92 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 92/92 transitions.
Starting structural reductions, iteration 0 : 86/86 places, 92/92 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 86 cols
[2022-06-09 17:08:48] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:08:48] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 92 rows 86 cols
[2022-06-09 17:08:48] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:08:48] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 17:08:48] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2022-06-09 17:08:48] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 92 rows 86 cols
[2022-06-09 17:08:48] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:08:48] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 92/92 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m18-UpperBounds-00 in 1723 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m18-UpperBounds-01
// Phase 1: matrix 109 rows 100 cols
[2022-06-09 17:08:48] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2265 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1005 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 109 rows 100 cols
[2022-06-09 17:08:48] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 17:08:48] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:08:48] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:48] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-09 17:08:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:08:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:08:48] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:48] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-06-09 17:08:48] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:08:48] [INFO ] [Nat]Added 43 Read/Feed constraints in 9 ms returned sat
[2022-06-09 17:08:48] [INFO ] Computed and/alt/rep : 28/63/28 causal constraints (skipped 80 transitions) in 6 ms.
[2022-06-09 17:08:48] [INFO ] Added : 24 causal constraints over 5 iterations in 51 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [17] Max seen :[0]
Incomplete Parikh walk after 20700 steps, including 3495 resets, run finished after 31 ms. (steps per millisecond=667 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 109/109 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 97 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 97 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 97 transition count 105
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 94 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 94 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 94 transition count 100
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 91 transition count 96
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 91 transition count 96
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 23 place count 88 transition count 93
Iterating global reduction 2 with 3 rules applied. Total rules applied 26 place count 88 transition count 93
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 85 transition count 89
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 85 transition count 89
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 82 transition count 86
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 82 transition count 86
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 80 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 80 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 79 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 79 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 78 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 78 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 77 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 77 transition count 80
Applied a total of 48 rules in 29 ms. Remains 77 /100 variables (removed 23) and now considering 80/109 (removed 29) transitions.
Finished structural reductions, in 1 iterations. Remains : 77/100 places, 80/109 transitions.
// Phase 1: matrix 80 rows 77 cols
[2022-06-09 17:08:48] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224343 resets, run finished after 683 ms. (steps per millisecond=1464 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103348 resets, run finished after 349 ms. (steps per millisecond=2865 ) properties (out of 1) seen :0
// Phase 1: matrix 80 rows 77 cols
[2022-06-09 17:08:50] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:08:50] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:50] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:50] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-06-09 17:08:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:08:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:50] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:50] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-06-09 17:08:50] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-09 17:08:50] [INFO ] [Nat]Added 31 Read/Feed constraints in 6 ms returned sat
[2022-06-09 17:08:50] [INFO ] Computed and/alt/rep : 20/44/20 causal constraints (skipped 59 transitions) in 4 ms.
[2022-06-09 17:08:50] [INFO ] Added : 20 causal constraints over 4 iterations in 43 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 18200 steps, including 2949 resets, run finished after 21 ms. (steps per millisecond=866 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 77/77 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 77/77 places, 80/80 transitions.
Starting structural reductions, iteration 0 : 77/77 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 77 cols
[2022-06-09 17:08:50] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:08:50] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 80 rows 77 cols
[2022-06-09 17:08:50] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 17:08:50] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-09 17:08:50] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2022-06-09 17:08:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 77 cols
[2022-06-09 17:08:50] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 17:08:50] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 77/77 places, 80/80 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m18-UpperBounds-01 in 1679 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m18-UpperBounds-07
// Phase 1: matrix 109 rows 100 cols
[2022-06-09 17:08:50] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2255 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1034 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 109 rows 100 cols
[2022-06-09 17:08:50] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:08:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:50] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:08:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:50] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-09 17:08:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:08:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:50] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:50] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-09 17:08:50] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:08:50] [INFO ] [Nat]Added 43 Read/Feed constraints in 9 ms returned sat
[2022-06-09 17:08:50] [INFO ] Computed and/alt/rep : 28/63/28 causal constraints (skipped 80 transitions) in 7 ms.
[2022-06-09 17:08:50] [INFO ] Added : 27 causal constraints over 6 iterations in 63 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [17] Max seen :[0]
Incomplete Parikh walk after 24400 steps, including 4208 resets, run finished after 29 ms. (steps per millisecond=841 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 109/109 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 97 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 97 transition count 106
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 95 transition count 104
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 95 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 95 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 93 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 93 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 91 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 91 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 89 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 89 transition count 95
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 87 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 87 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 85 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 85 transition count 91
Applied a total of 31 rules in 13 ms. Remains 85 /100 variables (removed 15) and now considering 91/109 (removed 18) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/100 places, 91/109 transitions.
// Phase 1: matrix 91 rows 85 cols
[2022-06-09 17:08:50] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 224428 resets, run finished after 743 ms. (steps per millisecond=1345 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103801 resets, run finished after 368 ms. (steps per millisecond=2717 ) properties (out of 1) seen :0
// Phase 1: matrix 91 rows 85 cols
[2022-06-09 17:08:51] [INFO ] Computed 4 place invariants in 5 ms
[2022-06-09 17:08:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:51] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:08:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:51] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-06-09 17:08:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:08:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:51] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:08:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:51] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-06-09 17:08:51] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 17:08:51] [INFO ] [Nat]Added 35 Read/Feed constraints in 11 ms returned sat
[2022-06-09 17:08:51] [INFO ] Computed and/alt/rep : 23/52/23 causal constraints (skipped 67 transitions) in 4 ms.
[2022-06-09 17:08:51] [INFO ] Added : 23 causal constraints over 5 iterations in 47 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [17] Max seen :[0]
Incomplete Parikh walk after 23900 steps, including 4018 resets, run finished after 27 ms. (steps per millisecond=885 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 91/91 transitions.
Starting structural reductions, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
// Phase 1: matrix 91 rows 85 cols
[2022-06-09 17:08:51] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 17:08:51] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 91 rows 85 cols
[2022-06-09 17:08:51] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 17:08:52] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 17:08:52] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2022-06-09 17:08:52] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 91 rows 85 cols
[2022-06-09 17:08:52] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 17:08:52] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 91/91 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m18-UpperBounds-07 in 1765 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m18-UpperBounds-15
// Phase 1: matrix 109 rows 100 cols
[2022-06-09 17:08:52] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2221 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1089 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 109 rows 100 cols
[2022-06-09 17:08:52] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:08:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:52] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:52] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-06-09 17:08:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:08:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:52] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:52] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-06-09 17:08:52] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:08:52] [INFO ] [Nat]Added 43 Read/Feed constraints in 8 ms returned sat
[2022-06-09 17:08:52] [INFO ] Computed and/alt/rep : 28/63/28 causal constraints (skipped 80 transitions) in 7 ms.
[2022-06-09 17:08:52] [INFO ] Added : 24 causal constraints over 5 iterations in 50 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 20400 steps, including 3286 resets, run finished after 24 ms. (steps per millisecond=850 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 109/109 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 97 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 97 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 97 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 95 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 95 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 95 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 93 transition count 98
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 93 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 91 transition count 96
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 91 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 89 transition count 94
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 89 transition count 94
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 87 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 87 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 86 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 86 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 85 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 85 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 84 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 84 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 83 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 83 transition count 87
Applied a total of 36 rules in 15 ms. Remains 83 /100 variables (removed 17) and now considering 87/109 (removed 22) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/100 places, 87/109 transitions.
// Phase 1: matrix 87 rows 83 cols
[2022-06-09 17:08:52] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224354 resets, run finished after 661 ms. (steps per millisecond=1512 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103392 resets, run finished after 344 ms. (steps per millisecond=2906 ) properties (out of 1) seen :0
// Phase 1: matrix 87 rows 83 cols
[2022-06-09 17:08:53] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:08:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:53] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 9 ms returned sat
[2022-06-09 17:08:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:53] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-09 17:08:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:08:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:53] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:53] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-09 17:08:53] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-09 17:08:53] [INFO ] [Nat]Added 33 Read/Feed constraints in 6 ms returned sat
[2022-06-09 17:08:53] [INFO ] Computed and/alt/rep : 22/49/22 causal constraints (skipped 64 transitions) in 9 ms.
[2022-06-09 17:08:53] [INFO ] Added : 22 causal constraints over 5 iterations in 51 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 13800 steps, including 2130 resets, run finished after 16 ms. (steps per millisecond=862 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 83/83 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 87/87 transitions.
Starting structural reductions, iteration 0 : 83/83 places, 87/87 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 83 cols
[2022-06-09 17:08:53] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:08:53] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 87 rows 83 cols
[2022-06-09 17:08:53] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:08:53] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-09 17:08:53] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2022-06-09 17:08:53] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 87 rows 83 cols
[2022-06-09 17:08:53] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:08:53] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 87/87 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m18-UpperBounds-15 in 1643 ms.
[2022-06-09 17:08:53] [INFO ] Flatten gal took : 37 ms
[2022-06-09 17:08:53] [INFO ] Applying decomposition
[2022-06-09 17:08:53] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11999878421537670813.txt, -o, /tmp/graph11999878421537670813.bin, -w, /tmp/graph11999878421537670813.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11999878421537670813.bin, -l, -1, -v, -w, /tmp/graph11999878421537670813.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 17:08:54] [INFO ] Decomposing Gal with order
[2022-06-09 17:08:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 17:08:54] [INFO ] Removed a total of 109 redundant transitions.
[2022-06-09 17:08:54] [INFO ] Flatten gal took : 37 ms
[2022-06-09 17:08:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 7 ms.
[2022-06-09 17:08:54] [INFO ] Time to serialize gal into /tmp/UpperBounds11411856764157835925.gal : 6 ms
[2022-06-09 17:08:54] [INFO ] Time to serialize properties into /tmp/UpperBounds14730552197459482502.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds11411856764157835925.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds14730552197459482502.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds11411856764157835925.gal -t CGAL -reachable-file /tmp/UpperBounds14730552197459482502.prop --nowitness
Loading property file /tmp/UpperBounds14730552197459482502.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,4.68969e+09,11.4945,230980,3575,937,213713,7171,353,1.05049e+06,72,120731,0
Total reachable state count : 4689691557

Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m18-UpperBounds-00 :0 <= i5.i0.u14.p31 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m18-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-d1m18-UpperBounds-00,0,12.7427,230980,1,0,213713,7171,473,1.05049e+06,90,120731,2876
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m18-UpperBounds-01 :0 <= i3.u6.l34 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-01 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-d1m18-UpperBounds-01,0,12.747,230980,1,0,213713,7171,507,1.05049e+06,95,120731,4076
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m18-UpperBounds-07 :0 <= i5.i0.u11.l122 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-07 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-d1m18-UpperBounds-07,0,12.7536,230980,1,0,213713,7171,532,1.05049e+06,95,120731,5495
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m18-UpperBounds-15 :0 <= i6.u18.p41 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-15 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-d1m18-UpperBounds-15,0,12.755,230980,1,0,213713,7171,560,1.05049e+06,97,120731,5609

BK_STOP 1654794558325

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-d1m18"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is SieveSingleMsgMbox-PT-d1m18, 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 r323-tall-165472293000340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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