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-165472293000367.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-d2m96, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472293000367
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 7.6K Jun 7 17:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Jun 7 17:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K Jun 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 12K Jun 7 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 7 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 17:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Jun 7 17:04 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 1.1M 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-d2m96-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654796181961

Running Version 0
[2022-06-09 17:36:23] [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:36:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 17:36:23] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2022-06-09 17:36:23] [INFO ] Transformed 2398 places.
[2022-06-09 17:36:23] [INFO ] Transformed 1954 transitions.
[2022-06-09 17:36:23] [INFO ] Parsed PT model containing 2398 places and 1954 transitions in 208 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1984 places in 17 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1954 rows 414 cols
[2022-06-09 17:36:23] [INFO ] Computed 6 place invariants in 67 ms
Incomplete random walk after 10000 steps, including 2228 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 930 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 971 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 929 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
// Phase 1: matrix 1954 rows 414 cols
[2022-06-09 17:36:24] [INFO ] Computed 6 place invariants in 35 ms
[2022-06-09 17:36:24] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2022-06-09 17:36:24] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-09 17:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:36:25] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2022-06-09 17:36:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:36:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2022-06-09 17:36:25] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2022-06-09 17:36:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:36:25] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2022-06-09 17:36:25] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2022-06-09 17:36:29] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 17:36:29] [INFO ] [Nat]Added 1674 Read/Feed constraints in 3742 ms returned sat
[2022-06-09 17:36:29] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 4 ms to minimize.
[2022-06-09 17:36:30] [INFO ] Deduced a trap composed of 30 places in 234 ms of which 1 ms to minimize.
[2022-06-09 17:36:30] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 1 ms to minimize.
[2022-06-09 17:36:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2022-06-09 17:36:30] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 17:36:30] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-09 17:36:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:36:30] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2022-06-09 17:36:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:36:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 17:36:30] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:36:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:36:31] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2022-06-09 17:36:34] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 17:36:35] [INFO ] [Nat]Added 1674 Read/Feed constraints in 4305 ms returned sat
[2022-06-09 17:36:35] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 1 ms to minimize.
[2022-06-09 17:36:36] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 1 ms to minimize.
[2022-06-09 17:36:36] [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: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)
[2022-06-09 17:36:36] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 17:36:36] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-09 17:36:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:36:36] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2022-06-09 17:36:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:36:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 17:36:36] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:36:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:36:36] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2022-06-09 17:36:40] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 17:36:41] [INFO ] [Nat]Added 1674 Read/Feed constraints in 4592 ms returned unknown
Current structural bounds on expressions (after SMT) : [42, 42, 12] Max seen :[0, 0, 0]
Support contains 3 out of 414 places. Attempting structural reductions.
Starting structural reductions, 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.29 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 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 949 place count 270 transition count 389
Iterating global reduction 1 with 118 rules applied. Total rules applied 1067 place count 270 transition count 389
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1077 place count 270 transition count 379
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 1167 place count 180 transition count 289
Iterating global reduction 2 with 90 rules applied. Total rules applied 1257 place count 180 transition count 289
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 1291 place count 180 transition count 255
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1327 place count 144 transition count 207
Iterating global reduction 3 with 36 rules applied. Total rules applied 1363 place count 144 transition count 207
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 1388 place count 144 transition count 182
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1396 place count 136 transition count 169
Iterating global reduction 4 with 8 rules applied. Total rules applied 1404 place count 136 transition count 169
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1412 place count 128 transition count 161
Iterating global reduction 4 with 8 rules applied. Total rules applied 1420 place count 128 transition count 161
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1425 place count 123 transition count 155
Iterating global reduction 4 with 5 rules applied. Total rules applied 1430 place count 123 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1432 place count 123 transition count 153
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1437 place count 118 transition count 148
Iterating global reduction 5 with 5 rules applied. Total rules applied 1442 place count 118 transition count 148
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1446 place count 114 transition count 144
Iterating global reduction 5 with 4 rules applied. Total rules applied 1450 place count 114 transition count 144
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1452 place count 112 transition count 140
Iterating global reduction 5 with 2 rules applied. Total rules applied 1454 place count 112 transition count 140
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1455 place count 111 transition count 139
Iterating global reduction 5 with 1 rules applied. Total rules applied 1456 place count 111 transition count 139
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1457 place count 110 transition count 138
Iterating global reduction 5 with 1 rules applied. Total rules applied 1458 place count 110 transition count 138
Applied a total of 1458 rules in 218 ms. Remains 110 /414 variables (removed 304) and now considering 138/1954 (removed 1816) transitions.
Finished structural reductions, in 1 iterations. Remains : 110/414 places, 138/1954 transitions.
// Phase 1: matrix 138 rows 110 cols
[2022-06-09 17:36:41] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224276 resets, run finished after 1367 ms. (steps per millisecond=731 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103053 resets, run finished after 577 ms. (steps per millisecond=1733 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103110 resets, run finished after 544 ms. (steps per millisecond=1838 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103342 resets, run finished after 574 ms. (steps per millisecond=1742 ) properties (out of 3) seen :0
// Phase 1: matrix 138 rows 110 cols
[2022-06-09 17:36:44] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-09 17:36:44] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:36:44] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:36:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:36:44] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-06-09 17:36:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:36:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:36:44] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:36:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:36:44] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2022-06-09 17:36:44] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-09 17:36:44] [INFO ] [Nat]Added 58 Read/Feed constraints in 11 ms returned sat
[2022-06-09 17:36:45] [INFO ] Computed and/alt/rep : 30/84/30 causal constraints (skipped 107 transitions) in 14 ms.
[2022-06-09 17:36:45] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2022-06-09 17:36:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2022-06-09 17:36:45] [INFO ] Added : 30 causal constraints over 7 iterations in 187 ms. Result :sat
Minimization took 37 ms.
[2022-06-09 17:36:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:36:45] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:36:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:36:45] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-06-09 17:36:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:36:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:36:45] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:36:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:36:45] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2022-06-09 17:36:45] [INFO ] [Nat]Added 58 Read/Feed constraints in 9 ms returned sat
[2022-06-09 17:36:45] [INFO ] Computed and/alt/rep : 30/84/30 causal constraints (skipped 107 transitions) in 13 ms.
[2022-06-09 17:36:45] [INFO ] Added : 28 causal constraints over 6 iterations in 97 ms. Result :sat
Minimization took 36 ms.
[2022-06-09 17:36:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:36:45] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:36:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:36:45] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-06-09 17:36:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:36:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:36:45] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:36:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:36:45] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2022-06-09 17:36:45] [INFO ] [Nat]Added 58 Read/Feed constraints in 9 ms returned sat
[2022-06-09 17:36:45] [INFO ] Computed and/alt/rep : 30/84/30 causal constraints (skipped 107 transitions) in 13 ms.
[2022-06-09 17:36:45] [INFO ] Added : 29 causal constraints over 6 iterations in 91 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [42, 42, 12] Max seen :[0, 0, 0]
Incomplete Parikh walk after 63500 steps, including 11456 resets, run finished after 103 ms. (steps per millisecond=616 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 19000 steps, including 3216 resets, run finished after 28 ms. (steps per millisecond=678 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 6100 steps, including 645 resets, run finished after 9 ms. (steps per millisecond=677 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 110/110 places, 138/138 transitions.
Applied a total of 0 rules in 8 ms. Remains 110 /110 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 110/110 places, 138/138 transitions.
Starting structural reductions, iteration 0 : 110/110 places, 138/138 transitions.
Applied a total of 0 rules in 7 ms. Remains 110 /110 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 110 cols
[2022-06-09 17:36:45] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:36:45] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 138 rows 110 cols
[2022-06-09 17:36:45] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:36:46] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-09 17:36:46] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2022-06-09 17:36:46] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 138 rows 110 cols
[2022-06-09 17:36:46] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:36:46] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 110/110 places, 138/138 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m96-UpperBounds-07
// Phase 1: matrix 138 rows 110 cols
[2022-06-09 17:36:46] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2226 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1053 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 138 rows 110 cols
[2022-06-09 17:36:46] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:36:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:36:46] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:36:46] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-06-09 17:36:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:36:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:36:46] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:36:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:36:46] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2022-06-09 17:36:46] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-09 17:36:46] [INFO ] [Nat]Added 58 Read/Feed constraints in 11 ms returned sat
[2022-06-09 17:36:46] [INFO ] Computed and/alt/rep : 30/84/30 causal constraints (skipped 107 transitions) in 12 ms.
[2022-06-09 17:36:46] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2022-06-09 17:36:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2022-06-09 17:36:46] [INFO ] Added : 30 causal constraints over 7 iterations in 161 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 6100 steps, including 642 resets, run finished after 11 ms. (steps per millisecond=554 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 110 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 110/110 places, 138/138 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 108 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 125
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 106 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 106 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 106 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 105 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 105 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 105 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 104 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 104 transition count 116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 103 transition count 115
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 103 transition count 115
Applied a total of 17 rules in 29 ms. Remains 103 /110 variables (removed 7) and now considering 115/138 (removed 23) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/110 places, 115/138 transitions.
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:36:46] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224040 resets, run finished after 911 ms. (steps per millisecond=1097 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103290 resets, run finished after 450 ms. (steps per millisecond=2222 ) properties (out of 1) seen :0
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:36:48] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:36:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:36:48] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:36:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:36:48] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-09 17:36:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:36:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:36:48] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:36:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:36:48] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-06-09 17:36:48] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:36:48] [INFO ] [Nat]Added 43 Read/Feed constraints in 10 ms returned sat
[2022-06-09 17:36:48] [INFO ] Computed and/alt/rep : 27/74/27 causal constraints (skipped 87 transitions) in 9 ms.
[2022-06-09 17:36:48] [INFO ] Added : 26 causal constraints over 6 iterations in 77 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 7900 steps, including 952 resets, run finished after 12 ms. (steps per millisecond=658 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 103/103 places, 115/115 transitions.
Applied a total of 0 rules in 5 ms. Remains 103 /103 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 115/115 transitions.
Starting structural reductions, 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.
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:36:48] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 17:36:48] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:36:48] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 17:36:48] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:36:48] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2022-06-09 17:36:48] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:36:48] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:36:48] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 115/115 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m96-UpperBounds-07 in 2319 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m96-UpperBounds-12
// Phase 1: matrix 138 rows 110 cols
[2022-06-09 17:36:48] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2237 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1064 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 138 rows 110 cols
[2022-06-09 17:36:48] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:36:48] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:36:48] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:36:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:36:48] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2022-06-09 17:36:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:36:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2022-06-09 17:36:48] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:36:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:36:48] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2022-06-09 17:36:48] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-09 17:36:48] [INFO ] [Nat]Added 58 Read/Feed constraints in 12 ms returned sat
[2022-06-09 17:36:48] [INFO ] Computed and/alt/rep : 30/84/30 causal constraints (skipped 107 transitions) in 18 ms.
[2022-06-09 17:36:48] [INFO ] Added : 28 causal constraints over 6 iterations in 120 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 19000 steps, including 3179 resets, run finished after 26 ms. (steps per millisecond=730 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 110 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 110/110 places, 138/138 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 108 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 125
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 108 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 106 transition count 121
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 106 transition count 121
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 106 transition count 119
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 104 transition count 116
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 104 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 104 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 18 place count 102 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 102 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 21 place count 101 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 101 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 100 transition count 111
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 100 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 100 transition count 110
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 26 place count 99 transition count 109
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 99 transition count 109
Applied a total of 27 rules in 26 ms. Remains 99 /110 variables (removed 11) and now considering 109/138 (removed 29) transitions.
Finished structural reductions, in 1 iterations. Remains : 99/110 places, 109/138 transitions.
// Phase 1: matrix 109 rows 99 cols
[2022-06-09 17:36:48] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224197 resets, run finished after 861 ms. (steps per millisecond=1161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103496 resets, run finished after 437 ms. (steps per millisecond=2288 ) properties (out of 1) seen :0
// Phase 1: matrix 109 rows 99 cols
[2022-06-09 17:36:50] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:36:50] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:36:50] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:36:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:36:50] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2022-06-09 17:36:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:36:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:36:50] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:36:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:36:50] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-06-09 17:36:50] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-09 17:36:50] [INFO ] [Nat]Added 40 Read/Feed constraints in 13 ms returned sat
[2022-06-09 17:36:50] [INFO ] Computed and/alt/rep : 26/68/26 causal constraints (skipped 82 transitions) in 18 ms.
[2022-06-09 17:36:50] [INFO ] Added : 25 causal constraints over 5 iterations in 74 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 28900 steps, including 4962 resets, run finished after 34 ms. (steps per millisecond=850 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 109/109 transitions.
Applied a total of 0 rules in 11 ms. Remains 99 /99 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 109/109 transitions.
Starting structural reductions, iteration 0 : 99/99 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 109/109 (removed 0) transitions.
// Phase 1: matrix 109 rows 99 cols
[2022-06-09 17:36:50] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:36:50] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 109 rows 99 cols
[2022-06-09 17:36:50] [INFO ] Computed 4 place invariants in 6 ms
[2022-06-09 17:36:50] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-09 17:36:50] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2022-06-09 17:36:50] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 109 rows 99 cols
[2022-06-09 17:36:50] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:36:50] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 109/109 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m96-UpperBounds-12 in 2212 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m96-UpperBounds-15
// Phase 1: matrix 138 rows 110 cols
[2022-06-09 17:36:50] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2226 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1032 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 138 rows 110 cols
[2022-06-09 17:36:50] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:36:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:36:50] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:36:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:36:50] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-06-09 17:36:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:36:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:36:50] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:36:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:36:50] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2022-06-09 17:36:50] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-09 17:36:50] [INFO ] [Nat]Added 58 Read/Feed constraints in 9 ms returned sat
[2022-06-09 17:36:50] [INFO ] Computed and/alt/rep : 30/84/30 causal constraints (skipped 107 transitions) in 11 ms.
[2022-06-09 17:36:51] [INFO ] Added : 29 causal constraints over 6 iterations in 101 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 63500 steps, including 11496 resets, run finished after 81 ms. (steps per millisecond=783 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 110 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 110/110 places, 138/138 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 108 transition count 136
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 136
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 108 transition count 135
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 106 transition count 131
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 106 transition count 131
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 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 105 transition count 128
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 105 transition count 128
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 104 transition count 127
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 104 transition count 127
Applied a total of 15 rules in 17 ms. Remains 104 /110 variables (removed 6) and now considering 127/138 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 104/110 places, 127/138 transitions.
// Phase 1: matrix 127 rows 104 cols
[2022-06-09 17:36:51] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224639 resets, run finished after 978 ms. (steps per millisecond=1022 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103512 resets, run finished after 496 ms. (steps per millisecond=2016 ) properties (out of 1) seen :0
// Phase 1: matrix 127 rows 104 cols
[2022-06-09 17:36:52] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:36:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:36:52] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 13 ms returned sat
[2022-06-09 17:36:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:36:52] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-06-09 17:36:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:36:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:36:52] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:36:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:36:52] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-06-09 17:36:52] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-06-09 17:36:52] [INFO ] [Nat]Added 55 Read/Feed constraints in 15 ms returned sat
[2022-06-09 17:36:52] [INFO ] Computed and/alt/rep : 27/74/27 causal constraints (skipped 99 transitions) in 7 ms.
[2022-06-09 17:36:52] [INFO ] Added : 25 causal constraints over 5 iterations in 73 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 62800 steps, including 12079 resets, run finished after 87 ms. (steps per millisecond=721 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 104/104 places, 127/127 transitions.
Starting structural reductions, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 104 cols
[2022-06-09 17:36:53] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:36:53] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 127 rows 104 cols
[2022-06-09 17:36:53] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:36:53] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-06-09 17:36:53] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2022-06-09 17:36:53] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 127 rows 104 cols
[2022-06-09 17:36:53] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:36:53] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 104/104 places, 127/127 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m96-UpperBounds-15 in 2540 ms.
[2022-06-09 17:36:53] [INFO ] Flatten gal took : 43 ms
[2022-06-09 17:36:53] [INFO ] Applying decomposition
[2022-06-09 17:36:53] [INFO ] Flatten gal took : 14 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/graph10212173225008526189.txt, -o, /tmp/graph10212173225008526189.bin, -w, /tmp/graph10212173225008526189.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/graph10212173225008526189.bin, -l, -1, -v, -w, /tmp/graph10212173225008526189.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 17:36:53] [INFO ] Decomposing Gal with order
[2022-06-09 17:36:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 17:36:53] [INFO ] Removed a total of 118 redundant transitions.
[2022-06-09 17:36:53] [INFO ] Flatten gal took : 45 ms
[2022-06-09 17:36:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 10 ms.
[2022-06-09 17:36:53] [INFO ] Time to serialize gal into /tmp/UpperBounds9483951172075094486.gal : 5 ms
[2022-06-09 17:36:53] [INFO ] Time to serialize properties into /tmp/UpperBounds9730200626214656682.prop : 0 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/UpperBounds9483951172075094486.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds9730200626214656682.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/UpperBounds9483951172075094486.gal -t CGAL -reachable-file /tmp/UpperBounds9730200626214656682.prop --nowitness
Loading property file /tmp/UpperBounds9730200626214656682.prop.
Detected timeout of ITS tools.
[2022-06-09 17:57:02] [INFO ] Flatten gal took : 17 ms
[2022-06-09 17:57:02] [INFO ] Time to serialize gal into /tmp/UpperBounds6321765571431543505.gal : 5 ms
[2022-06-09 17:57:02] [INFO ] Time to serialize properties into /tmp/UpperBounds17767675047144984742.prop : 0 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/UpperBounds6321765571431543505.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds17767675047144984742.prop, --nowitness, --gen-order, FOLLOW], 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/UpperBounds6321765571431543505.gal -t CGAL -reachable-file /tmp/UpperBounds17767675047144984742.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds17767675047144984742.prop.
Detected timeout of ITS tools.
[2022-06-09 18:17:12] [INFO ] Flatten gal took : 11 ms
[2022-06-09 18:17:12] [INFO ] Input system was already deterministic with 138 transitions.
[2022-06-09 18:17:12] [INFO ] Transformed 110 places.
[2022-06-09 18:17:12] [INFO ] Transformed 138 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-09 18:17:12] [INFO ] Time to serialize gal into /tmp/UpperBounds6012737082296133761.gal : 2 ms
[2022-06-09 18:17:12] [INFO ] Time to serialize properties into /tmp/UpperBounds10997435004743741254.prop : 0 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/UpperBounds6012737082296133761.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds10997435004743741254.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], 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/UpperBounds6012737082296133761.gal -t CGAL -reachable-file /tmp/UpperBounds10997435004743741254.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds10997435004743741254.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
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-d2m96"
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-d2m96, 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-165472293000367"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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