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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.1K Jun 7 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 7 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 7 17:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 7 17:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 6 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 7.6K Jun 7 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 7 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K 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 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-d2m18-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654795116937

Running Version 0
[2022-06-09 17:18:38] [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:18:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 17:18:38] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2022-06-09 17:18:38] [INFO ] Transformed 2398 places.
[2022-06-09 17:18:38] [INFO ] Transformed 1954 transitions.
[2022-06-09 17:18:38] [INFO ] Parsed PT model containing 2398 places and 1954 transitions in 210 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 1984 places in 20 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1954 rows 414 cols
[2022-06-09 17:18:38] [INFO ] Computed 6 place invariants in 71 ms
Incomplete random walk after 10000 steps, including 2201 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 916 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 915 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 902 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
// Phase 1: matrix 1954 rows 414 cols
[2022-06-09 17:18:39] [INFO ] Computed 6 place invariants in 44 ms
[2022-06-09 17:18:39] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-09 17:18:39] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-09 17:18:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:18:39] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2022-06-09 17:18:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:18:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 17 ms returned sat
[2022-06-09 17:18:40] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 11 ms returned sat
[2022-06-09 17:18:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:18:40] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2022-06-09 17:18:40] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2022-06-09 17:18:44] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 17:18:45] [INFO ] [Nat]Added 1674 Read/Feed constraints in 4157 ms returned unknown
[2022-06-09 17:18:45] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 17:18:45] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-09 17:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:18:45] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2022-06-09 17:18:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:18:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 17:18:45] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-09 17:18:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:18:45] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2022-06-09 17:18:49] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 17:18:49] [INFO ] [Nat]Added 1674 Read/Feed constraints in 3683 ms returned sat
[2022-06-09 17:18:49] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 3 ms to minimize.
[2022-06-09 17:18:50] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 1 ms to minimize.
[2022-06-09 17:18:50] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 2 ms to minimize.
[2022-06-09 17:18:50] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 2 ms to minimize.
[2022-06-09 17:18:50] [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:18:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 17:18:50] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-09 17:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:18:51] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2022-06-09 17:18:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:18:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 17:18:51] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:18:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:18:51] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2022-06-09 17:18:55] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 17:18:56] [INFO ] [Nat]Added 1674 Read/Feed constraints in 4550 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.14 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 119 places :
Symmetric choice reduction at 1 with 119 rule applications. Total rules 950 place count 269 transition count 372
Iterating global reduction 1 with 119 rules applied. Total rules applied 1069 place count 269 transition count 372
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1079 place count 269 transition count 362
Discarding 91 places :
Symmetric choice reduction at 2 with 91 rule applications. Total rules 1170 place count 178 transition count 271
Iterating global reduction 2 with 91 rules applied. Total rules applied 1261 place count 178 transition count 271
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 1296 place count 178 transition count 236
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1333 place count 141 transition count 185
Iterating global reduction 3 with 37 rules applied. Total rules applied 1370 place count 141 transition count 185
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 1392 place count 141 transition count 163
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1401 place count 132 transition count 149
Iterating global reduction 4 with 9 rules applied. Total rules applied 1410 place count 132 transition count 149
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1419 place count 123 transition count 140
Iterating global reduction 4 with 9 rules applied. Total rules applied 1428 place count 123 transition count 140
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1433 place count 118 transition count 134
Iterating global reduction 4 with 5 rules applied. Total rules applied 1438 place count 118 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1439 place count 118 transition count 133
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1444 place count 113 transition count 128
Iterating global reduction 5 with 5 rules applied. Total rules applied 1449 place count 113 transition count 128
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1453 place count 109 transition count 124
Iterating global reduction 5 with 4 rules applied. Total rules applied 1457 place count 109 transition count 124
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1459 place count 107 transition count 120
Iterating global reduction 5 with 2 rules applied. Total rules applied 1461 place count 107 transition count 120
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1462 place count 106 transition count 119
Iterating global reduction 5 with 1 rules applied. Total rules applied 1463 place count 106 transition count 119
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1464 place count 105 transition count 118
Iterating global reduction 5 with 1 rules applied. Total rules applied 1465 place count 105 transition count 118
Applied a total of 1465 rules in 130 ms. Remains 105 /414 variables (removed 309) and now considering 118/1954 (removed 1836) transitions.
Finished structural reductions, in 1 iterations. Remains : 105/414 places, 118/1954 transitions.
// Phase 1: matrix 118 rows 105 cols
[2022-06-09 17:18:56] [INFO ] Computed 4 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 224595 resets, run finished after 928 ms. (steps per millisecond=1077 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103190 resets, run finished after 465 ms. (steps per millisecond=2150 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103492 resets, run finished after 431 ms. (steps per millisecond=2320 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103797 resets, run finished after 433 ms. (steps per millisecond=2309 ) properties (out of 3) seen :0
// Phase 1: matrix 118 rows 105 cols
[2022-06-09 17:18:58] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-09 17:18:58] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:18:58] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:18:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:18:58] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-09 17:18:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:18:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:18:58] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:18:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:18:58] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-06-09 17:18:58] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-09 17:18:58] [INFO ] [Nat]Added 44 Read/Feed constraints in 7 ms returned sat
[2022-06-09 17:18:58] [INFO ] Computed and/alt/rep : 28/77/28 causal constraints (skipped 89 transitions) in 10 ms.
[2022-06-09 17:18:58] [INFO ] Added : 27 causal constraints over 6 iterations in 85 ms. Result :sat
Minimization took 32 ms.
[2022-06-09 17:18:58] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:18:58] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 17:18:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:18:58] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2022-06-09 17:18:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:18:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:18:58] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:18:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:18:58] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-09 17:18:58] [INFO ] [Nat]Added 44 Read/Feed constraints in 9 ms returned sat
[2022-06-09 17:18:58] [INFO ] Computed and/alt/rep : 28/77/28 causal constraints (skipped 89 transitions) in 11 ms.
[2022-06-09 17:18:58] [INFO ] Added : 27 causal constraints over 6 iterations in 100 ms. Result :sat
Minimization took 31 ms.
[2022-06-09 17:18:59] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:18:59] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 17:18:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:18:59] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-06-09 17:18:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:18:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:18:59] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-09 17:18:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:18:59] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2022-06-09 17:18:59] [INFO ] [Nat]Added 44 Read/Feed constraints in 6 ms returned sat
[2022-06-09 17:18:59] [INFO ] Computed and/alt/rep : 28/77/28 causal constraints (skipped 89 transitions) in 9 ms.
[2022-06-09 17:18:59] [INFO ] Added : 27 causal constraints over 6 iterations in 96 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [42, 42, 12] Max seen :[0, 0, 0]
Incomplete Parikh walk after 23800 steps, including 3977 resets, run finished after 44 ms. (steps per millisecond=540 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 41500 steps, including 7299 resets, run finished after 54 ms. (steps per millisecond=768 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 8900 steps, including 1097 resets, run finished after 11 ms. (steps per millisecond=809 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 118/118 transitions.
Applied a total of 0 rules in 17 ms. Remains 105 /105 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 118/118 transitions.
Starting structural reductions, iteration 0 : 105/105 places, 118/118 transitions.
Applied a total of 0 rules in 10 ms. Remains 105 /105 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 105 cols
[2022-06-09 17:18:59] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:18:59] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 118 rows 105 cols
[2022-06-09 17:18:59] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:18:59] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-09 17:18:59] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2022-06-09 17:18:59] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 118 rows 105 cols
[2022-06-09 17:18:59] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:18:59] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 118/118 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-03
// Phase 1: matrix 118 rows 105 cols
[2022-06-09 17:18:59] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2257 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1043 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 118 rows 105 cols
[2022-06-09 17:18:59] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:18:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:18:59] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:18:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:18:59] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-06-09 17:18:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:18:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:18:59] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-09 17:18:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:18:59] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-06-09 17:18:59] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-09 17:18:59] [INFO ] [Nat]Added 44 Read/Feed constraints in 8 ms returned sat
[2022-06-09 17:18:59] [INFO ] Computed and/alt/rep : 28/77/28 causal constraints (skipped 89 transitions) in 11 ms.
[2022-06-09 17:18:59] [INFO ] Added : 27 causal constraints over 6 iterations in 87 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 8900 steps, including 1126 resets, run finished after 19 ms. (steps per millisecond=468 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 118/118 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 103 transition count 116
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 103 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 102 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 102 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 102 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 101 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 101 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 100 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 100 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 99 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 99 transition count 108
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 99 transition count 107
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 98 transition count 106
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 98 transition count 106
Applied a total of 18 rules in 20 ms. Remains 98 /105 variables (removed 7) and now considering 106/118 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 98/105 places, 106/118 transitions.
// Phase 1: matrix 106 rows 98 cols
[2022-06-09 17:19:00] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224483 resets, run finished after 816 ms. (steps per millisecond=1225 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 102847 resets, run finished after 412 ms. (steps per millisecond=2427 ) properties (out of 1) seen :0
// Phase 1: matrix 106 rows 98 cols
[2022-06-09 17:19:01] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 17:19:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:19:01] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:19:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:19:01] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-06-09 17:19:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:19:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:19:01] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:19:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:19:01] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-06-09 17:19:01] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-09 17:19:01] [INFO ] [Nat]Added 39 Read/Feed constraints in 7 ms returned sat
[2022-06-09 17:19:01] [INFO ] Computed and/alt/rep : 26/65/26 causal constraints (skipped 79 transitions) in 10 ms.
[2022-06-09 17:19:01] [INFO ] Added : 24 causal constraints over 5 iterations in 61 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 29200 steps, including 5002 resets, run finished after 35 ms. (steps per millisecond=834 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 106/106 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 106/106 transitions.
Starting structural reductions, iteration 0 : 98/98 places, 106/106 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 98 cols
[2022-06-09 17:19:01] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:19:01] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 106 rows 98 cols
[2022-06-09 17:19:01] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:19:01] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-09 17:19:01] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2022-06-09 17:19:01] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 106 rows 98 cols
[2022-06-09 17:19:01] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-09 17:19:01] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 106/106 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-03 in 2078 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-08
// Phase 1: matrix 118 rows 105 cols
[2022-06-09 17:19:01] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1028 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 118 rows 105 cols
[2022-06-09 17:19:01] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:19:01] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:19:01] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:19:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:19:01] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-06-09 17:19:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:19:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:19:01] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:19:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:19:01] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2022-06-09 17:19:01] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-09 17:19:01] [INFO ] [Nat]Added 44 Read/Feed constraints in 8 ms returned sat
[2022-06-09 17:19:01] [INFO ] Computed and/alt/rep : 28/77/28 causal constraints (skipped 89 transitions) in 11 ms.
[2022-06-09 17:19:02] [INFO ] Added : 27 causal constraints over 6 iterations in 83 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 41500 steps, including 7326 resets, run finished after 43 ms. (steps per millisecond=965 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 118/118 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 103 transition count 116
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 116
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 103 transition count 115
Applied a total of 5 rules in 6 ms. Remains 103 /105 variables (removed 2) and now considering 115/118 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/105 places, 115/118 transitions.
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:19:02] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224559 resets, run finished after 834 ms. (steps per millisecond=1199 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103443 resets, run finished after 422 ms. (steps per millisecond=2369 ) properties (out of 1) seen :0
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:19:03] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:19:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:19:03] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:19:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:19:03] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-06-09 17:19:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:19:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:19:03] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:19:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:19:03] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-06-09 17:19:03] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:19:03] [INFO ] [Nat]Added 43 Read/Feed constraints in 9 ms returned sat
[2022-06-09 17:19:03] [INFO ] Computed and/alt/rep : 27/74/27 causal constraints (skipped 87 transitions) in 11 ms.
[2022-06-09 17:19:03] [INFO ] Added : 26 causal constraints over 6 iterations in 76 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 38500 steps, including 7027 resets, run finished after 42 ms. (steps per millisecond=916 ) 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 4 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:19:03] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:19:03] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:19:03] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:19:03] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:19:03] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2022-06-09 17:19:03] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 115 rows 103 cols
[2022-06-09 17:19:03] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:19:03] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 115/115 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-08 in 2155 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-10
// Phase 1: matrix 118 rows 105 cols
[2022-06-09 17:19:03] [INFO ] Computed 4 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2282 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1049 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 118 rows 105 cols
[2022-06-09 17:19:03] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:19:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:19:04] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 6 ms returned sat
[2022-06-09 17:19:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:19:04] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-06-09 17:19:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:19:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:19:04] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:19:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:19:04] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-06-09 17:19:04] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-09 17:19:04] [INFO ] [Nat]Added 44 Read/Feed constraints in 7 ms returned sat
[2022-06-09 17:19:04] [INFO ] Computed and/alt/rep : 28/77/28 causal constraints (skipped 89 transitions) in 10 ms.
[2022-06-09 17:19:04] [INFO ] Added : 27 causal constraints over 6 iterations in 90 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 23800 steps, including 4023 resets, run finished after 30 ms. (steps per millisecond=793 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 118/118 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 103 transition count 116
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 116
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 103 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 102 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 102 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 102 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 101 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 101 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 100 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 100 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 99 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 99 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 99 transition count 108
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 98 transition count 107
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 98 transition count 107
Applied a total of 17 rules in 16 ms. Remains 98 /105 variables (removed 7) and now considering 107/118 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 98/105 places, 107/118 transitions.
// Phase 1: matrix 107 rows 98 cols
[2022-06-09 17:19:04] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224639 resets, run finished after 790 ms. (steps per millisecond=1265 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103030 resets, run finished after 397 ms. (steps per millisecond=2518 ) properties (out of 1) seen :0
// Phase 1: matrix 107 rows 98 cols
[2022-06-09 17:19:05] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:19:05] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:19:05] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:19:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:19:05] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-09 17:19:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:19:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:19:05] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:19:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:19:05] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-06-09 17:19:05] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-09 17:19:05] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2022-06-09 17:19:05] [INFO ] Computed and/alt/rep : 25/68/25 causal constraints (skipped 81 transitions) in 7 ms.
[2022-06-09 17:19:05] [INFO ] Added : 23 causal constraints over 5 iterations in 81 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 28300 steps, including 4662 resets, run finished after 28 ms. (steps per millisecond=1010 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 107/107 transitions.
Applied a total of 0 rules in 16 ms. Remains 98 /98 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 107/107 transitions.
Starting structural reductions, iteration 0 : 98/98 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 98 cols
[2022-06-09 17:19:05] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:19:05] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 107 rows 98 cols
[2022-06-09 17:19:05] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:19:05] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-09 17:19:05] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2022-06-09 17:19:05] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 107 rows 98 cols
[2022-06-09 17:19:05] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:19:06] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 107/107 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-10 in 2051 ms.
[2022-06-09 17:19:06] [INFO ] Flatten gal took : 38 ms
[2022-06-09 17:19:06] [INFO ] Applying decomposition
[2022-06-09 17:19:06] [INFO ] Flatten gal took : 12 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/graph15213542544502326787.txt, -o, /tmp/graph15213542544502326787.bin, -w, /tmp/graph15213542544502326787.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/graph15213542544502326787.bin, -l, -1, -v, -w, /tmp/graph15213542544502326787.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 17:19:06] [INFO ] Decomposing Gal with order
[2022-06-09 17:19:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 17:19:06] [INFO ] Removed a total of 105 redundant transitions.
[2022-06-09 17:19:06] [INFO ] Flatten gal took : 37 ms
[2022-06-09 17:19:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 8 ms.
[2022-06-09 17:19:06] [INFO ] Time to serialize gal into /tmp/UpperBounds5711520958598433730.gal : 5 ms
[2022-06-09 17:19:06] [INFO ] Time to serialize properties into /tmp/UpperBounds7761964621709770489.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/UpperBounds5711520958598433730.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds7761964621709770489.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/UpperBounds5711520958598433730.gal -t CGAL -reachable-file /tmp/UpperBounds7761964621709770489.prop --nowitness
Loading property file /tmp/UpperBounds7761964621709770489.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,5.01655e+10,1005.32,3901676,5902,2018,3.55155e+06,61852,373,2.07458e+07,120,518763,0
Total reachable state count : 50165463548

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d2m18-UpperBounds-03 :0 <= i9.i0.u10.p89 <= 1
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-03 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-d2m18-UpperBounds-03,0,1022.66,3901676,1,0,3.55155e+06,150173,487,2.07458e+07,143,935958,2560
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d2m18-UpperBounds-08 :0 <= i3.u22.p123 <= 1
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-08 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-d2m18-UpperBounds-08,0,1023.08,3901676,1,0,3.55155e+06,185494,523,2.07458e+07,152,1.05617e+06,3564
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d2m18-UpperBounds-10 :0 <= u19.l1685 <= 1
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-10 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-d2m18-UpperBounds-10,0,1023.16,3901676,1,0,3.55155e+06,194862,542,2.07458e+07,175,1.09179e+06,3741

BK_STOP 1654796171202

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

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