Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r106-tall-167814482700453.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is DES-PT-30b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482700453
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.1K Feb 26 15:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 15:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 15:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 15:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 15:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 103K Mar 5 18:22 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 DES-PT-30b-UpperBounds-00
FORMULA_NAME DES-PT-30b-UpperBounds-01
FORMULA_NAME DES-PT-30b-UpperBounds-02
FORMULA_NAME DES-PT-30b-UpperBounds-03
FORMULA_NAME DES-PT-30b-UpperBounds-04
FORMULA_NAME DES-PT-30b-UpperBounds-05
FORMULA_NAME DES-PT-30b-UpperBounds-06
FORMULA_NAME DES-PT-30b-UpperBounds-07
FORMULA_NAME DES-PT-30b-UpperBounds-08
FORMULA_NAME DES-PT-30b-UpperBounds-09
FORMULA_NAME DES-PT-30b-UpperBounds-10
FORMULA_NAME DES-PT-30b-UpperBounds-11
FORMULA_NAME DES-PT-30b-UpperBounds-12
FORMULA_NAME DES-PT-30b-UpperBounds-13
FORMULA_NAME DES-PT-30b-UpperBounds-14
FORMULA_NAME DES-PT-30b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678396870038

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 21:21:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 21:21:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 21:21:11] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-09 21:21:11] [INFO ] Transformed 399 places.
[2023-03-09 21:21:11] [INFO ] Transformed 350 transitions.
[2023-03-09 21:21:11] [INFO ] Found NUPN structural information;
[2023-03-09 21:21:11] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 121 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 350 rows 399 cols
[2023-03-09 21:21:11] [INFO ] Computed 65 place invariants in 34 ms
Incomplete random walk after 10000 steps, including 86 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :12
FORMULA DES-PT-30b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
[2023-03-09 21:21:11] [INFO ] Invariant cache hit.
[2023-03-09 21:21:12] [INFO ] [Real]Absence check using 39 positive place invariants in 15 ms returned sat
[2023-03-09 21:21:12] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 14 ms returned sat
[2023-03-09 21:21:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:12] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2023-03-09 21:21:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 21:21:12] [INFO ] [Nat]Absence check using 39 positive place invariants in 15 ms returned sat
[2023-03-09 21:21:12] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 14 ms returned sat
[2023-03-09 21:21:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:12] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2023-03-09 21:21:12] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 3 ms to minimize.
[2023-03-09 21:21:13] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 1 ms to minimize.
[2023-03-09 21:21:13] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2023-03-09 21:21:13] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2023-03-09 21:21:13] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
[2023-03-09 21:21:13] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 1 ms to minimize.
[2023-03-09 21:21:13] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2023-03-09 21:21:13] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2023-03-09 21:21:13] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 1 ms to minimize.
[2023-03-09 21:21:13] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 0 ms to minimize.
[2023-03-09 21:21:14] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 0 ms to minimize.
[2023-03-09 21:21:14] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 0 ms to minimize.
[2023-03-09 21:21:14] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1423 ms
[2023-03-09 21:21:14] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 24 ms.
[2023-03-09 21:21:16] [INFO ] Added : 311 causal constraints over 63 iterations in 2312 ms. Result :sat
Minimization took 225 ms.
[2023-03-09 21:21:16] [INFO ] [Real]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-09 21:21:16] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-09 21:21:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:16] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-03-09 21:21:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 21:21:17] [INFO ] [Nat]Absence check using 39 positive place invariants in 15 ms returned sat
[2023-03-09 21:21:17] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-09 21:21:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:17] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2023-03-09 21:21:17] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 0 ms to minimize.
[2023-03-09 21:21:17] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 0 ms to minimize.
[2023-03-09 21:21:17] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 0 ms to minimize.
[2023-03-09 21:21:18] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 0 ms to minimize.
[2023-03-09 21:21:18] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2023-03-09 21:21:18] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2023-03-09 21:21:18] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2023-03-09 21:21:18] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2023-03-09 21:21:18] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1110 ms
[2023-03-09 21:21:18] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 22 ms.
[2023-03-09 21:21:20] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2023-03-09 21:21:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-09 21:21:20] [INFO ] Added : 327 causal constraints over 66 iterations in 2539 ms. Result :sat
Minimization took 303 ms.
[2023-03-09 21:21:21] [INFO ] [Real]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-09 21:21:21] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 11 ms returned sat
[2023-03-09 21:21:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:21] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2023-03-09 21:21:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 21:21:21] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-09 21:21:21] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-09 21:21:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:21] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-03-09 21:21:21] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-09 21:21:21] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2023-03-09 21:21:21] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 0 ms to minimize.
[2023-03-09 21:21:21] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2023-03-09 21:21:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 295 ms
[2023-03-09 21:21:21] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 15 ms.
[2023-03-09 21:21:23] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2023-03-09 21:21:24] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2023-03-09 21:21:24] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2023-03-09 21:21:24] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2023-03-09 21:21:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 330 ms
[2023-03-09 21:21:24] [INFO ] Added : 278 causal constraints over 56 iterations in 2376 ms. Result :sat
Minimization took 166 ms.
[2023-03-09 21:21:24] [INFO ] [Real]Absence check using 39 positive place invariants in 10 ms returned sat
[2023-03-09 21:21:24] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-09 21:21:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:24] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2023-03-09 21:21:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 21:21:24] [INFO ] [Nat]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-09 21:21:25] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 301 ms returned sat
[2023-03-09 21:21:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:27] [INFO ] [Nat]Absence check using state equation in 1989 ms returned sat
[2023-03-09 21:21:27] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 0 ms to minimize.
[2023-03-09 21:21:27] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 1 ms to minimize.
[2023-03-09 21:21:27] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 0 ms to minimize.
[2023-03-09 21:21:27] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2023-03-09 21:21:27] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2023-03-09 21:21:27] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 4 ms to minimize.
[2023-03-09 21:21:27] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 0 ms to minimize.
[2023-03-09 21:21:28] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 0 ms to minimize.
[2023-03-09 21:21:28] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2023-03-09 21:21:28] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2023-03-09 21:21:28] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 0 ms to minimize.
[2023-03-09 21:21:28] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 0 ms to minimize.
[2023-03-09 21:21:28] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 0 ms to minimize.
[2023-03-09 21:21:28] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 0 ms to minimize.
[2023-03-09 21:21:28] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 0 ms to minimize.
[2023-03-09 21:21:28] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 0 ms to minimize.
[2023-03-09 21:21:28] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1735 ms
[2023-03-09 21:21:28] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 21 ms.
[2023-03-09 21:21:29] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2023-03-09 21:21:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 350/350 transitions.
Graph (complete) has 858 edges and 399 vertex of which 392 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 392 transition count 323
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 371 transition count 323
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 371 transition count 314
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 362 transition count 314
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 343 transition count 295
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 343 transition count 295
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 343 transition count 294
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 342 transition count 294
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 327 transition count 279
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 327 transition count 279
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 327 transition count 264
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 325 transition count 263
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 325 transition count 260
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 322 transition count 260
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 245 transition count 183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 243 transition count 185
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 243 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 242 transition count 184
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 241 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 240 transition count 183
Applied a total of 319 rules in 155 ms. Remains 240 /399 variables (removed 159) and now considering 183/350 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 240/399 places, 183/350 transitions.
// Phase 1: matrix 183 rows 240 cols
[2023-03-09 21:21:31] [INFO ] Computed 63 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 47581 resets, run finished after 1828 ms. (steps per millisecond=547 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9187 resets, run finished after 882 ms. (steps per millisecond=1133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9117 resets, run finished after 850 ms. (steps per millisecond=1176 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9103 resets, run finished after 852 ms. (steps per millisecond=1173 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9158 resets, run finished after 858 ms. (steps per millisecond=1165 ) properties (out of 4) seen :0
[2023-03-09 21:21:37] [INFO ] Invariant cache hit.
[2023-03-09 21:21:37] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-09 21:21:37] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 12 ms returned sat
[2023-03-09 21:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:37] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-09 21:21:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 21:21:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 21:21:37] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-09 21:21:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:37] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-09 21:21:37] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 0 ms to minimize.
[2023-03-09 21:21:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-09 21:21:37] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-09 21:21:37] [INFO ] Added : 149 causal constraints over 30 iterations in 472 ms. Result :sat
Minimization took 51 ms.
[2023-03-09 21:21:38] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 21:21:38] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-09 21:21:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:38] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-09 21:21:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 21:21:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 21:21:38] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-09 21:21:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:38] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-09 21:21:38] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2023-03-09 21:21:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-09 21:21:38] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-09 21:21:38] [INFO ] Added : 116 causal constraints over 24 iterations in 342 ms. Result :sat
Minimization took 45 ms.
[2023-03-09 21:21:38] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2023-03-09 21:21:38] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 12 ms returned sat
[2023-03-09 21:21:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:38] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-09 21:21:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 21:21:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 21:21:38] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-09 21:21:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:38] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-09 21:21:39] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-09 21:21:39] [INFO ] Added : 94 causal constraints over 19 iterations in 289 ms. Result :sat
Minimization took 45 ms.
[2023-03-09 21:21:39] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 21:21:39] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-09 21:21:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:39] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-09 21:21:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 21:21:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 21:21:39] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-09 21:21:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:39] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-09 21:21:39] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-09 21:21:39] [INFO ] Added : 101 causal constraints over 21 iterations in 280 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Applied a total of 0 rules in 10 ms. Remains 240 /240 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 240/240 places, 183/183 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Applied a total of 0 rules in 9 ms. Remains 240 /240 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2023-03-09 21:21:40] [INFO ] Invariant cache hit.
[2023-03-09 21:21:40] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-09 21:21:40] [INFO ] Invariant cache hit.
[2023-03-09 21:21:40] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2023-03-09 21:21:40] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-09 21:21:40] [INFO ] Invariant cache hit.
[2023-03-09 21:21:41] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 509 ms. Remains : 240/240 places, 183/183 transitions.
Starting property specific reduction for DES-PT-30b-UpperBounds-04
[2023-03-09 21:21:41] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 480 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 91 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-09 21:21:41] [INFO ] Invariant cache hit.
[2023-03-09 21:21:41] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 21:21:41] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-09 21:21:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:41] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-09 21:21:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 21:21:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 21:21:41] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-09 21:21:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:41] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-09 21:21:41] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2023-03-09 21:21:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-09 21:21:41] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-09 21:21:41] [INFO ] Added : 149 causal constraints over 30 iterations in 468 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Applied a total of 0 rules in 8 ms. Remains 240 /240 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 240/240 places, 183/183 transitions.
[2023-03-09 21:21:42] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47909 resets, run finished after 1666 ms. (steps per millisecond=600 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9092 resets, run finished after 828 ms. (steps per millisecond=1207 ) properties (out of 1) seen :0
[2023-03-09 21:21:44] [INFO ] Invariant cache hit.
[2023-03-09 21:21:44] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 21:21:44] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-09 21:21:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:44] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-09 21:21:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 21:21:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 21:21:44] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-09 21:21:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:44] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-09 21:21:44] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2023-03-09 21:21:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-09 21:21:45] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 9 ms.
[2023-03-09 21:21:45] [INFO ] Added : 149 causal constraints over 30 iterations in 454 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Applied a total of 0 rules in 13 ms. Remains 240 /240 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 240/240 places, 183/183 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Applied a total of 0 rules in 10 ms. Remains 240 /240 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2023-03-09 21:21:45] [INFO ] Invariant cache hit.
[2023-03-09 21:21:45] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-09 21:21:45] [INFO ] Invariant cache hit.
[2023-03-09 21:21:46] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2023-03-09 21:21:46] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-09 21:21:46] [INFO ] Invariant cache hit.
[2023-03-09 21:21:46] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 496 ms. Remains : 240/240 places, 183/183 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-04 in 5156 ms.
Starting property specific reduction for DES-PT-30b-UpperBounds-07
[2023-03-09 21:21:46] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 472 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-09 21:21:46] [INFO ] Invariant cache hit.
[2023-03-09 21:21:46] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 21:21:46] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-09 21:21:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:46] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-09 21:21:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 21:21:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 21:21:46] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-09 21:21:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:46] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-09 21:21:46] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2023-03-09 21:21:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-09 21:21:46] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-09 21:21:46] [INFO ] Added : 116 causal constraints over 24 iterations in 345 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Graph (complete) has 803 edges and 240 vertex of which 236 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 236 transition count 182
Applied a total of 2 rules in 12 ms. Remains 236 /240 variables (removed 4) and now considering 182/183 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 236/240 places, 182/183 transitions.
// Phase 1: matrix 182 rows 236 cols
[2023-03-09 21:21:47] [INFO ] Computed 60 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 48042 resets, run finished after 1688 ms. (steps per millisecond=592 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9082 resets, run finished after 808 ms. (steps per millisecond=1237 ) properties (out of 1) seen :0
[2023-03-09 21:21:49] [INFO ] Invariant cache hit.
[2023-03-09 21:21:49] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:21:49] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-09 21:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:49] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-09 21:21:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 21:21:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 21:21:49] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 55 ms returned sat
[2023-03-09 21:21:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:49] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-09 21:21:50] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-09 21:21:50] [INFO ] Added : 119 causal constraints over 24 iterations in 332 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-09 21:21:50] [INFO ] Invariant cache hit.
[2023-03-09 21:21:50] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-09 21:21:50] [INFO ] Invariant cache hit.
[2023-03-09 21:21:50] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2023-03-09 21:21:50] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 21:21:50] [INFO ] Invariant cache hit.
[2023-03-09 21:21:51] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 465 ms. Remains : 236/236 places, 182/182 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-07 in 4768 ms.
Starting property specific reduction for DES-PT-30b-UpperBounds-14
// Phase 1: matrix 183 rows 240 cols
[2023-03-09 21:21:51] [INFO ] Computed 63 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 505 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-09 21:21:51] [INFO ] Invariant cache hit.
[2023-03-09 21:21:51] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 21:21:51] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-09 21:21:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:51] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-09 21:21:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 21:21:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 21:21:51] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-09 21:21:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:51] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-09 21:21:51] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-09 21:21:51] [INFO ] Added : 94 causal constraints over 19 iterations in 286 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Graph (complete) has 803 edges and 240 vertex of which 236 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 236 transition count 182
Applied a total of 2 rules in 11 ms. Remains 236 /240 variables (removed 4) and now considering 182/183 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 236/240 places, 182/183 transitions.
// Phase 1: matrix 182 rows 236 cols
[2023-03-09 21:21:51] [INFO ] Computed 60 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 48048 resets, run finished after 1725 ms. (steps per millisecond=579 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9253 resets, run finished after 846 ms. (steps per millisecond=1182 ) properties (out of 1) seen :0
[2023-03-09 21:21:54] [INFO ] Invariant cache hit.
[2023-03-09 21:21:54] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 21:21:54] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-09 21:21:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:54] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2023-03-09 21:21:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 21:21:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 21:21:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2023-03-09 21:21:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:54] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2023-03-09 21:21:54] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-09 21:21:55] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2023-03-09 21:21:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-09 21:21:55] [INFO ] Added : 119 causal constraints over 24 iterations in 414 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-09 21:21:55] [INFO ] Invariant cache hit.
[2023-03-09 21:21:55] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-09 21:21:55] [INFO ] Invariant cache hit.
[2023-03-09 21:21:55] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2023-03-09 21:21:55] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 21:21:55] [INFO ] Invariant cache hit.
[2023-03-09 21:21:55] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 489 ms. Remains : 236/236 places, 182/182 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-14 in 4902 ms.
Starting property specific reduction for DES-PT-30b-UpperBounds-15
// Phase 1: matrix 183 rows 240 cols
[2023-03-09 21:21:55] [INFO ] Computed 63 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 476 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 95 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-09 21:21:55] [INFO ] Invariant cache hit.
[2023-03-09 21:21:55] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 21:21:56] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 18 ms returned sat
[2023-03-09 21:21:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:56] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-09 21:21:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 21:21:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 21:21:56] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-09 21:21:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:56] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-09 21:21:56] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-09 21:21:56] [INFO ] Added : 101 causal constraints over 21 iterations in 281 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Graph (complete) has 803 edges and 240 vertex of which 236 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 236 transition count 182
Applied a total of 2 rules in 11 ms. Remains 236 /240 variables (removed 4) and now considering 182/183 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 236/240 places, 182/183 transitions.
// Phase 1: matrix 182 rows 236 cols
[2023-03-09 21:21:56] [INFO ] Computed 60 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 47542 resets, run finished after 1737 ms. (steps per millisecond=575 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9120 resets, run finished after 842 ms. (steps per millisecond=1187 ) properties (out of 1) seen :0
[2023-03-09 21:21:59] [INFO ] Invariant cache hit.
[2023-03-09 21:21:59] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-09 21:21:59] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-09 21:21:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:59] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2023-03-09 21:21:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 21:21:59] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:21:59] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 38 ms returned sat
[2023-03-09 21:21:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 21:21:59] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2023-03-09 21:21:59] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2023-03-09 21:21:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-09 21:21:59] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-09 21:22:00] [INFO ] Added : 111 causal constraints over 23 iterations in 354 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-09 21:22:00] [INFO ] Invariant cache hit.
[2023-03-09 21:22:00] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-09 21:22:00] [INFO ] Invariant cache hit.
[2023-03-09 21:22:00] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2023-03-09 21:22:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 21:22:00] [INFO ] Invariant cache hit.
[2023-03-09 21:22:00] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 468 ms. Remains : 236/236 places, 182/182 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-15 in 5009 ms.
[2023-03-09 21:22:01] [INFO ] Flatten gal took : 50 ms
[2023-03-09 21:22:01] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-09 21:22:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 240 places, 183 transitions and 901 arcs took 2 ms.
Total runtime 49808 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DES_PT_30b
(NrP: 240 NrTr: 183 NrArc: 901)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.004sec

net check time: 0m 0.000sec

init dd package: 0m 2.745sec


before gc: list nodes free: 936392

after gc: idd nodes used:764172, unused:63235828; list nodes free:285919570

RS generation: 8m41.037sec


-> reachability set: #nodes 523458 (5.2e+05) #states 23,688,949,534,766 (13)



starting MCC model checker
--------------------------

checking: place_bound(p62)
normalized: place_bound(p62)

-> the formula is 1

FORMULA DES-PT-30b-UpperBounds-04 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p70)
normalized: place_bound(p70)

-> the formula is 1

FORMULA DES-PT-30b-UpperBounds-07 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p46)
normalized: place_bound(p46)

-> the formula is 1

FORMULA DES-PT-30b-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p104)
normalized: place_bound(p104)

-> the formula is 1

FORMULA DES-PT-30b-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 79957244 (8.0e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 260822608 1547419160 1808241768
used/not used/entry size/cache size: 66371667 737197 16 1024MB
basic ops cache: hits/miss/sum: 2490773 12416112 14906885
used/not used/entry size/cache size: 1850838 14926378 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 89525 523535 613060
used/not used/entry size/cache size: 508584 7880024 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 53351343
1 11310747
2 2012080
3 364189
4 60130
5 8991
6 1235
7 136
8 12
9 1
>= 10 0

Total processing time: 8m47.557sec


BK_STOP 1678397449789

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec

427374 466810 616461 575391 519352 494906 512432 655861 523937 492935 493884 495927 653229
iterations count:1333942 (7289), effective:99206 (542)

initing FirstDep: 0m 0.000sec

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="DES-PT-30b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is DES-PT-30b, 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 r106-tall-167814482700453"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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