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.r101-tall-167814475400453.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 itstools
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 r101-tall-167814475400453
=====================================================================

--------------------
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 1678271596906

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-08 10:33:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 10:33:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 10:33:18] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-08 10:33:18] [INFO ] Transformed 399 places.
[2023-03-08 10:33:18] [INFO ] Transformed 350 transitions.
[2023-03-08 10:33:18] [INFO ] Found NUPN structural information;
[2023-03-08 10:33:18] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 350 rows 399 cols
[2023-03-08 10:33:18] [INFO ] Computed 65 place invariants in 33 ms
Incomplete random walk after 10000 steps, including 82 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 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
[2023-03-08 10:33:18] [INFO ] Invariant cache hit.
[2023-03-08 10:33:19] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2023-03-08 10:33:19] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 13 ms returned sat
[2023-03-08 10:33:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:19] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2023-03-08 10:33:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:33:19] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-08 10:33:19] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 13 ms returned sat
[2023-03-08 10:33:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:19] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2023-03-08 10:33:19] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2023-03-08 10:33:19] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 0 ms to minimize.
[2023-03-08 10:33:20] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 1 ms to minimize.
[2023-03-08 10:33:20] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2023-03-08 10:33:20] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
[2023-03-08 10:33:20] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2023-03-08 10:33:20] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2023-03-08 10:33:20] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2023-03-08 10:33:20] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2023-03-08 10:33:20] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2023-03-08 10:33:20] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 0 ms to minimize.
[2023-03-08 10:33:21] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2023-03-08 10:33:21] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1319 ms
[2023-03-08 10:33:21] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 27 ms.
[2023-03-08 10:33:23] [INFO ] Added : 311 causal constraints over 63 iterations in 2309 ms. Result :sat
Minimization took 233 ms.
[2023-03-08 10:33:23] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-08 10:33:23] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 13 ms returned sat
[2023-03-08 10:33:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:23] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2023-03-08 10:33:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:33:23] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-08 10:33:23] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 14 ms returned sat
[2023-03-08 10:33:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:24] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2023-03-08 10:33:24] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2023-03-08 10:33:24] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 0 ms to minimize.
[2023-03-08 10:33:24] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 0 ms to minimize.
[2023-03-08 10:33:24] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 0 ms to minimize.
[2023-03-08 10:33:25] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2023-03-08 10:33:25] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2023-03-08 10:33:25] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2023-03-08 10:33:25] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2023-03-08 10:33:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1168 ms
[2023-03-08 10:33:25] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 18 ms.
[2023-03-08 10:33:27] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2023-03-08 10:33:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-08 10:33:27] [INFO ] Added : 327 causal constraints over 66 iterations in 2575 ms. Result :sat
Minimization took 307 ms.
[2023-03-08 10:33:28] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-08 10:33:28] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 15 ms returned sat
[2023-03-08 10:33:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:28] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-03-08 10:33:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:33:28] [INFO ] [Nat]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-08 10:33:28] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-08 10:33:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:28] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2023-03-08 10:33:28] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2023-03-08 10:33:28] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2023-03-08 10:33:28] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2023-03-08 10:33:28] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2023-03-08 10:33:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 324 ms
[2023-03-08 10:33:28] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 21 ms.
[2023-03-08 10:33:30] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 0 ms to minimize.
[2023-03-08 10:33:31] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2023-03-08 10:33:31] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 0 ms to minimize.
[2023-03-08 10:33:31] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2023-03-08 10:33:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 340 ms
[2023-03-08 10:33:31] [INFO ] Added : 278 causal constraints over 56 iterations in 2402 ms. Result :sat
Minimization took 157 ms.
[2023-03-08 10:33:31] [INFO ] [Real]Absence check using 39 positive place invariants in 10 ms returned sat
[2023-03-08 10:33:31] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-08 10:33:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:31] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2023-03-08 10:33:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:33:31] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-08 10:33:32] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 301 ms returned sat
[2023-03-08 10:33:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:34] [INFO ] [Nat]Absence check using state equation in 1974 ms returned sat
[2023-03-08 10:33:34] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 0 ms to minimize.
[2023-03-08 10:33:34] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2023-03-08 10:33:34] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 1 ms to minimize.
[2023-03-08 10:33:34] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 0 ms to minimize.
[2023-03-08 10:33:34] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2023-03-08 10:33:34] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 3 ms to minimize.
[2023-03-08 10:33:34] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 0 ms to minimize.
[2023-03-08 10:33:35] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2023-03-08 10:33:35] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 0 ms to minimize.
[2023-03-08 10:33:35] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2023-03-08 10:33:35] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 0 ms to minimize.
[2023-03-08 10:33:35] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 0 ms to minimize.
[2023-03-08 10:33:35] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2023-03-08 10:33:35] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 0 ms to minimize.
[2023-03-08 10:33:35] [INFO ] Deduced a trap composed of 77 places in 63 ms of which 0 ms to minimize.
[2023-03-08 10:33:35] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 0 ms to minimize.
[2023-03-08 10:33:35] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1700 ms
[2023-03-08 10:33:35] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 19 ms.
[2023-03-08 10:33:36] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2023-03-08 10:33:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 3 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 0 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 2 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 1 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 153 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 154 ms. Remains : 240/399 places, 183/350 transitions.
// Phase 1: matrix 183 rows 240 cols
[2023-03-08 10:33:38] [INFO ] Computed 63 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 47658 resets, run finished after 1878 ms. (steps per millisecond=532 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9258 resets, run finished after 859 ms. (steps per millisecond=1164 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8952 resets, run finished after 844 ms. (steps per millisecond=1184 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9140 resets, run finished after 872 ms. (steps per millisecond=1146 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9205 resets, run finished after 842 ms. (steps per millisecond=1187 ) properties (out of 4) seen :0
[2023-03-08 10:33:44] [INFO ] Invariant cache hit.
[2023-03-08 10:33:44] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 10:33:44] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 10:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:44] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-08 10:33:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:33:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:33:44] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 16 ms returned sat
[2023-03-08 10:33:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:44] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-08 10:33:44] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2023-03-08 10:33:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-08 10:33:44] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 8 ms.
[2023-03-08 10:33:44] [INFO ] Added : 149 causal constraints over 30 iterations in 466 ms. Result :sat
Minimization took 49 ms.
[2023-03-08 10:33:45] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-08 10:33:45] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 10:33:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:45] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-08 10:33:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:33:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 10:33:45] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 10:33:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:45] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-08 10:33:45] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2023-03-08 10:33:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-08 10:33:45] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 8 ms.
[2023-03-08 10:33:45] [INFO ] Added : 116 causal constraints over 24 iterations in 341 ms. Result :sat
Minimization took 45 ms.
[2023-03-08 10:33:45] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:33:45] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 10:33:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:45] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-08 10:33:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:33:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 10:33:45] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 10:33:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:45] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-08 10:33:45] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 9 ms.
[2023-03-08 10:33:46] [INFO ] Added : 94 causal constraints over 19 iterations in 287 ms. Result :sat
Minimization took 45 ms.
[2023-03-08 10:33:46] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:33:46] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 17 ms returned sat
[2023-03-08 10:33:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:46] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-08 10:33:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:33:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:33:46] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 10:33:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:46] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-08 10:33:46] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 9 ms.
[2023-03-08 10:33:46] [INFO ] Added : 101 causal constraints over 21 iterations in 273 ms. Result :sat
Minimization took 41 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 9 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 9 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-08 10:33:47] [INFO ] Invariant cache hit.
[2023-03-08 10:33:47] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-08 10:33:47] [INFO ] Invariant cache hit.
[2023-03-08 10:33:47] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2023-03-08 10:33:47] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 10:33:47] [INFO ] Invariant cache hit.
[2023-03-08 10:33:48] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 495 ms. Remains : 240/240 places, 183/183 transitions.
Starting property specific reduction for DES-PT-30b-UpperBounds-04
[2023-03-08 10:33:48] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 461 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-08 10:33:48] [INFO ] Invariant cache hit.
[2023-03-08 10:33:48] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:33:48] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 9 ms returned sat
[2023-03-08 10:33:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:48] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-08 10:33:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:33:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:33:48] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 10:33:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:48] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-08 10:33:48] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2023-03-08 10:33:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-08 10:33:48] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 9 ms.
[2023-03-08 10:33:48] [INFO ] Added : 149 causal constraints over 30 iterations in 470 ms. Result :sat
Minimization took 54 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 6 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 7 ms. Remains : 240/240 places, 183/183 transitions.
[2023-03-08 10:33:49] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47925 resets, run finished after 1771 ms. (steps per millisecond=564 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9055 resets, run finished after 851 ms. (steps per millisecond=1175 ) properties (out of 1) seen :0
[2023-03-08 10:33:51] [INFO ] Invariant cache hit.
[2023-03-08 10:33:51] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:33:51] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 10:33:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:51] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-08 10:33:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:33:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:33:51] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 10:33:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:51] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-08 10:33:52] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2023-03-08 10:33:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-08 10:33:52] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-08 10:33:52] [INFO ] Added : 149 causal constraints over 30 iterations in 479 ms. Result :sat
Minimization took 50 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 7 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.
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.
[2023-03-08 10:33:52] [INFO ] Invariant cache hit.
[2023-03-08 10:33:52] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-08 10:33:52] [INFO ] Invariant cache hit.
[2023-03-08 10:33:53] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2023-03-08 10:33:53] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 10:33:53] [INFO ] Invariant cache hit.
[2023-03-08 10:33:53] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 502 ms. Remains : 240/240 places, 183/183 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-04 in 5307 ms.
Starting property specific reduction for DES-PT-30b-UpperBounds-07
[2023-03-08 10:33:53] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 462 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 98 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-08 10:33:53] [INFO ] Invariant cache hit.
[2023-03-08 10:33:53] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:33:53] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 16 ms returned sat
[2023-03-08 10:33:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:53] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-08 10:33:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:33:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:33:53] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 10:33:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:53] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-08 10:33:53] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2023-03-08 10:33:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-08 10:33:53] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 8 ms.
[2023-03-08 10:33:54] [INFO ] Added : 116 causal constraints over 24 iterations in 353 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.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 13 ms. Remains : 236/240 places, 182/183 transitions.
// Phase 1: matrix 182 rows 236 cols
[2023-03-08 10:33:54] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47952 resets, run finished after 1745 ms. (steps per millisecond=573 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9129 resets, run finished after 816 ms. (steps per millisecond=1225 ) properties (out of 1) seen :0
[2023-03-08 10:33:56] [INFO ] Invariant cache hit.
[2023-03-08 10:33:56] [INFO ] [Real]Absence check using 36 positive place invariants in 10 ms returned sat
[2023-03-08 10:33:56] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-08 10:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:56] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-08 10:33:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:33:56] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 10:33:57] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 52 ms returned sat
[2023-03-08 10:33:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:57] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-08 10:33:57] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 9 ms.
[2023-03-08 10:33:57] [INFO ] Added : 119 causal constraints over 24 iterations in 339 ms. Result :sat
Minimization took 57 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 13 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-08 10:33:57] [INFO ] Invariant cache hit.
[2023-03-08 10:33:57] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-08 10:33:57] [INFO ] Invariant cache hit.
[2023-03-08 10:33:58] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2023-03-08 10:33:58] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 10:33:58] [INFO ] Invariant cache hit.
[2023-03-08 10:33:58] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 474 ms. Remains : 236/236 places, 182/182 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-07 in 4828 ms.
Starting property specific reduction for DES-PT-30b-UpperBounds-14
// Phase 1: matrix 183 rows 240 cols
[2023-03-08 10:33:58] [INFO ] Computed 63 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 485 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-08 10:33:58] [INFO ] Invariant cache hit.
[2023-03-08 10:33:58] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:33:58] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 10:33:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:58] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-08 10:33:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:33:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:33:58] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 10:33:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:33:58] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-08 10:33:58] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 43 ms.
[2023-03-08 10:33:58] [INFO ] Added : 94 causal constraints over 19 iterations in 347 ms. Result :sat
Minimization took 45 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 23 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 24 ms. Remains : 236/240 places, 182/183 transitions.
// Phase 1: matrix 182 rows 236 cols
[2023-03-08 10:33:58] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47654 resets, run finished after 1709 ms. (steps per millisecond=585 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9125 resets, run finished after 815 ms. (steps per millisecond=1226 ) properties (out of 1) seen :0
[2023-03-08 10:34:01] [INFO ] Invariant cache hit.
[2023-03-08 10:34:01] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 10:34:01] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-08 10:34:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:34:01] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-08 10:34:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:34:01] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 10:34:01] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2023-03-08 10:34:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:34:01] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2023-03-08 10:34:01] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-08 10:34:02] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2023-03-08 10:34:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-08 10:34:02] [INFO ] Added : 119 causal constraints over 24 iterations in 397 ms. Result :sat
Minimization took 61 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 8 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 8 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 5 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-08 10:34:02] [INFO ] Invariant cache hit.
[2023-03-08 10:34:02] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-08 10:34:02] [INFO ] Invariant cache hit.
[2023-03-08 10:34:02] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-08 10:34:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 10:34:02] [INFO ] Invariant cache hit.
[2023-03-08 10:34:03] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 478 ms. Remains : 236/236 places, 182/182 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-14 in 4853 ms.
Starting property specific reduction for DES-PT-30b-UpperBounds-15
// Phase 1: matrix 183 rows 240 cols
[2023-03-08 10:34:03] [INFO ] Computed 63 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 468 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 10:34:03] [INFO ] Invariant cache hit.
[2023-03-08 10:34:03] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:34:03] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 10:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:34:03] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-08 10:34:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:34:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 10:34:03] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 15 ms returned sat
[2023-03-08 10:34:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:34:03] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-08 10:34:03] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-08 10:34:03] [INFO ] Added : 101 causal constraints over 21 iterations in 283 ms. Result :sat
Minimization took 42 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.5 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 20 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 20 ms. Remains : 236/240 places, 182/183 transitions.
// Phase 1: matrix 182 rows 236 cols
[2023-03-08 10:34:03] [INFO ] Computed 60 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 47813 resets, run finished after 1705 ms. (steps per millisecond=586 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9130 resets, run finished after 807 ms. (steps per millisecond=1239 ) properties (out of 1) seen :0
[2023-03-08 10:34:06] [INFO ] Invariant cache hit.
[2023-03-08 10:34:06] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 10:34:06] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-08 10:34:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:34:06] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-08 10:34:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:34:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 10:34:06] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 37 ms returned sat
[2023-03-08 10:34:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:34:06] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2023-03-08 10:34:06] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2023-03-08 10:34:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-08 10:34:06] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 8 ms.
[2023-03-08 10:34:07] [INFO ] Added : 111 causal constraints over 23 iterations in 342 ms. Result :sat
Minimization took 46 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 5 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 5 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-08 10:34:07] [INFO ] Invariant cache hit.
[2023-03-08 10:34:07] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-08 10:34:07] [INFO ] Invariant cache hit.
[2023-03-08 10:34:07] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2023-03-08 10:34:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 10:34:07] [INFO ] Invariant cache hit.
[2023-03-08 10:34:07] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 236/236 places, 182/182 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-15 in 4729 ms.
[2023-03-08 10:34:07] [INFO ] Flatten gal took : 52 ms
[2023-03-08 10:34:07] [INFO ] Applying decomposition
[2023-03-08 10:34:07] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12829612788277919643.txt' '-o' '/tmp/graph12829612788277919643.bin' '-w' '/tmp/graph12829612788277919643.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12829612788277919643.bin' '-l' '-1' '-v' '-w' '/tmp/graph12829612788277919643.weights' '-q' '0' '-e' '0.001'
[2023-03-08 10:34:08] [INFO ] Decomposing Gal with order
[2023-03-08 10:34:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 10:34:08] [INFO ] Removed a total of 44 redundant transitions.
[2023-03-08 10:34:08] [INFO ] Flatten gal took : 43 ms
[2023-03-08 10:34:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2023-03-08 10:34:08] [INFO ] Time to serialize gal into /tmp/UpperBounds6321657666438606458.gal : 5 ms
[2023-03-08 10:34:08] [INFO ] Time to serialize properties into /tmp/UpperBounds2326475816527404172.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6321657666438606458.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2326475816527404172.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds2326475816527404172.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,2.36889e+13,2.06645,71692,10382,3975,166576,9018,253,171775,292,73946,0
Total reachable state count : 23688949534766

Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-30b-UpperBounds-04 :0 <= u11.p67 <= 1
FORMULA DES-PT-30b-UpperBounds-04 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
DES-PT-30b-UpperBounds-04,0,3.22493,74324,1,0,166576,30503,437,289266,398,364486,2642
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-30b-UpperBounds-07 :0 <= u11.p75 <= 1
FORMULA DES-PT-30b-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-30b-UpperBounds-07,0,3.23198,74324,1,0,166576,30529,464,289595,451,364628,2656
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-30b-UpperBounds-14 :0 <= u46.p51 <= 1
FORMULA DES-PT-30b-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-30b-UpperBounds-14,0,4.16259,113396,1,0,184072,42844,496,428778,494,481901,4209
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-30b-UpperBounds-15 :0 <= u2.p109 <= 1
FORMULA DES-PT-30b-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-30b-UpperBounds-15,0,4.16404,113660,1,0,184181,42869,532,428984,541,482087,4248
Total runtime 54125 ms.

BK_STOP 1678271653395

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-30b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
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 r101-tall-167814475400453"
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 ;