About the Execution of ITS-Tools for DES-PT-50b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3334.228 | 1590052.00 | 1619504.00 | 4001.40 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
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-167814475400485.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-50b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475400485
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.3K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 26 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 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 127K 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-50b-UpperBounds-00
FORMULA_NAME DES-PT-50b-UpperBounds-01
FORMULA_NAME DES-PT-50b-UpperBounds-02
FORMULA_NAME DES-PT-50b-UpperBounds-03
FORMULA_NAME DES-PT-50b-UpperBounds-04
FORMULA_NAME DES-PT-50b-UpperBounds-05
FORMULA_NAME DES-PT-50b-UpperBounds-06
FORMULA_NAME DES-PT-50b-UpperBounds-07
FORMULA_NAME DES-PT-50b-UpperBounds-08
FORMULA_NAME DES-PT-50b-UpperBounds-09
FORMULA_NAME DES-PT-50b-UpperBounds-10
FORMULA_NAME DES-PT-50b-UpperBounds-11
FORMULA_NAME DES-PT-50b-UpperBounds-12
FORMULA_NAME DES-PT-50b-UpperBounds-13
FORMULA_NAME DES-PT-50b-UpperBounds-14
FORMULA_NAME DES-PT-50b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678278282008
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-50b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-08 12:24:43] [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 12:24:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 12:24:43] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-03-08 12:24:43] [INFO ] Transformed 479 places.
[2023-03-08 12:24:43] [INFO ] Transformed 430 transitions.
[2023-03-08 12:24:43] [INFO ] Found NUPN structural information;
[2023-03-08 12:24:43] [INFO ] Parsed PT model containing 479 places and 430 transitions and 1463 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 430 rows 479 cols
[2023-03-08 12:24:43] [INFO ] Computed 65 place invariants in 48 ms
Incomplete random walk after 10000 steps, including 83 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :11
FORMULA DES-PT-50b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) 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 5) 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 5) seen :0
[2023-03-08 12:24:44] [INFO ] Invariant cache hit.
[2023-03-08 12:24:44] [INFO ] [Real]Absence check using 40 positive place invariants in 25 ms returned sat
[2023-03-08 12:24:44] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 12:24:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:24:44] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-03-08 12:24:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:24:44] [INFO ] [Nat]Absence check using 40 positive place invariants in 23 ms returned sat
[2023-03-08 12:24:44] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 22 ms returned sat
[2023-03-08 12:24:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:24:45] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2023-03-08 12:24:45] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 32 ms.
[2023-03-08 12:24:47] [INFO ] Added : 230 causal constraints over 46 iterations in 2700 ms. Result :sat
Minimization took 224 ms.
[2023-03-08 12:24:48] [INFO ] [Real]Absence check using 40 positive place invariants in 14 ms returned sat
[2023-03-08 12:24:48] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 12:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:24:48] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2023-03-08 12:24:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:24:48] [INFO ] [Nat]Absence check using 40 positive place invariants in 16 ms returned sat
[2023-03-08 12:24:48] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 12:24:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:24:48] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2023-03-08 12:24:48] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 3 ms to minimize.
[2023-03-08 12:24:48] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2023-03-08 12:24:48] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2023-03-08 12:24:49] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2023-03-08 12:24:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 519 ms
[2023-03-08 12:24:49] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 29 ms.
[2023-03-08 12:24:51] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 1 ms to minimize.
[2023-03-08 12:24:52] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2023-03-08 12:24:52] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 0 ms to minimize.
[2023-03-08 12:24:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 420 ms
[2023-03-08 12:24:52] [INFO ] Added : 238 causal constraints over 48 iterations in 3271 ms. Result :sat
Minimization took 741 ms.
[2023-03-08 12:24:53] [INFO ] [Real]Absence check using 40 positive place invariants in 12 ms returned sat
[2023-03-08 12:24:53] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 12:24:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:24:53] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2023-03-08 12:24:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:24:53] [INFO ] [Nat]Absence check using 40 positive place invariants in 14 ms returned sat
[2023-03-08 12:24:53] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 12:24:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:24:53] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-08 12:24:53] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2023-03-08 12:24:53] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2023-03-08 12:24:53] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2023-03-08 12:24:54] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 0 ms to minimize.
[2023-03-08 12:24:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 463 ms
[2023-03-08 12:24:54] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 27 ms.
[2023-03-08 12:24:57] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2023-03-08 12:24:57] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 0 ms to minimize.
[2023-03-08 12:24:57] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2023-03-08 12:24:57] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 0 ms to minimize.
[2023-03-08 12:24:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 488 ms
[2023-03-08 12:24:57] [INFO ] Added : 272 causal constraints over 55 iterations in 3831 ms. Result :sat
Minimization took 211 ms.
[2023-03-08 12:24:58] [INFO ] [Real]Absence check using 40 positive place invariants in 13 ms returned sat
[2023-03-08 12:24:58] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 12:24:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:24:58] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2023-03-08 12:24:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:24:58] [INFO ] [Nat]Absence check using 40 positive place invariants in 13 ms returned sat
[2023-03-08 12:24:58] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 12:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:24:58] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2023-03-08 12:24:58] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2023-03-08 12:24:58] [INFO ] Deduced a trap composed of 79 places in 83 ms of which 1 ms to minimize.
[2023-03-08 12:24:58] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 1 ms to minimize.
[2023-03-08 12:24:59] [INFO ] Deduced a trap composed of 79 places in 81 ms of which 0 ms to minimize.
[2023-03-08 12:24:59] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 1 ms to minimize.
[2023-03-08 12:24:59] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 1 ms to minimize.
[2023-03-08 12:24:59] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 0 ms to minimize.
[2023-03-08 12:24:59] [INFO ] Deduced a trap composed of 92 places in 71 ms of which 1 ms to minimize.
[2023-03-08 12:24:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 814 ms
[2023-03-08 12:24:59] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 32 ms.
[2023-03-08 12:25:02] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 0 ms to minimize.
[2023-03-08 12:25:02] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 0 ms to minimize.
[2023-03-08 12:25:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 278 ms
[2023-03-08 12:25:02] [INFO ] Added : 279 causal constraints over 57 iterations in 3392 ms. Result :sat
Minimization took 404 ms.
[2023-03-08 12:25:03] [INFO ] [Real]Absence check using 40 positive place invariants in 13 ms returned sat
[2023-03-08 12:25:03] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 24 ms returned sat
[2023-03-08 12:25:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:03] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2023-03-08 12:25:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:25:03] [INFO ] [Nat]Absence check using 40 positive place invariants in 14 ms returned sat
[2023-03-08 12:25:03] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 12:25:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:04] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2023-03-08 12:25:04] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 0 ms to minimize.
[2023-03-08 12:25:04] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 1 ms to minimize.
[2023-03-08 12:25:05] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 1 ms to minimize.
[2023-03-08 12:25:05] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 0 ms to minimize.
[2023-03-08 12:25:05] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 0 ms to minimize.
[2023-03-08 12:25:05] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2023-03-08 12:25:05] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 0 ms to minimize.
[2023-03-08 12:25:05] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 1 ms to minimize.
[2023-03-08 12:25:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1562 ms
[2023-03-08 12:25:05] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 24 ms.
[2023-03-08 12:25:08] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 1 ms to minimize.
[2023-03-08 12:25:08] [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 4
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, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 479 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 479/479 places, 430/430 transitions.
Graph (complete) has 1098 edges and 479 vertex of which 468 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 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 468 transition count 402
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 447 transition count 402
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 447 transition count 393
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 438 transition count 393
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 419 transition count 374
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 419 transition count 374
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 419 transition count 373
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 418 transition count 373
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 403 transition count 358
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 403 transition count 358
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 403 transition count 343
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 401 transition count 342
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 401 transition count 339
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 398 transition count 339
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 321 transition count 262
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 319 transition count 264
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 319 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 318 transition count 263
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 318 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 317 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 316 transition count 262
Applied a total of 320 rules in 197 ms. Remains 316 /479 variables (removed 163) and now considering 262/430 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 316/479 places, 262/430 transitions.
// Phase 1: matrix 262 rows 316 cols
[2023-03-08 12:25:10] [INFO ] Computed 60 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 47820 resets, run finished after 1883 ms. (steps per millisecond=531 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9202 resets, run finished after 846 ms. (steps per millisecond=1182 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9115 resets, run finished after 840 ms. (steps per millisecond=1190 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9095 resets, run finished after 829 ms. (steps per millisecond=1206 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9310 resets, run finished after 852 ms. (steps per millisecond=1173 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9074 resets, run finished after 897 ms. (steps per millisecond=1114 ) properties (out of 5) seen :0
[2023-03-08 12:25:16] [INFO ] Invariant cache hit.
[2023-03-08 12:25:16] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 12:25:16] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 12:25:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:17] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-08 12:25:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:25:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 12:25:17] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 94 ms returned sat
[2023-03-08 12:25:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:17] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2023-03-08 12:25:17] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 16 ms.
[2023-03-08 12:25:17] [INFO ] Added : 102 causal constraints over 21 iterations in 419 ms. Result :sat
Minimization took 99 ms.
[2023-03-08 12:25:18] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 12:25:18] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 12:25:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:18] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2023-03-08 12:25:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:25:18] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 12:25:18] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 94 ms returned sat
[2023-03-08 12:25:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:18] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2023-03-08 12:25:18] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 14 ms.
[2023-03-08 12:25:19] [INFO ] Added : 111 causal constraints over 23 iterations in 459 ms. Result :sat
Minimization took 128 ms.
[2023-03-08 12:25:19] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 12:25:19] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 12:25:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:19] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2023-03-08 12:25:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:25:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 12:25:19] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 93 ms returned sat
[2023-03-08 12:25:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:19] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2023-03-08 12:25:19] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 14 ms.
[2023-03-08 12:25:20] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2023-03-08 12:25:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-08 12:25:20] [INFO ] Added : 141 causal constraints over 29 iterations in 697 ms. Result :sat
Minimization took 88 ms.
[2023-03-08 12:25:20] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2023-03-08 12:25:20] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 12:25:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:20] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-08 12:25:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:25:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 12:25:20] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 94 ms returned sat
[2023-03-08 12:25:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:21] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2023-03-08 12:25:21] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 15 ms.
[2023-03-08 12:25:21] [INFO ] Added : 109 causal constraints over 22 iterations in 473 ms. Result :sat
Minimization took 131 ms.
[2023-03-08 12:25:21] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 12:25:21] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 12:25:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:21] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2023-03-08 12:25:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:25:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 12:25:22] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 113 ms returned sat
[2023-03-08 12:25:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:22] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2023-03-08 12:25:22] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2023-03-08 12:25:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-08 12:25:22] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-08 12:25:23] [INFO ] Added : 123 causal constraints over 25 iterations in 567 ms. Result :sat
Minimization took 140 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 11 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 10 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-08 12:25:24] [INFO ] Invariant cache hit.
[2023-03-08 12:25:24] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-08 12:25:24] [INFO ] Invariant cache hit.
[2023-03-08 12:25:24] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2023-03-08 12:25:24] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-08 12:25:24] [INFO ] Invariant cache hit.
[2023-03-08 12:25:24] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 702 ms. Remains : 316/316 places, 262/262 transitions.
Starting property specific reduction for DES-PT-50b-UpperBounds-05
[2023-03-08 12:25:24] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 488 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 100 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-08 12:25:24] [INFO ] Invariant cache hit.
[2023-03-08 12:25:24] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 12:25:24] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-08 12:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:25] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-03-08 12:25:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:25:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 12:25:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 94 ms returned sat
[2023-03-08 12:25:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:25] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2023-03-08 12:25:25] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 18 ms.
[2023-03-08 12:25:25] [INFO ] Added : 102 causal constraints over 21 iterations in 387 ms. Result :sat
Minimization took 99 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 16 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 316/316 places, 262/262 transitions.
[2023-03-08 12:25:26] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47845 resets, run finished after 1792 ms. (steps per millisecond=558 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9134 resets, run finished after 818 ms. (steps per millisecond=1222 ) properties (out of 1) seen :0
[2023-03-08 12:25:28] [INFO ] Invariant cache hit.
[2023-03-08 12:25:28] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 12:25:28] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-08 12:25:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:28] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2023-03-08 12:25:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:25:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 12:25:29] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 94 ms returned sat
[2023-03-08 12:25:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:29] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2023-03-08 12:25:29] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 16 ms.
[2023-03-08 12:25:29] [INFO ] Added : 102 causal constraints over 21 iterations in 405 ms. Result :sat
Minimization took 102 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 10 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 10 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-08 12:25:30] [INFO ] Invariant cache hit.
[2023-03-08 12:25:30] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-08 12:25:30] [INFO ] Invariant cache hit.
[2023-03-08 12:25:30] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2023-03-08 12:25:30] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 12:25:30] [INFO ] Invariant cache hit.
[2023-03-08 12:25:30] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 708 ms. Remains : 316/316 places, 262/262 transitions.
Ending property specific reduction for DES-PT-50b-UpperBounds-05 in 5899 ms.
Starting property specific reduction for DES-PT-50b-UpperBounds-07
[2023-03-08 12:25:30] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 474 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 12:25:30] [INFO ] Invariant cache hit.
[2023-03-08 12:25:30] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 12:25:30] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 12:25:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:30] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2023-03-08 12:25:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:25:30] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 12:25:31] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 94 ms returned sat
[2023-03-08 12:25:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:31] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2023-03-08 12:25:31] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 14 ms.
[2023-03-08 12:25:31] [INFO ] Added : 111 causal constraints over 23 iterations in 458 ms. Result :sat
Minimization took 126 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 9 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 316/316 places, 262/262 transitions.
[2023-03-08 12:25:32] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47798 resets, run finished after 1787 ms. (steps per millisecond=559 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9143 resets, run finished after 823 ms. (steps per millisecond=1215 ) properties (out of 1) seen :0
[2023-03-08 12:25:34] [INFO ] Invariant cache hit.
[2023-03-08 12:25:34] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 12:25:34] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 12:25:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:34] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-03-08 12:25:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:25:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 12:25:35] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 104 ms returned sat
[2023-03-08 12:25:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:35] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2023-03-08 12:25:35] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 15 ms.
[2023-03-08 12:25:35] [INFO ] Added : 111 causal constraints over 23 iterations in 477 ms. Result :sat
Minimization took 125 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 14 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 20 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-08 12:25:36] [INFO ] Invariant cache hit.
[2023-03-08 12:25:36] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-08 12:25:36] [INFO ] Invariant cache hit.
[2023-03-08 12:25:36] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2023-03-08 12:25:36] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 12:25:36] [INFO ] Invariant cache hit.
[2023-03-08 12:25:36] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 680 ms. Remains : 316/316 places, 262/262 transitions.
Ending property specific reduction for DES-PT-50b-UpperBounds-07 in 6017 ms.
Starting property specific reduction for DES-PT-50b-UpperBounds-08
[2023-03-08 12:25:36] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 453 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 12:25:36] [INFO ] Invariant cache hit.
[2023-03-08 12:25:36] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 12:25:36] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-08 12:25:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:36] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-08 12:25:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:25:37] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 12:25:37] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 96 ms returned sat
[2023-03-08 12:25:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:37] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2023-03-08 12:25:37] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 15 ms.
[2023-03-08 12:25:38] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2023-03-08 12:25:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-08 12:25:38] [INFO ] Added : 141 causal constraints over 29 iterations in 744 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 8 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 316/316 places, 262/262 transitions.
[2023-03-08 12:25:38] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47709 resets, run finished after 1893 ms. (steps per millisecond=528 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9060 resets, run finished after 825 ms. (steps per millisecond=1212 ) properties (out of 1) seen :0
[2023-03-08 12:25:41] [INFO ] Invariant cache hit.
[2023-03-08 12:25:41] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 12:25:41] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-08 12:25:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:41] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-08 12:25:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:25:41] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 12:25:41] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 100 ms returned sat
[2023-03-08 12:25:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:41] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2023-03-08 12:25:41] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 13 ms.
[2023-03-08 12:25:42] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2023-03-08 12:25:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-08 12:25:42] [INFO ] Added : 141 causal constraints over 29 iterations in 667 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 8 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 8 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-08 12:25:43] [INFO ] Invariant cache hit.
[2023-03-08 12:25:43] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-08 12:25:43] [INFO ] Invariant cache hit.
[2023-03-08 12:25:43] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2023-03-08 12:25:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:25:43] [INFO ] Invariant cache hit.
[2023-03-08 12:25:43] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 672 ms. Remains : 316/316 places, 262/262 transitions.
Ending property specific reduction for DES-PT-50b-UpperBounds-08 in 7025 ms.
Starting property specific reduction for DES-PT-50b-UpperBounds-09
[2023-03-08 12:25:43] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 479 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 84 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-08 12:25:43] [INFO ] Invariant cache hit.
[2023-03-08 12:25:43] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 12:25:43] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 12:25:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:43] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2023-03-08 12:25:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:25:44] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 12:25:44] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 94 ms returned sat
[2023-03-08 12:25:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:44] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2023-03-08 12:25:44] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 14 ms.
[2023-03-08 12:25:44] [INFO ] Added : 109 causal constraints over 22 iterations in 502 ms. Result :sat
Minimization took 135 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 11 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 316/316 places, 262/262 transitions.
[2023-03-08 12:25:45] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47810 resets, run finished after 1807 ms. (steps per millisecond=553 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9129 resets, run finished after 847 ms. (steps per millisecond=1180 ) properties (out of 1) seen :0
[2023-03-08 12:25:47] [INFO ] Invariant cache hit.
[2023-03-08 12:25:47] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 12:25:47] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-08 12:25:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:48] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2023-03-08 12:25:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:25:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2023-03-08 12:25:48] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 94 ms returned sat
[2023-03-08 12:25:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:48] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2023-03-08 12:25:48] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 13 ms.
[2023-03-08 12:25:48] [INFO ] Added : 109 causal constraints over 22 iterations in 500 ms. Result :sat
Minimization took 134 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-08 12:25:49] [INFO ] Invariant cache hit.
[2023-03-08 12:25:49] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-08 12:25:49] [INFO ] Invariant cache hit.
[2023-03-08 12:25:49] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
[2023-03-08 12:25:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:25:49] [INFO ] Invariant cache hit.
[2023-03-08 12:25:49] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 652 ms. Remains : 316/316 places, 262/262 transitions.
Ending property specific reduction for DES-PT-50b-UpperBounds-09 in 6126 ms.
Starting property specific reduction for DES-PT-50b-UpperBounds-10
[2023-03-08 12:25:49] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 485 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 99 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-08 12:25:49] [INFO ] Invariant cache hit.
[2023-03-08 12:25:49] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 12:25:49] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-08 12:25:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:50] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2023-03-08 12:25:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:25:50] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2023-03-08 12:25:50] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 113 ms returned sat
[2023-03-08 12:25:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:50] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2023-03-08 12:25:50] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2023-03-08 12:25:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-08 12:25:50] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-08 12:25:51] [INFO ] Added : 123 causal constraints over 25 iterations in 553 ms. Result :sat
Minimization took 140 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 9 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 316/316 places, 262/262 transitions.
[2023-03-08 12:25:51] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47484 resets, run finished after 1780 ms. (steps per millisecond=561 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9161 resets, run finished after 825 ms. (steps per millisecond=1212 ) properties (out of 1) seen :0
[2023-03-08 12:25:54] [INFO ] Invariant cache hit.
[2023-03-08 12:25:54] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 12:25:54] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2023-03-08 12:25:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:54] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2023-03-08 12:25:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:25:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 12:25:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 114 ms returned sat
[2023-03-08 12:25:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:25:54] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2023-03-08 12:25:54] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2023-03-08 12:25:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-08 12:25:54] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 15 ms.
[2023-03-08 12:25:55] [INFO ] Added : 123 causal constraints over 25 iterations in 552 ms. Result :sat
Minimization took 146 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 11 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 14 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-08 12:25:55] [INFO ] Invariant cache hit.
[2023-03-08 12:25:55] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-08 12:25:55] [INFO ] Invariant cache hit.
[2023-03-08 12:25:56] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2023-03-08 12:25:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:25:56] [INFO ] Invariant cache hit.
[2023-03-08 12:25:56] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 671 ms. Remains : 316/316 places, 262/262 transitions.
Ending property specific reduction for DES-PT-50b-UpperBounds-10 in 6312 ms.
[2023-03-08 12:25:56] [INFO ] Flatten gal took : 82 ms
[2023-03-08 12:25:56] [INFO ] Applying decomposition
[2023-03-08 12:25:56] [INFO ] Flatten gal took : 23 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/graph10546490479103500464.txt' '-o' '/tmp/graph10546490479103500464.bin' '-w' '/tmp/graph10546490479103500464.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10546490479103500464.bin' '-l' '-1' '-v' '-w' '/tmp/graph10546490479103500464.weights' '-q' '0' '-e' '0.001'
[2023-03-08 12:25:56] [INFO ] Decomposing Gal with order
[2023-03-08 12:25:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 12:25:56] [INFO ] Removed a total of 85 redundant transitions.
[2023-03-08 12:25:56] [INFO ] Flatten gal took : 62 ms
[2023-03-08 12:25:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 7 ms.
[2023-03-08 12:25:56] [INFO ] Time to serialize gal into /tmp/UpperBounds14552575953744145291.gal : 7 ms
[2023-03-08 12:25:56] [INFO ] Time to serialize properties into /tmp/UpperBounds353787575362342453.prop : 21 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/UpperBounds14552575953744145291.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds353787575362342453.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/UpperBounds353787575362342453.prop.
Detected timeout of ITS tools.
[2023-03-08 12:46:20] [INFO ] Applying decomposition
[2023-03-08 12:46:20] [INFO ] Flatten gal took : 22 ms
[2023-03-08 12:46:21] [INFO ] Decomposing Gal with order
[2023-03-08 12:46:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 12:46:21] [INFO ] Removed a total of 387 redundant transitions.
[2023-03-08 12:46:21] [INFO ] Flatten gal took : 51 ms
[2023-03-08 12:46:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 697 labels/synchronizations in 17 ms.
[2023-03-08 12:46:21] [INFO ] Time to serialize gal into /tmp/UpperBounds1559069864383773574.gal : 5 ms
[2023-03-08 12:46:21] [INFO ] Time to serialize properties into /tmp/UpperBounds1870037595558904539.prop : 0 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/UpperBounds1559069864383773574.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1870037595558904539.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/UpperBounds1870037595558904539.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,6.83126e+13,285.957,2397640,10842,1493,2.69219e+06,18161,427,1.82089e+07,279,90854,0
Total reachable state count : 68312609047672
Verifying 5 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-50b-UpperBounds-05 :0 <= i0.i0.u6.p148 <= 1
FORMULA DES-PT-50b-UpperBounds-05 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-50b-UpperBounds-05,0,288.793,2397640,1,0,2.69219e+06,20519,619,1.82089e+07,350,150278,12004
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-50b-UpperBounds-07 :0 <= i0.i0.u6.p139 <= 1
FORMULA DES-PT-50b-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-50b-UpperBounds-07,0,288.807,2397640,1,0,2.69219e+06,20539,629,1.82089e+07,391,150373,12016
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-50b-UpperBounds-08 :0 <= i0.i0.u6.p111 <= 1
FORMULA DES-PT-50b-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-50b-UpperBounds-08,0,288.808,2397640,1,0,2.69219e+06,20587,639,1.82089e+07,488,150608,12028
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-50b-UpperBounds-09 :0 <= i0.i0.u6.p141 <= 1
FORMULA DES-PT-50b-UpperBounds-09 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-50b-UpperBounds-09,0,288.809,2397640,1,0,2.69219e+06,20605,649,1.82089e+07,525,150693,12040
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-50b-UpperBounds-10 :0 <= i0.i0.i0.u4.p46 <= 1
FORMULA DES-PT-50b-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-50b-UpperBounds-10,0,288.809,2397640,1,0,2.69219e+06,20614,662,1.82089e+07,544,150710,12054
Total runtime 1586942 ms.
BK_STOP 1678279872060
--------------------
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-50b"
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-50b, 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-167814475400485"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50b.tgz
mv DES-PT-50b 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 '
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 ;